Staircase patterns in words: subsequences, subwords, and separation number [0.03%]
单词中的楼梯模式：子序列、子词和分离号
Toufik Mansour,Reza Rastegar,Alexander Roitershtein
Toufik Mansour
We revisit staircases for words and prove several exact as well as asymptotic results for longest left-most staircase subsequences and subwords and staircase separation number. The latter is defined as the number of consecutive maximal stai...
Yvonne Kemper,Jim Lawrence
Yvonne Kemper
In this paper we consider the question of the existence of Hamiltonian circuits in the tope graphs of central arrangements of hyperplanes. Some of the results describe connections between the existence of Hamiltonian circuits in the arrange...
Variances and covariances in the Central Limit Theorem for the output of a transducer [0.03%]
变换器输出的中心极限定理中的方差和协方差
Clemens Heuberger,Sara Kropf,Stephan Wagner
Clemens Heuberger
We study the joint distribution of the input sum and the output sum of a deterministic transducer. Here, the input of this finite-state machine is a uniformly distributed random sequence. We give a simple combinatorial characterization of t...
Products of two atoms in Krull monoids and arithmetical characterizations of class groups [0.03%]
Krull 幺半群中两个原子的乘积及类群的算术刻画
Paul Baginski,Alfred Geroldinger,David J Grynkiewicz et al.
Paul Baginski et al.
Let [Formula: see text] be a Krull monoid with finite class group [Formula: see text] such that every class contains a prime divisor and let [Formula: see text] be the Davenport constant of [Formula: see text]. Then a product of two atoms o...
Michael Drmota
Michael Drmota
Embedded trees are labelled rooted trees, where the root has zero label and where the labels of adjacent vertices differ (at most) by [Formula: see text]. Recently it has been proved (see Chassaing and Schaeffer (2004) [8] and Janson and Ma...
Tullio Ceccherini-Silberstein,Wolfgang Woess
Tullio Ceccherini-Silberstein
Let [Formula: see text] be a finitely generated group, [Formula: see text] a finite set of generators and [Formula: see text] a subgroup of [Formula: see text]. We define what it means for [Formula: see text] to be a context-free pair; when...
David J Grynkiewicz
David J Grynkiewicz
An old conjecture of Graham stated that if [Formula: see text] is a prime and [Formula: see text] is a sequence of [Formula: see text] terms from the cyclic group [Formula: see text] such that all (nontrivial) zero-sum subsequences have the...
Unfair permutations [0.03%]
不公排列
Helmut Prodinger,Carsten Schneider,Stephan Wagner
Helmut Prodinger
We study unfair permutations, which are generated by letting [Formula: see text] players draw numbers and assuming that player [Formula: see text] draws [Formula: see text] times from the unit interval and records her largest value. This mo...
The poset of bipartitions [0.03%]
双边分的偏序集
Gábor Hetyei,Christian Krattenthaler
Gábor Hetyei
Bipartitional relations were introduced by Foata and Zeilberger in their characterization of relations which give rise to equidistribution of the associated inversion statistic and major index. We consider the natural partial order on bipar...