Search results for "Combinatorics"
showing 10 items of 1770 documents
Local dimensions of sliced measures and stability of packing dimensions of sections of sets
2004
Abstract Let m and n be integers with 0 R n to certain properties of plane sections of μ. This leads us to prove, among other things, that the lower local dimension of (n−m)-plane sections of μ is typically constant provided that the Hausdorff dimension of μ is greater than m. The analogous result holds for the upper local dimension if μ has finite t-energy for some t>m. We also give a sufficient condition for stability of packing dimensions of section of sets.
Y-proper graded cocharacters of upper triangular matrices of order m graded by the m-tuple ϕ=(0,0,1,…,m−2)
2015
Abstract Let F be a field of characteristic 0. We consider the algebra UT m ( F ) of upper triangular matrices of order m endowed with an elementary Z m -grading induced by the m-tuple ϕ = ( 0 , 0 , 1 , … , m − 2 ) , then we compute its Y-proper graded cocharacter sequence and we give the explicit formulas for the multiplicities in the case m = 2 , 3 , 4 , 5 .
Type and Cotype in Vector-Valued Nakano Sequence Spaces
2001
AbstractGiven a sequence of Banach spaces {Xn}n and a sequence of real numbers {pn}n in [1,∞), the vector-valued Nakano sequence spaces ℓ({pn},{Xn}) consist of elements {xn}n in ∏nXn for which there is a constant λ>0 such that ∑n(‖xn‖/λ)pn<∞. In this paper we find the conditions on the Banach spaces Xn and on the sequence {pn}n for the spaces ℓ({pn},{Xn}) to have cotype q or type p.
PENERAPAN DERET FOURIER PADA SISTEM PENDENGARAN MANUSIA
2008
Natural vane voices comes to the humaneary on the Forier Series P(t), while the human earing system only accepts the wore of voices on the Fourier Series berhingga Q (t). The different between Fories Series P(t) and Q(l) can be eliminase using. Approximation Quadrate Smallest Method.. Therefore q(t) is a result of natural vane approach
CHARACTERS INDUCED FROM FULLY RAMIFIED SUBGROUPS
2001
Suppose that G is a finite π-separable group, let cf(G) be the space of complex class functions of G and let Irr(G) be the set of the irreducible complex characters of G. Let K be an arbitrary Hall...
The Structure Group and the Permutation Group of a Set-Theoretic Solution of the Quantum Yang–Baxter Equation
2021
We describe the left brace structure of the structure group and the permutation group associated to an involutive, non-degenerate set-theoretic solution of the quantum YangBaxter equation by using the Cayley graph of its permutation group with respect to its natural generating system. We use our descriptions of the additions in both braces to obtain new properties of the structure and the permutation groups and to recover some known properties of these groups in a more transparent way.
On periodic radical groups in which permutability is a transitive relation
2007
Abstract A group G is said to be a PT - group if permutability is a transitive relation in the set of all subgroups of G . Our purpose in this paper is to study PT -groups in the class of periodic radical groups satisfying min- p for all primes p .
On the Navarro–Willems conjecture for blocks of finite groups
2007
Abstract We prove that a set of characters of a finite group can only be the set of characters for principal blocks of the group at two different primes when the primes do not divide the group order. This confirms a conjecture of Navarro and Willems in the case of principal blocks.
A Criterion for Attaining the Welch Bounds with Applications for Mutually Unbiased Bases
2008
The paper gives a short introduction to mutually unbiased bases and the Welch bounds and demonstrates that the latter is a good technical tool to explore the former. In particular, a criterion for a system of vectors to satisfy the Welch bounds with equality is given and applied for the case of MUBs. This yields a necessary and sufficient condition on a set of orthonormal bases to form a complete system of MUBs. This condition takes an especially elegant form in the case of homogeneous systems of MUBs. We express some known constructions of MUBs in this form. Also it is shown how recently obtained results binding MUBs and some combinatorial structures (such as perfect nonlinear functions an…
Forbidden Factors and Fragment Assembly
2001
In this paper methods and results related to the notion of minimal forbidden words are applied to the fragment assembly problem. The fragment assembly problem can be formulated, in its simplest form, as follows: reconstruct a word w from a given set I of substrings (fragments ) of a word w . We introduce an hypothesis involving the set of fragments I and the maximal length m(w) of the minimal forbidden factors of w . Such hypothesis allows us to reconstruct uniquely the word w from the set I in linear time. We prove also that, if w is a word randomly generated by a memoryless source with identical symbol probabilities, m(w) is logarithmic with respect to the size of w . This result shows th…