Search results for "combinatoric"

showing 10 items of 1776 documents

A generalization of Sardinas and Patterson's algorithm to z-codes

1993

Abstract This paper concerns the framework of z-codes theory. The main contribution consists in an extension of the algorithm of Sardinas and Patterson for deciding whether a finite set of words X is a z-code. To improve the efficiency of this test we have found a tight upper bound on the length of the shortest words that might have a double z-factorization over X. Some remarks on the complexity of the algorithm are also given. Moreover, a slight modification of this algorithm allows us to compute the z-deciphering delay of X.

CombinatoricsSardinas–Patterson algorithmGeneral Computer ScienceGeneralizationCode (cryptography)Extension (predicate logic)Finite setUpper and lower boundsAlgorithmComputer Science(all)Theoretical Computer ScienceMathematicsAutomatonTheoretical Computer Science
researchProduct

Spectral density of the correlation matrix of factor models: a random matrix theory approach.

2005

We studied the eigenvalue spectral density of the correlation matrix of factor models of multivariate time series. By making use of the random matrix theory, we analytically quantified the effect of statistical uncertainty on the spectral density due to the finiteness of the sample. We considered a broad range of models, ranging from one-factor models to hierarchical multifactor models.

CombinatoricsScatter matrixCentering matrixMatrix functionStatistical physicsMultivariate t-distributionNonnegative matrixFinance Commerce correlation matrixRandom matrixSquare matrixData matrix (multivariate statistics)MathematicsPhysical review. E, Statistical, nonlinear, and soft matter physics
researchProduct

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.

CombinatoricsSection (fiber bundle)Mathematics(all)Packing dimensionDimension (vector space)Plane (geometry)General MathematicsHausdorff dimensionMathematical analysisConstant (mathematics)Stability (probability)MathematicsAdvances in Mathematics
researchProduct

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 .

CombinatoricsSequenceAlgebra and Number TheoryTriangular matrixOrder (group theory)Field (mathematics)Algebra over a fieldTupleMathematicsJournal of Algebra
researchProduct

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.

CombinatoricsSequenceApplied MathematicsMathematical analysiscotypeBanach spaceType (model theory)typeConstant (mathematics)Analysisnakano sequence spaceReal numberMathematicsJournal of Mathematical Analysis and Applications
researchProduct

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

CombinatoricsSeries (mathematics)EaringFourier seriesMathematicsJurnal Natural
researchProduct

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...

CombinatoricsSet (abstract data type)Algebra and Number TheoryGroup (mathematics)Complex classSpace (mathematics)MathematicsCommunications in Algebra
researchProduct

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.

CombinatoricsSet (abstract data type)Cayley graphYang–Baxter equationGroup (mathematics)Mathematics::Quantum AlgebraGeneral MathematicsStructure (category theory)Permutation groupMatemàticaQuantumMathematicsMediterranean Journal of Mathematics
researchProduct

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 .

CombinatoricsSet (abstract data type)Class (set theory)Transitive relationAlgebra and Number TheoryGroup (mathematics)MathematicsJournal of Pure and Applied Algebra
researchProduct

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.

CombinatoricsSet (abstract data type)Discrete mathematicsFinite groupAlgebra and Number TheoryConjectureGroup (mathematics)Group orderMathematicsJournal of Pure and Applied Algebra
researchProduct