Search results for "Number"
showing 10 items of 3939 documents
Law of the Iterated Logarithm
2020
For sums of independent random variables we already know two limit theorems: the law of large numbers and the central limit theorem. The law of large numbers describes for large \(n\in \mathbb{N}\) the typical behavior, or average value behavior, of sums of n random variables. On the other hand, the central limit theorem quantifies the typical fluctuations about this average value.
PI-algebras with slow codimension growth
2005
Let $c_n(A),\ n=1,2,\ldots,$ be the sequence of codimensions of an algebra $A$ over a field $F$ of characteristic zero. We classify the algebras $A$ (up to PI-equivalence) in case this sequence is bounded by a linear function. We also show that this property is closely related to the following: if $l_n(A), \ n=1,2,\ldots, $ denotes the sequence of colengths of $A$, counting the number of $S_n$-irreducibles appearing in the $n$-th cocharacter of $A$, then $\lim_{n\to \infty} l_n(A)$ exists and is bounded by $2$.
Extremal problems of approximation theory in fuzzy context
1999
Abstract The problem of approximation of a fuzzy subset of a normed space is considered. We study the error of approximation, which in this case is characterized by an L -fuzzy number. In order to do this we define the supremum of an L -fuzzy set of real numbers as well as the supremum and the infimum of a crisp set of L -fuzzy numbers. The introduced concepts allow us to investigate the best approximation and the optimal linear approximation. In particular, we consider approximation of a fuzzy subset in the space L p m of differentiable functions in the L q -metric. We prove the fuzzy counterparts of duality theorems, which in crisp case allows effectively to solve extremal problems of the…
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.
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.
Equivalence classes of permutations modulo descents and left-to-right maxima
2014
Abstract In a recent paper [2], the authors provide enumerating results for equivalence classes of permutations modulo excedances. In this paper we investigate two other equivalence relations based on descents and left-to-right maxima. Enumerating results are presented for permutations, involutions, derangements, cycles and permutations avoiding one pattern of length three.
A unified Pietsch domination theorem
2008
In this paper we prove an abstract version of Pietsch's domination theorem which unify a number of known Pietsch-type domination theorems for classes of mappings that generalize the ideal of absolutely p-summing linear operators. A final result shows that Pietsch-type dominations are totally free from algebraic conditions, such as linearity, multilinearity, etc.
On the structure of the ultradistributions of Beurling type
2008
Let O be a nonempty open set of the k-dimensional euclidean space Rk. In this paper, we give a structure theorem on the ultradistributions of Beurling type in O. Also, other structure results on certain ultradistributions are obtained, in terms of complex Borel measures in O.
P-matrix completions under weak symmetry assumptions
2000
An n-by-n matrix is called a Π-matrix if it is one of (weakly) sign-symmetric, positive, nonnegative P-matrix, (weakly) sign-symmetric, positive, nonnegative P0,1-matrix, or Fischer, or Koteljanskii matrix. In this paper, we are interested in Π-matrix completion problems, that is, when a partial Π-matrix has a Π-matrix completion. Here, we prove that a combinatorially symmetric partial positive P-matrix has a positive P-matrix completion if the graph of its specified entries is an n-cycle. In general, a combinatorially symmetric partial Π-matrix has a Π-matrix completion if the graph of its specified entries is a 1-chordal graph. This condition is also necessary for (weakly) sign-symmetric …