Search results for "rete"
showing 10 items of 3470 documents
On constructing injective spaces of type C(K)
1998
Abstract In this paper we give a general method to construct averaging operators from which we obtain almost all known methods to obtain injective spaces of type C(K). From this point of view, some known constructions are better understood and they can be easily generalized and simplified, and we also obtain some new examples of injective spaces that have not been considered before.
On the optimal approximation rate of certain stochastic integrals
2010
AbstractGiven an increasing function H:[0,1)→[0,∞) and An(H)≔infτ∈Tn(∑i=1n∫ti−1ti(ti−t)H(t)2dt)12, where Tn≔{τ=(ti)i=0n:0=t0<t1<⋯<tn=1}, we characterize the property An(H)≤cn, and give conditions for An(H)≤cnβ and An(H)≥1cnβ for β∈(0,1), both in terms of integrability properties of H. These results are applied to the approximation of stochastic integrals.
Minimal varieties of algebras of exponential growth
2003
Abstract The exponent of a variety of algebras over a field of characteristic zero has been recently proved to be an integer. Through this scale we can now classify all minimal varieties of given exponent and of finite basic rank. As a consequence, we describe the corresponding T-ideals of the free algebra and we compute the asymptotics of the related codimension sequences, verifying in this setting some known conjectures. We also show that the number of these minimal varieties is finite for any given exponent. We finally point out some relations between the exponent of a variety and the Gelfand–Kirillov dimension of the corresponding relatively free algebras of finite rank.
On Codimension Growth of Finitely Generated Associative Algebras
1998
Abstract LetAbe a PI-algebra over a fieldF. We study the asymptotic behavior of the sequence of codimensionscn(A) ofA. We show that ifAis finitely generated overFthenInv(A)=limn→∞ c n (A) always exists and is an integer. We also obtain the following characterization of simple algebras:Ais finite dimensional central simple overFif and only ifInv(A)=dim=A.
On simple families of functions and their Legendrian mappings
2004
We study germs of $n$-parameter families of functions, that is, function-germs of the type $f : (\mathbb{R}^n \times \mathbb{R}, 0) \to (\mathbb{R}, 0)$ defined on the total space of the trivial bundle $ \mathbb{R}^n \times \mathbb{R} \to \mathbb{R}^n $. There is a natural notion of $V$-equivalence for such function-germs. We introduce the Young diagram of $n$-parameter families satisfying a non-degeneracy condition. We classify all such simple $n$-parameter families and give their versal deformations. This result has direct applications to contact and projective geometry.
Milnor Number Equals Tjurina Number for Functions on Space Curves
2001
The equality of the Milnor number and Tjurina number for functions on space curve singularities, as conjectured recently by V. Goryunov, is proved. As a consequence, the discriminant in such a situation is a free divisor.
The Phagocyte Lattice of Dyck Words
2006
We introduce a new lattice structure on Dyck words. We exhibit efficient algorithms to compute meets and joins of Dyck words.
Every triangle-free induced subgraph of the triangular lattice is(5m,2m)-choosable
2014
A graph G is (a,b)-choosable if for any color list of size a associated with each vertex, one can choose a subset of b colors such that adjacent vertices are colored with disjoint color sets. This paper proves that for any integer m>=1, every finite triangle-free induced subgraph of the triangular lattice is (5m,2m)-choosable.
A Motzkin filter in the Tamari lattice
2015
The Tamari lattice of order n can be defined on the set T n of binary trees endowed with the partial order relation induced by the well-known rotation transformation. In this paper, we restrict our attention to the subset M n of Motzkin trees. This set appears as a filter of the Tamari lattice. We prove that its diameter is 2 n - 5 and that its radius is n - 2 . Enumeration results are given for join and meet irreducible elements, minimal elements and coverings. The set M n endowed with an order relation based on a restricted rotation is then isomorphic to a ranked join-semilattice recently defined in Baril and Pallo (2014). As a consequence, we deduce an upper bound for the rotation distan…
Matchings in three Catalan lattices
2003
In this note we consider a series of lattices that are enumerated by the well-known Catalan numbers. For each of these lattices, we exhibit a matching in a constructive way.