scholarly journals Addition and multiplication of beta-expansions in generalized Tribonacci base

2007 ◽  
Vol Vol. 9 no. 2 ◽  
Author(s):  
Petr Ambrož ◽  
Zuzana Masáková ◽  
Edita Pelantová
Keyword(s):  
Real Root ◽  
Fractional Part ◽  
Arithmetic Operations ◽  
Numeration System ◽  
The Real ◽  
Infinite Words ◽  
Combinatorial Properties ◽  
Greedy Expansion ◽  
International Audience ◽  
Numeration Systems

International audience We study properties of β-numeration systems, where β > 1 is the real root of the polynomial x3 - mx2 - x - 1, m ∈ ℕ, m ≥ 1. We consider arithmetic operations on the set of β-integers, i.e., on the set of numbers whose greedy expansion in base β has no fractional part. We show that the number of fractional digits arising under addition of β-integers is at most 5 for m ≥ 3 and 6 for m = 2, whereas under multiplication it is at most 6 for all m ≥ 2. We thus generalize the results known for Tribonacci numeration system, i.e., for m = 1. We summarize the combinatorial properties of infinite words naturally defined by β-integers. We point out the differences between the structure of β-integers in cases m = 1 and m ≥ 2.

scholarly journals What Does Productivity Really Mean? Towards an Integrative Paradigm in the Search for Biodiversity-Productivity Relationships

2013 ◽  
Vol 41 (1) ◽  
pp. 36 ◽  
Author(s):  
Liangjun HU ◽  
Qinfeng GUO
Keyword(s):  
Species Richness ◽  
Species Diversity ◽  
Biomass Production ◽  
Real Root ◽  
Spatial Scaling ◽  
Ecological Processes ◽  
The Real ◽  
Community Or ◽  
Per Se ◽  
Underlying Mechanisms

How species diversity relates to productivity remains a major debate. To date, however, the underlying mechanisms that regulate the ecological processes involved are still poorly understood. Three major issues persist in early efforts at resolution. First, in the context that productivity drives species diversity, how the pathways operate is poorly-explained. Second, productivity  per se varies with community or ecosystem maturity. If diversity indeed drives productivity, the criterion of choosing appropriate measures for productivity is not available. Third, spatial scaling suggests that sampling based on small-plots may not be suitable for formulating species richness-productivity relationships (SRPRs). Thus, the long-standing assumption simply linking diversity with productivity and pursuing a generalizing pattern may not be robust. We argue that productivity, though defined as ‘the rate of biomass production’, has been measured in two ways environmental surrogates and biomass production leading to misinterpretations and difficulty in the pursuit of generalizable SRPRs. To tackle these issues, we developed an integrative theoretical paradigm encompassing richer biological and physical contexts and clearly reconciling the major processes of the systems, using proper productivity measures and sampling units. We conclude that loose interpretation and confounding measures of productivity may be the real root of current SRPR inconsistencies and debate.

scholarly journals Combinatorial properties of smooth infinite words

2006 ◽  
Vol 352 (1-3) ◽  
pp. 306-317 ◽  
Author(s):  
S. Brlek ◽  
S. Dulucq ◽  
A. Ladouceur ◽  
L. Vuillon
Keyword(s):  
Infinite Words ◽  
Combinatorial Properties

scholarly journals RECENT RESULTS ON EXTENSIONS OF STURMIAN WORDS

2002 ◽  
Vol 12 (01n02) ◽  
pp. 371-385 ◽  
Author(s):  
JEAN BERSTEL
Keyword(s):  
Infinite Words ◽  
Combinatorial Properties ◽  
The Past ◽  
Letter Alphabet ◽  
Sturmian Words

Sturmian words are infinite words over a two-letter alphabet that admit a great number of equivalent definitions. Most of them have been given in the past ten years. Among several extensions of Sturmian words to larger alphabets, the Arnoux–Rauzy words appear to share many of the properties of Sturmian words. In this survey, combinatorial properties of these two families are considered and compared.

scholarly journals Defect Effect of Bi-infinite Words in the Two-element Case

2001 ◽  
Vol Vol. 4 no. 2 ◽  
Author(s):  
Ján Maňuch
Keyword(s):  
Sufficient Conditions ◽  
Necessary And Sufficient Conditions ◽  
Finite Alphabet ◽  
Infinite Words ◽  
Infinite Word ◽  
The Family ◽  
International Audience ◽  
Necessary And Sufficient ◽  
Primitive Roots ◽  
Element Set

International audience Let X be a two-element set of words over a finite alphabet. If a bi-infinite word possesses two X-factorizations which are not shiftequivalent, then the primitive roots of the words in X are conjugates. Note, that this is a strict sharpening of a defect theorem for bi-infinite words stated in \emphKMP. Moreover, we prove that there is at most one bi-infinite word possessing two different X-factorizations and give a necessary and sufficient conditions on X for the existence of such a word. Finally, we prove that the family of sets X for which such a word exists is parameterizable.

scholarly journals Lyndon factorization of generalized words of Thue

2002 ◽  
Vol Vol. 5 ◽  
Author(s):  
Anton Černý
Keyword(s):  
Infinite Words ◽  
Infinite Word ◽  
International Audience

International audience The i-th symbol of the well-known infinite word of Thue on the alphabet \ 0,1\ can be characterized as the parity of the number of occurrences of the digit 1 in the binary notation of i. Generalized words of Thue are based on counting the parity of occurrences of an arbitrary word w∈\ 0,1\^+-0^* in the binary notation of i. We provide here the standard Lyndon factorization of some subclasses of this class of infinite words.

scholarly journals On morphisms preserving infinite Lyndon words

2007 ◽  
Vol Vol. 9 no. 2 ◽  
Author(s):  
Gwenael Richomme
Keyword(s):  
Free Monoid ◽  
Infinite Words ◽  
International Audience ◽  
Lyndon Words

International audience In a previous paper, we characterized free monoid morphisms preserving finite Lyndon words. In particular, we proved that such a morphism preserves the order on finite words. Here we study morphisms preserving infinite Lyndon words and morphisms preserving the order on infinite words. We characterize them and show relations with morphisms preserving Lyndon words or the order on finite words. We also briefly study morphisms preserving border-free words and those preserving the radix order.

scholarly journals Boolean complexes and boolean numbers

2010 ◽  
Vol DMTCS Proceedings vol. AN,... (Proceedings) ◽  
Author(s):  
Bridget Eileen Tenner
Keyword(s):  
Coxeter Group ◽  
Bruhat Order ◽  
Graph Invariant ◽  
Coxeter System ◽  
Combinatorial Properties ◽  
Nous Montrons ◽  
International Audience ◽  
Order Ideals ◽  
Simplicial Poset ◽  
The Ideal

International audience The Bruhat order gives a poset structure to any Coxeter group. The ideal of elements in this poset having boolean principal order ideals forms a simplicial poset. This simplicial poset defines the boolean complex for the group. In a Coxeter system of rank n, we show that the boolean complex is homotopy equivalent to a wedge of (n-1)-dimensional spheres. The number of these spheres is the boolean number, which can be computed inductively from the unlabeled Coxeter system, thus defining a graph invariant. For certain families of graphs, the boolean numbers have intriguing combinatorial properties. This work involves joint efforts with Claesson, Kitaev, and Ragnarsson. \par L'ordre de Bruhat munit tout groupe de Coxeter d'une structure de poset. L'idéal composé des éléments de ce poset engendrant des idéaux principaux ordonnés booléens, forme un poset simplicial. Ce poset simplicial définit le complexe booléen pour le groupe. Dans un système de Coxeter de rang n, nous montrons que le complexe booléen est homotopiquement équivalent à un bouquet de sphères de dimension (n-1). Le nombre de ces sphères est le nombre booléen, qui peut être calculé inductivement à partir du système de Coxeter non-étiquetté; définissant ainsi un invariant de graphe. Pour certaines familles de graphes, les nombres booléens satisfont des propriétés combinatoires intriguantes. Ce travail est une collaboration entre Claesson, Kitaev, et Ragnarsson.

scholarly journals A categorification of the chromatic symmetric polynomial

2015 ◽  
Vol DMTCS Proceedings, 27th... (Proceedings) ◽  
Author(s):  
Radmila Sazdanović ◽  
Martha Yip
Keyword(s):  
Symmetric Function ◽  
Symmetric Polynomial ◽  
Chromatic Polynomial ◽  
Khovanov Homology ◽  
Symmetric Polynomials ◽  
Nous Obtenons ◽  
Combinatorial Properties ◽  
International Audience ◽  
Chromatic Symmetric Function ◽  
Frobenius Series

International audience The Stanley chromatic polynomial of a graph $G$ is a symmetric function generalization of the chromatic polynomial, and has interesting combinatorial properties. We apply the ideas of Khovanov homology to construct a homology $H$<sub>*</sub>($G$) of graded $S_n$-modules, whose graded Frobenius series $Frob_G(q,t)$ reduces to the chromatic symmetric function at $q=t=1$. We also obtain analogues of several familiar properties of the chromatic symmetric polynomials in terms of homology. Le polynôme chromatique symétrique d’un graphe $G$ est une généralisation par une fonction symétrique du polynôme chromatique, et possède des propriétés combinatoires intéressantes. Nous appliquons les techniques de l’homologie de Khovanov pour construire une homologie $H$<sub>*</sub>($G$) de modules gradués $S_n$, dont la série bigraduée de Frobeniusse $Frob_G(q,t)$ réduit au polynôme chromatique symétrique à $q=t=1$. Nous obtenons également des analogies pour plusieurs propriétés connues des polynômes chromatiques en termes d’homologie.

scholarly journals Monodromy and K-theory of Schubert curves via generalized jeu de taquin

2020 ◽  
Vol DMTCS Proceedings, 28th... ◽  
Author(s):  
Maria Monks Gillespie ◽  
Jake Levinson
Keyword(s):  
Local Algorithm ◽  
Jeu De Taquin ◽  
Bijective Correspondence ◽  
One Dimensional ◽  
The Real ◽  
Real Locus ◽  
Real Geometry ◽  
International Audience ◽  
K Theory ◽  
Rational Normal Curve

International audience We establish a combinatorial connection between the real geometry and the K-theory of complex Schubert curves Spλ‚q, which are one-dimensional Schubert problems defined with respect to flags osculating the rational normal curve. In a previous paper, the second author showed that the real geometry of these curves is described by the orbits of a map ω on skew tableaux, defined as the commutator of jeu de taquin rectification and promotion. In particular, the real locus of the Schubert curve is naturally a covering space of RP1, with ω as the monodromy operator.We provide a fast, local algorithm for computing ω without rectifying the skew tableau, and show that certain steps in our algorithm are in bijective correspondence with Pechenik and Yong's genomic tableaux, which enumerate the K-theoretic Littlewood-Richardson coefficient associated to the Schubert curve. Using this bijection, we give purely combinatorial proofs of several numerical results involving the K-theory and real geometry of Spλ‚q.

Sign in / Sign up

Export Citation Format

Share Document