scholarly journals Counting descents, rises, and levels, with prescribed first element, in words

2008 ◽  
Vol Vol. 10 no. 3 (Combinatorics) ◽  
Author(s):  
Sergey Kitaev ◽  
Toufik Mansour ◽  
Jeff Remmel
Keyword(s):  
Set Partition ◽  
Natural Numbers ◽  
International Audience ◽  
Permutation Statistic

Combinatorics International audience Recently, Kitaev and Remmel refined the well-known permutation statistic "descent" by fixing parity of one of the descent's numbers which was extended and generalized in several ways in the literature. In this paper, we shall fix a set partition of the natural numbers N,(N1, ..., Ns), and we study the distribution of descents, levels, and rises according to whether the first letter of the descent, rise, or level lies in Ni over the set of words over the alphabet [k] = 1, ..., k. In particular, we refine and generalize some of the results by Burstein and Mansour

scholarly journals On congruences for certain sums of E. Lehmer's type

2014 ◽  
Vol Volume 38 ◽  
Author(s):  
Shigeru Kanemitsu ◽  
Takako Kuzumaki ◽  
Jerzy Urbanowicz
Keyword(s):  
Natural Number ◽  
Natural Numbers ◽  
Principal Character ◽  
International Audience

International audience Let n > 1 be an odd natural number and let r (1 < r < n) be a natural number relatively prime to n. Denote by χn the principal character modulo n. In Section 3 we prove some new congruences for the sums T r,k (n) = n r ] i=1 (χn(i) i k) (mod n s+1) for s ∈ {0, 1, 2}, for all divisors r of 24 and for some natural numbers k.We obtain 82 new congruences for T r,k (n), which generalize those obtained in [Ler05], [Leh38] and [Sun08] if n = p is an odd prime. Section 4 is an appendix by the second and third named authors. It contains some new congruences for the sums Ur(n) = n

scholarly journals Right-cancellability of a family of operations on binary trees

1998 ◽  
Vol Vol. 2 ◽  
Author(s):  
Philippe Duchon
Keyword(s):  
Binary Trees ◽  
Natural Numbers ◽  
The Family ◽  
International Audience

International audience We prove some new results on a family of operations on binary trees, some of which are similar to addition, multiplication and exponentiation for natural numbers. The main result is that each operation in the family is right-cancellable.

scholarly journals The unreasonable ubiquitousness of quasi-polynomials

2013 ◽  
Vol DMTCS Proceedings vol. AS,... (Proceedings) ◽  
Author(s):  
Kevin Woods
Keyword(s):  
General Class ◽  
Linear Inequalities ◽  
Boolean Operations ◽  
Natural Numbers ◽  
Ehrhart Theory ◽  
Presburger Arithmetic ◽  
Polynomial Structure ◽  
Special Cases ◽  
International Audience

International audience A function $g$, with domain the natural numbers, is a quasi-polynomial if there exists a period $m$ and polynomials $p_0,p_1,\ldots,p_m-1$ such that $g(t)=p_i(t)$ for $t\equiv i\bmod m$. Quasi-polynomials classically – and ``reasonably'' – appear in Ehrhart theory and in other contexts where one examines a family of polyhedra, parametrized by a variable t, and defined by linear inequalities of the form $a_1x_1+⋯+a_dx_d≤ b(t)$. Recent results of Chen, Li, Sam; Calegari, Walker; and Roune, Woods show a quasi-polynomial structure in several problems where the $a_i$ are also allowed to vary with $t$. We discuss these ``unreasonable'' results and conjecture a general class of sets that exhibit various (eventual) quasi-polynomial behaviors: sets $S_t$ that are defined with quantifiers $(\forall , ∃)$, boolean operations (and, or, not), and statements of the form $a_1(t)x_1+⋯+a_d(t)x_d ≤ b(t)$, where $a_i(t)$ and $b(t)$ are polynomials in $t$. These sets are a generalization of sets defined in the Presburger arithmetic. We prove several relationships between our conjectures, and we prove several special cases of the conjectures.

scholarly journals The Shi arrangement and the Ish arrangement

2011 ◽  
Vol DMTCS Proceedings vol. AO,... (Proceedings) ◽  
Author(s):  
Drew Armstrong ◽  
Brendon Rhoades
Keyword(s):  
Degrees Of Freedom ◽  
Type A ◽  
Grand Nombre ◽  
Set Partition ◽  
Affine Weyl Group ◽  
Nous Montrons ◽  
International Audience ◽  
New Interpretation ◽  
Arrangements Of Hyperplanes ◽  
Shi Arrangement

International audience This paper is about two arrangements of hyperplanes. The first — the Shi arrangement — was introduced by Jian-Yi Shi to describe the Kazhdan-Lusztig cells in the affine Weyl group of type A. The second — the Ish arrangement — was recently defined by the first author who used the two arrangements together to give a new interpretation of the q,t-Catalan numbers of Garsia and Haiman. In the present paper we will define a mysterious "combinatorial symmetry'' between the two arrangements and show that this symmetry preserves a great deal of information. For example, the Shi and Ish arrangements share the same characteristic polynomial, the same numbers of regions, bounded regions, dominant regions, regions with c "ceilings'' and d "degrees of freedom'', etc. Moreover, all of these results hold in the greater generality of "deleted'' Shi and Ish arrangements corresponding to an arbitrary subgraph of the complete graph. Our proofs are based on nice combinatorial labellings of Shi and Ish regions and a new set partition-valued statistic on these regions. Cet article traite de deux arrangements d'hyperplans. Le premier — arrangement Shi — a été introduit par Jian-Yi Shi pour décrire les cellules de Kazhdan-Lusztig du groupe de Weyl affine de type A. Le deuxième — arrangement Ish — a été récemment défini par le premier auteur pour donner une nouvelle interprétation des nombres q,t-Catalan de Garsia et Haiman. Ici nous définissons une mystérieuse "symétrie combinatoire" entre les deux arrangements et nous montrons que cette symétrie conserve un grand nombre d'informations. Par exemple, les arrangements Shi et Ish ont le même polynôme caractéristique, le même nombre de régions, de régions bornées, de régions dominantes, de régions avec c "plafonds'' et d "degrés de liberté'', etc. En outre, ces résultats se généralisent aux arrangements Shi et Ish "deleted'' correspondant à un sous-graphe arbitraire du graphe complet. Nos preuves reposent sur des étiquetages combinatoires des régions Shi et Ish, et sur une nouvelle statistique associée.

scholarly journals Record statistics in integer compositions

2009 ◽  
Vol DMTCS Proceedings vol. AK,... (Proceedings) ◽  
Author(s):  
Arnold Knopfmacher ◽  
Toufik Mansour
Keyword(s):  
Generating Functions ◽  
Natural Numbers ◽  
Mean Values ◽  
Fixed Subset ◽  
Record Statistics ◽  
Weak Records ◽  
International Audience ◽  
Positive Integers

International audience A $\textit{composition}$ $\sigma =a_1 a_2 \ldots a_m$ of $n$ is an ordered collection of positive integers whose sum is $n$. An element $a_i$ in $\sigma$ is a strong (weak) $\textit{record}$ if $a_i> a_j (a_i \geq a_j)$ for all $j=1,2,\ldots,i-1$. Furthermore, the position of this record is $i$. We derive generating functions for the total number of strong (weak) records in all compositions of $n$, as well as for the sum of the positions of the records in all compositions of $n$, where the parts $a_i$ belong to a fixed subset $A$ of the natural numbers. In particular when $A=\mathbb{N}$, we find the asymptotic mean values for the number, and for the sum of positions, of records in compositions of $n$.

scholarly journals How often do we reject a superior value? (Extended abstract)

2011 ◽  
Vol DMTCS Proceedings vol. AO,... (Proceedings) ◽  
Author(s):  
Kamilla Oliver ◽  
Helmut Prodinger
Keyword(s):  
Geometric Distribution ◽  
Natural Numbers ◽  
List Structure ◽  
Skip List ◽  
International Audience

International audience Words $a_1 a_2 \ldots a_n$ with independent letters $a_k$ taken from the set of natural numbers, and a weight (probability) attached via the geometric distribution $pq^{i-1}(p+q=1)$ are considered. A consecutive record (motivated by the analysis of a skip list structure) can only advance from $k$ to $k+1$, thus ignoring perhaps some larger (=superior) values. We investigate the number of these rejected superior values. Further, we study the probability that there is a single consecutive maximum and show that (apart from fluctuations) it tends to a constant. On considère des mots $a_1a_2 \ldots a_n$ formés de lettres à valeurs entières, tirées de façon indépendante avec une distribution géométrique $pq^{i-1}(p+q=1)$. Un record $k+1$ est dit consécutif si la lettre précédente est $k$. La notion est motivée par des considérations algorithmiques. Les autres records sont rejetés. Nous étudions le nombre de records rejetés. Nous étudions aussi la probabilité qu'il y ait un seul maximum consécutif, et montrons qu'elle converge vers une constante, à certaines fluctuations près.

scholarly journals On the Frobenius’ Problem of three numbers

2005 ◽  
Vol DMTCS Proceedings vol. AE,... (Proceedings) ◽  
Author(s):  
Francesc Aguiló ◽  
Alícia Miralles
Keyword(s):  
Upper Bound ◽  
Frobenius Number ◽  
Explicit Computation ◽  
Natural Numbers ◽  
Frobenius Problem ◽  
Geometrical Proof ◽  
International Audience ◽  
Alpha Beta

International audience Given $k$ natural numbers $\{a_1, \ldots ,a_k\} \subset \mathbb{N}$ with $1 \leq a_1 < a_2 < \ldots < a_k$ and $\mathrm{gcd} (a_1, \ldots ,a_k)=1$, let be $R(a_1, \ldots ,a_k) = \{ \lambda_1 a_1+ \cdots + \lambda_k a_k | \space \lambda_i \in \mathbb{N}, i=1 \div k\}$ and $\overline{R}(a_1, \ldots ,a_k) = \mathbb{N} \backslash R (a_1, \ldots ,a_k)$. It is easy to see that $| \overline{R}(a_1, \ldots ,a_k)| < \infty$. The $\textit{Frobenius Problem}$ related to the set $\{a_1, \ldots ,a_k\}$ consists on the computation of $f(a_1, \ldots ,a_k)=\max \overline{R} (a_1, \ldots ,a_k)$, also called the $\textit{Frobenius number}$, and the cardinal $| \overline{R}(a_1, \ldots ,a_k)|$. The solution of the Frobenius Problem is the explicit computation of the set $\overline{R} (a_1,\ldots ,a_k)$. In some cases it is known a sharp upper bound for the Frobenius number. When $k=3$ this bound is known to be $$F(N)=\max\limits_{\substack{0 \lt a \lt b \lt N \\ \mathrm{gcd}(a,b,N)=1}} f(a,b,N)= \begin{cases} 2(\lfloor N/2 \rfloor -1)^2-1 & \textrm{if } N \equiv 0 (\mod 2),\\ 2 \lfloor N/2 \rfloor (\lfloor N/2 \rfloor -1) -1 & \textrm{if } N \equiv 1 (\mod 2).\\ \end{cases}$$ This bound is given in [Dixmier1990]. In this work we give a geometrical proof of this bound which allows us to give the solution of the Frobenius problem for all the sets $\{\alpha ,\beta ,N\}$ such that $f(\alpha ,\beta ,N)=F(N)$.

scholarly journals McKay Centralizer Algebras

2020 ◽  
Vol DMTCS Proceedings, 28th... ◽  
Author(s):  
Georgia Benkart ◽  
Tom Halverson
Keyword(s):  
Representation Theory ◽  
Tensor Product ◽  
Dynkin Diagram ◽  
Finite Subgroup ◽  
Set Partition ◽  
Centralizer Algebras ◽  
Partition Algebras ◽  
International Audience ◽  
Centralizer Algebra ◽  
Corre Spondence

International audience For a finite subgroup G of the special unitary group SU2, we study the centralizer algebra Zk(G) = EndG(V⊗k) of G acting on the k-fold tensor product of its defining representation V = C2. The McKay corre- spondence relates the representation theory of these groups to an associated affine Dynkin diagram, and we use this connection to study the structure and representation theory of Zk(G) via the combinatorics of the Dynkin diagram. When G equals the binary tetrahedral, octahedral, or icosahedral group, we exhibit remarkable connections between Zk (G) and the Martin-Jones set partition algebras.

scholarly journals Crossings and nestings in set partitions of classical types

2010 ◽  
Vol DMTCS Proceedings vol. AN,... (Proceedings) ◽  
Author(s):  
Martin Rubey ◽  
Christian Stump
Keyword(s):  
Nous Avons ◽  
Type A ◽  
The Other ◽  
Type B ◽  
Set Partition ◽  
Set Partitions ◽  
Type D ◽  
Nous Montrons ◽  
International Audience ◽  
The One

International audience In this extended abstract, we investigate bijections on various classes of set partitions of classical types that preserve openers and closers. On the one hand we present bijections for types $B$ and $C$ that interchange crossings and nestings, which generalize a construction by Kasraoui and Zeng for type $A$. On the other hand we generalize a bijection to type $B$ and $C$ that interchanges the cardinality of a maximal crossing with the cardinality of a maximal nesting, as given by Chen, Deng, Du, Stanley and Yan for type $A$. For type $D$, we were only able to construct a bijection between non-crossing and non-nesting set partitions. For all classical types we show that the set of openers and the set of closers determine a non-crossing or non-nesting set partition essentially uniquely. Dans ce résumé, nous étudions des bijections entre diverses classes de partitions d'ensemble de types classiques qui préservent les "openers'' et les "closers''. D'une part, nous présentons des bijections pour les types $B$ et $C$ qui échangent croisées et emboôtées, qui généralisent une construction de Kasraoui et Zeng pour le type $A$. D'autre part, nous généralisons une bijection pour le type $B$ et $C$ qui échange la cardinalité d'un croisement maximal avec la cardinalité d'un emboîtement maximal comme il a été fait par Chen, Deng, Du, Stanley et Yan pour le type $A$. Pour le type $D$, nous avons seulement construit une bijection entre les partitions non croisées et non emboîtées. Pour tout les types classiques, nous montrons que l'ensemble des "openers'' et l'ensemble des "closers'' déterminent une partition non croisées ou non emboîtées essentiellement de façon unique.

scholarly journals On generalised Carmichael numbers.

1999 ◽  
Vol Volume 22 ◽  
Author(s):  
L Halbeisen ◽  
N Hungerbühler
Keyword(s):  
Natural Numbers ◽  
Carmichael Numbers ◽  
Special Cases ◽  
Prime Factors ◽  
International Audience

International audience For arbitrary integers $k\in\mathbb Z$, we investigate the set $C_k$ of the generalised Carmichael number, i.e. the natural numbers $n< \max\{1, 1-k\}$ such that the equation $a^{n+k}\equiv a \mod n$ holds for all $a\in\mathbb N$. We give a characterization of these generalised Carmichael numbers and discuss several special cases. In particular, we prove that $C_1$ is infinite and that $C_k$ is infinite, whenever $1-k>1$ is square-free. We also discuss generalised Carmichael numbers which have one or two prime factors. Finally, we consider the Jeans numbers, i.e. the set of odd numbers $n$ which satisfy the equation $a^n\equiv a \mod n$ only for $a=2$, and the corresponding generalizations. We give a stochastic argument which supports the conjecture that infinitely many Jeans numbers exist which are squares.

Sign in / Sign up

Export Citation Format

Share Document