English
Related papers

Related papers: Promotion of Kreweras words

200 papers

We give new interpretations of the $\nu$-Tamari lattice of Pr\'eville-Ratelle and Viennot. First, we describe it as a rotation lattice of $\nu$-trees, which uncovers the relation with known combinatorial objects such as tree-like tableaux…

Combinatorics · Mathematics 2019-10-08 Cesar Ceballos , Arnau Padrol , Camilo Sarmiento

In 1995, the first author introduced a multivariate generating function {$G$} that tracks the distribution of ascents and descents in labeled binary trees. In addition to proving that $G$ is symmetric, he conjectured that $G$ is Schur…

Combinatorics · Mathematics 2019-09-30 Ira M. Gessel , Sean T. Griffin , Vasu Tewari

Kegelspitzen are mathematical structures coined by Keimel and Plotkin, in order to encompass the structure of a convex set and the structure of a dcpo. In this paper, we ask ourselves what are Kegelspitzen the model of. We adopt a…

Logic in Computer Science · Computer Science 2023-06-22 Mathys Rennela

We introduce the concept of an extension of a semilattice of groups $A$ by a group $G$ and describe all the extensions of this type which are equivalent to the crossed products $A*_\Theta G$ by twisted partial actions $\Theta$ of $G$ on…

Group Theory · Mathematics 2017-08-08 Mikhailo Dokuchaev , Mykola Khrypchenko

Feller's book An Introduction to Probability Theory and Its Application discusses statistics corresponding to sequences of coin tosses, with a dollar being won or lost depending on the outcome of each toss. This is equivalent to analyzing…

Combinatorics · Mathematics 2017-12-06 Anthony Zaleski

There is a familiar conjugate for integer partitions: transpose the Ferrers diagram, and a conjugate for integer compositions: transpose a Ferrers-like diagram. Here we propose a conjugate for set partitions and show that it interchanges #…

Combinatorics · Mathematics 2007-05-23 David Callan

Given a finite poset $P$, we study the _whirling_ action on vertex-labelings of $P$ with the elements $\{0,1,2,\dotsc ,k\}$. When such labelings are (weakly) order-reversing, we call them $k$-bounded $P$-partitions. We give a general…

Combinatorics · Mathematics 2025-10-06 Matthew Plante , Tom Roby

Linear extensions of posets are important objects in enumerative and algebraic combinatorics that are difficult to count in general. Families of posets like Young diagrams of straight shapes and $d$-complete posets have hook-length product…

Combinatorics · Mathematics 2021-05-07 GaYee Park

Riemann surfaces with nodes can be described by introducing simple composite operators in matrix models. In the case of the Kontsevich model, it is sufficient to add the quadratic, but ``non-propagating'', term (tr[X])^2 to the Lagrangian.…

High Energy Physics - Theory · Physics 2010-04-06 Damiano Anselmi

We study the graph on reduced words with edges given by the Coxeter relations for the symmetric group. We define a metric on reduced words for a given permutation, analogous to Coxeter length for permutations, for which the graph becomes…

Combinatorics · Mathematics 2020-03-05 Sami Assaf

The word embedding space in neural models is skewed, and correcting this can improve task performance. We point out that most approaches for modeling, correcting, and measuring the symmetry of an embedding space implicitly assume that the…

Computation and Language · Computer Science 2024-11-04 Sho Yokoi , Han Bao , Hiroto Kurita , Hidetoshi Shimodaira

In 1891, Hurwitz introduced the enumeration of genus $g$, degree $d$, branched covers of the Riemann sphere with simple ramification over prescribed points and no branching elsewhere. He showed that for fixed degree $d$, the enumeration…

Combinatorics · Mathematics 2024-09-11 Norman Do , Jian He , Heath Robertson

Bona [2007+] studied the distribution of ascents, plateaux and descents in the class of Stirling permutations, introduced by Gessel and Stanley [1978]. Recently, Janson [2008+] showed the connection between Stirling permutations and plane…

Combinatorics · Mathematics 2008-05-28 Svante Janson , Markus Kuba , Alois Panholzer

Let $\delta=(\delta_1,\ldots,\delta_n)$ be a string of letters $h$ and $v$. We define a Young tableau to be $\delta$-semistandard if the entries are weakly increasing along rows and columns, and the entries $i$ form a horizontal strip if…

Combinatorics · Mathematics 2021-02-04 Tair Akhmejanov , Balázs Elek

Assuming sufficiently many terms of a n-dimensional table defined over a field are given, we aim at guessing the linear recurrence relations with either constant or polynomial coefficients they satisfy. In many applications, the table terms…

Symbolic Computation · Computer Science 2021-11-19 Jérémy Berthomieu , Mohab Safey El Din

In this paper, we explore complex network properties of word collocation networks (Ferret, 2002) from four different genres. Each document of a particular genre was converted into a network of words with word collocations as edges. We…

Social and Information Networks · Computer Science 2014-03-07 Shibamouli Lahiri

Let $A$ be a reciprocal matrix of order $n$ and $w$ be its Perron eigenvector. To infer the efficiency of $w$ for $A$, based on the principle of Pareto optimal decisions, we study the strong connectivity of a certain digraph associated with…

Combinatorics · Mathematics 2025-07-23 Rosário Fernandes

A product system E over a semigroup P is a family of Hilbert spaces {E_s:s\in P} together with multiplications E_s \times E_t\to E_{st}. We view E as a unitary- valued cocycle on P, and consider twisted crossed products A \times_{\beta,E} P…

funct-an · Mathematics 2008-02-03 N. Fowler , I. Raeburn

We consider the infinite one-sided sequence over alphabet $\{a,b\}$ generated by the period-doubling substitution $\sigma(a)=ab$ and $\sigma(b)=aa$, denoted by $\mathbb{D}$. Let $r_p(\omega)$ be the $p$-th return word of factor $\omega$.…

Dynamical Systems · Mathematics 2017-03-22 Yu-Ke Huang , Zhi-Ying Wen

We consider binary rotation words generated by partitions of the unit circle to two intervals and give a precise formula for the number of such words of length n. We also give the precise asymptotics for it, which happens to be O(n^4). The…

Combinatorics · Mathematics 2019-02-20 Anna E. Frid , Damien Jamet
‹ Prev 1 4 5 6 7 8 10 Next ›