1000 resultados para Teoria dels efectes oblidats
Resumo:
"Vegeu el resum a l'inici del document del fitxer adjunt."
Resumo:
"Vegeu el resum a l'inici del document del fitxer adjunt."
Resumo:
"Vegeu el resum a l'inici del document del fitxer adjunt."
Resumo:
We describe a method for determining the minimal length of elements in the generalized Thompson's groups F(p). We compute the length of an element by constructing a tree pair diagram for the element, classifying the nodes of the tree and summing associated weights from the pairs of node classifications. We use this method to effectively find minimal length representatives of an element.
Resumo:
We construct generating trees with with one, two, and three labels for some classes of permutations avoiding generalized patterns of length 3 and 4. These trees are built by adding at each level an entry to the right end of the permutation, which allows us to incorporate the adjacency condition about some entries in an occurrence of a generalized pattern. We use these trees to find functional equations for the generating functions enumerating these classes of permutations with respect to different parameters. In several cases we solve them using the kernel method and some ideas of Bousquet-Mélou [2]. We obtain refinements of known enumerative results and find new ones.
Resumo:
We prove that, under suitable assumptions on a category C, the existence of supercompact cardinals implies that every absolute epireflective class of objects of C is a small-orthogonality class. More precisely, if L is a localization functor on an accessible category C such that the unit morphism X→LX is an extremal epimorphism for all X, and the class of L-local objects is defined by an absolute formula with parameters, then the existence of a supercompact cardinal above the cardinalities of the parameters implies that L is a localization with respect to some set of morphisms.
Resumo:
Let G be an abstract Kac-Moody group over a finite field and G the closure of the image of G in the automorphism group of its positive building. We show that if the Dynkin diagram associated to G is irreducible and neither of spherical nor of affine type, then the contraction groups of elements in G which are not topologically periodic are not closed. (In those groups there always exist elements which are not topologically periodic.)
Resumo:
We study the existence theory for parabolic variational inequalities in weighted L2 spaces with respect to excessive measures associated with a transition semigroup. We characterize the value function of optimal stopping problems for finite and infinite dimensional diffusions as a generalized solution of such a variational inequality. The weighted L2 setting allows us to cover some singular cases, such as optimal stopping for stochastic equations with degenerate diffusion coeficient. As an application of the theory, we consider the pricing of American-style contingent claims. Among others, we treat the cases of assets with stochastic volatility and with path-dependent payoffs.
Resumo:
To a finite graph there corresponds a free partially commutative group: with the given graph as commutation graph. In this paper we construct an orthogonality theory for graphs and their corresponding free partially commutative groups. The theory developed here provides tools for the study of the structure of partially commutative groups, their universal theory and automorphism groups. In particular the theory is applied in this paper to the centraliser lattice of such groups.
Resumo:
Let Γ be a finite graph and G be the corresponding free partially commutative group. In this paper we study subgroups generated by vertices of the graph Γ, which we call canonical parabolic subgroups. A natural extension of the definition leads to canonical quasiparabolic subgroups. It is shown that the centralisers of subsets of G are the conjugates of canonical quasiparabolic centralisers satisfying certain graph theoretic conditions.
Resumo:
Counting labelled planar graphs, and typical properties of random labelled planar graphs, have received much attention recently. We start the process here of extending these investigations to graphs embeddable on any fixed surface S. In particular we show that the labelled graphs embeddable on S have the same growth constant as for planar graphs, and the same holds for unlabelled graphs. Also, if we pick a graph uniformly at random from the graphs embeddable on S which have vertex set {1, . . . , n}, then with probability tending to 1 as n → ∞, this random graph either is connected or consists of one giant component together with a few nodes in small planar components.
Resumo:
Documento de trabajo que muestra una aproximación multidisciplinaria de las ciencias sociales al fenómeno del deporte. Es una reflexión sobre la dimensión social del deporte, desde los efectos que este produce en las formas de vida humana: integración, socialización o violencia. Se analiza también el papel del deporte como instrumento de educación.
Resumo:
En aquest treball d’investigació es descriuen els trets principals dels processos de gramaticalització. Alhora, s’ha aplicat alguns dels postulats formulats en el marc de la Teoria de la gramaticalització a la formació d'alguns connectors concessius del castellà medieval: aunque, maguer (que) i comoquier (que). Per a l'anàlisi d'aquests fenòmens s'ha decidit recórrer a la Teoria dels prototips (en termes de Hilferty, 1993) i a la Teoria de la Rellevància (en termes de Blakemore, 2002): creiem que aquestes dues postures casen a la perfecció i ens han permès oferir una visió més global dels fets
Resumo:
Projecte de recerca elaborat a partir d’una estada al Department de Matemàtica Aplicada de la Montanuniversität Leoben, Àustria, entre agost i desembre del 2006. L’ objectiu ha estat fer recerca sobre digrafs infinits amb dos finals, connexos i localment finits, i, en particular, en digrafs amb dos finals i altament arc-transitius. Malnic, Marusic et al. van introduir un nou tipus de relació d’equivalència en els vèrtexs d’un dígraf, anomenades relacions d’assolibilitat, que generalitzen i tenen el seu origen en un problema posat per Cameron et al., on les classes de la relació d’equivalència eren vèrtexs que pertanyien a un camí alternat del dígraf . Malnic et al. en el mencionat article van establir connexions ben estretes entre aquestes relacions d’assolibilitat i l'estructura de finals i creixement dels digrafs localment finits i transitius. En aquest treball, s’ha caracteritzat per complet aquestes relacions d’assolibitat en el cas de dígrafs localment finits i transitius amb exactament dos finals, en termes de la descomposició en números primers del número de línies que genera el digraf amb dos finals. A més, es nega la Conjectura 1 sostinguda per Seifter que afirmava que un digraf connex localment finit amb més d’un final era necessàriament o be 0-, 1- o altament arc-transitiu. Seifer havia donat una solució parcial a la conjectura pel cas de digrafs regulars amb grau primer que tinguin un conjunt de tall connex. En aquest treball, es descriu una família infinita de dígrafs regulars de grau dos, amb dos finals, exactament 2-arc transitius i no 3-arc transitius. Així, es nega la Conjectura de Seifter en el cas general, fins i tot per grau primer. Tot i així, la solució parcial donada per Seifter en el seu article és en cert sentit la millor possible i l'existència un conjunt de tall connex essencial.
Resumo:
We give a series of interesting subgroups of finite index in Aut(Fn). One of them has index 42 in Aut(F3) and infinite abelianization. This implies that Aut(F3) does not have Kazhdan’s property (T) (see [3] and [6] for another proofs). We proved also that every subgroup of finite index in Aut(Fn), n &= 3, which contains the subgroup of IA-automorphisms, has a finite abelianization.