Search results for "combinatoric"

showing 10 items of 1776 documents

Languages with mismatches

2007

AbstractIn this paper we study some combinatorial properties of a class of languages that represent sets of words occurring in a text S up to some errors. More precisely, we consider sets of words that occur in a text S with k mismatches in any window of size r. The study of this class of languages mainly focuses both on a parameter, called repetition index, and on the set of the minimal forbidden words of the language of factors of S with errors. The repetition index of a string S is defined as the smallest integer such that all strings of this length occur at most in a unique position of the text S up to errors. We prove that there is a strong relation between the repetition index of S an…

Combinatorics on wordsApproximate string matchingGeneral Computer ScienceRepetition (rhetorical device)String (computer science)Search engine indexingComputer Science::Computation and Language (Computational Linguistics and Natural Language and Speech Processing)Approximate string matchingData structureTheoretical Computer ScienceCombinatoricsSet (abstract data type)Formal languagesCombinatorics on words Formal languages Approximate string matching IndexingIndexingWord (group theory)MathematicsInteger (computer science)Computer Science(all)Theoretical Computer Science
researchProduct

Burrows-Wheeler transform and palindromic richness

2009

AbstractThe investigation of the extremal case of the Burrows–Wheeler transform leads to study the words w over an ordered alphabet A={a1,a2,…,ak}, with a1<a2<⋯<ak, such that bwt(w) is of the form aknkak−1nk−1⋯a2n2a1n1, for some non-negative integers n1,n2,…,nk. A characterization of these words in the case |A|=2 has been given in [Sabrina Mantaci, Antonio Restivo, Marinella Sciortino, Burrows-Wheeler transform and Sturmian words, Information Processing Letters 86 (2003) 241–246], where it is proved that they correspond to the powers of conjugates of standard words. The case |A|=3 has been settled in [Jamie Simpson, Simon J. Puglisi, Words with simple Burrows-Wheeler transforms, Electronic …

Combinatorics on wordsGeneral Computer ScienceBurrows–Wheeler transformSettore INF/01 - InformaticaRich wordsPalindromeBurrows-Wheeler transformTheoretical Computer ScienceCombinatoricsRich wordBurrows-Wheeler transform; Palindromes; Rich words; Combinatorics on wordsPalindromePalindromesSpecies richnessAlphabetArithmeticBurrows–Wheeler transformComputer Science(all)MathematicsCombinatorics on word
researchProduct

The Bohr Radius of a Banach Space

2009

Following the scalar-valued case considered by Djakow and Ramanujan (A remark on Bohr’s theorem and its generalizations 14:175–178, 2000) we introduce, for each complex Banach space X and each \(1\le p0\). We study the p-Bohr radius of the Lebesgue spaces \(L^q(\mu )\) for different values of p and q. In particular we show that \(r_p(L^q(\mu ))=0\) whenever \(p<2\) and \(dim(L^q(\mu ))\ge 2\) and \(r_p(L^q(\mu ))=1\) whenever \(p\ge 2\) and \(p'\le q\le p\). We also provide some lower estimates for \(r_2(L^q(\mu ))\) for the values \(1\le q<2\).

Combinatorics010102 general mathematicsMathematical analysisBanach space010103 numerical & computational mathematics0101 mathematicsAlgebra over a fieldLp space01 natural sciencesBohr radiusMathematics
researchProduct

Forests and pattern-avoiding permutations modulo pure descents

2018

Abstract We investigate an equivalence relation on permutations based on the pure descent statistic. Generating functions are given for the number of equivalence classes for the set of all permutations, and the sets of permutations avoiding exactly one pattern of length three. As a byproduct, we exhibit a permutation set in one-to-one correspondence with forests of ordered binary trees, which provides a new combinatorial class enumerated by the single-source directed animals on the square lattice. Furthermore, bivariate generating functions for these sets are given according to various statistics.

Combinatorics010201 computation theory & mathematicsModulo010102 general mathematics[MATH.MATH-CO]Mathematics [math]/Combinatorics [math.CO]0102 computer and information sciences0101 mathematics[INFO.INFO-DM]Computer Science [cs]/Discrete Mathematics [cs.DM]01 natural sciencesComputingMilieux_MISCELLANEOUSMathematics
researchProduct

Quantum Walks on Two-Dimensional Grids with Multiple Marked Locations

2016

The running time of a quantum walk search algorithm depends on both the structure of the search space graph and the configuration of marked locations. While the first dependence has been studied in a number of papers, the second dependence remains mostly unstudied. We study search by quantum walks on the two-dimensional grid using the algorithm of Ambainis, Kempe and Rivosh [AKR05]. The original paper analyses one and two marked locations only. We move beyond two marked locations and study the behaviour of the algorithm for an arbitrary configuration of marked locations. In this paper, we prove two results showing the importance of how the marked locations are arranged. First, we present tw…

Combinatorics010308 nuclear & particles physicsSearch algorithm0103 physical sciencesQuantum walk010306 general physicsGrid01 natural sciencesGraphMathematicsRunning time
researchProduct

Taille critique et stratégie du distributeur - Analyse théorique et implications managériales

1998

International audience; La notion de taille critique a été généralement invoquée par les distributeurs pour justifier les opérations de croissance externe qui demeurent unepratique stratégique importante dans ce secteur. Cet article propose une revue des arguments qui supportent et contredisent l’existence d’une taillecritique pouvant guider les décisions stratégiques des distributeurs, et envisage les implications managériales de la remise en cause de cette notion.

Combinatorics0502 economics and business05 social sciences[SHS.GESTION]Humanities and Social Sciences/Business administration050211 marketingGeneral MedicineHumanities050203 business & managementMathematics[SHS]Humanities and Social Sciences
researchProduct

La relation client sur Internet : les banques mettent leurs clients au travail

2009

Le client, sur Internet, est amene a prendre une place de plus en plus importante dans le processus de servuction. A ce titre, il devient coproducteur et remplace meme, dans de nombreux cas, les salaries des entreprises. Le secteur bancaire a largement participe a cette externalisation de certains services vers ses clients. Nous etudierons ce phenomene et ses consequences pour la gestion de la relation client.

Combinatorics0502 economics and business05 social sciences[SHS.GESTION]Humanities and Social Sciences/Business administration050211 marketingGeneral Medicine[SHS.GESTION] Humanities and Social Sciences/Business administration[ SHS.GESTION ] Humanities and Social Sciences/Business administrationHumanities050203 business & managementComputingMilieux_MISCELLANEOUSMathematics
researchProduct

Commuting powers and exterior degree of finite groups

2011

In [P. Niroomand, R. Rezaei, On the exterior degree of finite groups, Comm. Algebra 39 (2011), 335-343] it is introduced a group invariant, related to the number of elements $x$ and $y$ of a finite group $G$, such that $x \wedge y = 1_{G \wedge G}$ in the exterior square $G \wedge G$ of $G$. This number gives restrictions on the Schur multiplier of $G$ and, consequently, large classes of groups can be described. In the present paper we generalize the previous investigations on the topic, focusing on the number of elements of the form $h^m \wedge k$ of $H \wedge K$ such that $h^m \wedge k = 1_{H \wedge K}$, where $m \ge 1$ and $H$ and $K$ are arbitrary subgroups of $G$.

Combinatorics20J99 20D15 20D60 20C25General MathematicsMathematics - K-Theory and HomologyFOS: MathematicsHomological algebraK-Theory and Homology (math.KT)Invariant (mathematics)Exterior algebraMathematicsSchur multiplier
researchProduct

Tangential Hilbert problem for perturbations of hyperelliptic Hamiltonian systems

1999

The tangential Hilbert 16th problem is to place an upper bound for the number of isolated ovals of algebraic level curves { H ( x , y ) = const } \{H(x,y)=\operatorname {const}\} over which the integral of a polynomial 1-form P ( x , y ) d x + Q ( x , y ) d y P(x,y)\,dx+Q(x,y)\,dy (the Abelian integral) may vanish, the answer to be given in terms of the degrees n = deg ⁡ H n=\deg H and d = max ( deg ⁡ P , deg ⁡ Q ) d=\max (\deg P,\deg Q) . We describe an algorithm producing this upper bound in the form of a primitive recursive (in fact, elementary) function of n n and d d for the particular case of hyperelliptic polynomials H ( x , y ) = y 2 + U ( x ) H(x,y)=y^2+U(x) under the additional as…

CombinatoricsAbelian integralPolynomialGeneral MathematicsLimit cycleSuperintegrable Hamiltonian systemAlgebraic curveAbelian groupAlgebraic numberMathematicsHamiltonian systemElectronic Research Announcements of the American Mathematical Society
researchProduct

General Set-Up

2017

CombinatoricsAdditive categorySet (abstract data type)Abelian categoryMathematics
researchProduct