English
Related papers

Related papers: Universal and Overlap Cycles for Posets, Words, an…

200 papers

A number of applications of Steiner triple systems (e.g. disk erasure codes) exist that require a special ordering of its blocks. Universal cycles, introduced by Chung, Diaconis, and Graham in 1992, and Gray codes are examples of listing…

Combinatorics · Mathematics 2013-01-25 Victoria Horan , Glenn Hurlbert

We introduce and study the notion of universally defined cycles of smooth varieties of dimension $d$, and prove that they are given by polynomials in the Chern classes. A similar result is proved for universally defined cycles on products…

Algebraic Geometry · Mathematics 2024-12-16 Claire Voisin

A new ordering, extending the notion of universal cycles of Chung {\em et al.} (1992), is proposed for the blocks of $k$-uniform set systems. Existence of minimum coverings of pairs by triples that possess such an ordering is established…

Combinatorics · Mathematics 2010-08-11 Yeow Meng Chee , San Ling , Yin Tan , Xiande Zhang

A universal cycle for a set S of combinatorial objects is a cyclic sequence of length |S|that contains a representation of each element in S exactly once as a substring. If S is the set of k-subsets of [n] = {1, 2, . . . , n}, it is…

Discrete Mathematics · Computer Science 2026-03-13 Colin Campbell , Luke Janik-Jones , Joe Sawada

In this paper we study unfoldings of saddle-nodes and their Dulac time. By unfolding a saddle-node, saddles and nodes appear. In the first result (Theorem A) we prove uniform regularity by which orbits and their derivatives arrive at a…

Dynamical Systems · Mathematics 2015-03-17 Pavao Mardesić , David Marín , Mariana Saavedra , Jordi Villadelprat

We show that for two quivers without oriented cycles related by a BGP reflection, the posets of their tilting modules are related by a simple combinatorial construction, which we call flip-flop. We deduce that the posets of tilting modules…

Representation Theory · Mathematics 2007-08-10 Sefi Ladkani

Kitaev, Potapov, and Vajnovszki [On shortening u-cycles and u-words for permutations, Discrete Appl. Math, 2019] described how to shorten universal words for permutations, to length $n!+n-1-i(n-1)$ for any $i \in [(n-2)!]$, by introducing…

Combinatorics · Mathematics 2023-08-14 Rachel Kirsch , Bernard Lidický , Clare Sibley , Elizabeth Sprangel

Triangulated categories coming from cyclic posets were originally introduced by the authors in [IT15b] as a generalization of the constructions of various triangulated categories with cluster structures. We give an overview, then analyze…

Representation Theory · Mathematics 2019-03-26 Kiyoshi Igusa , Gordana Todorov

A universal word (u-word) for $d$-dimensional permutations of length $n$ is a 2-dimensional word with $d-1$ rows, any size $n$ window of which is order-isomorphic to exactly one permutation of length $n$, and all permutations of length $n$…

Combinatorics · Mathematics 2026-03-03 Sergey Kitaev , Dun Qiu

The study of linguistic typology is rooted in the implications we find between linguistic features, such as the fact that languages with object-verb word ordering tend to have post-positions. Uncovering such implications typically amounts…

Computation and Language · Computer Science 2019-06-19 Johannes Bjerva , Yova Kementchedjhieva , Ryan Cotterell , Isabelle Augenstein

We explore the enumeration of some natural classes of graded posets, including all graded posets, (2+2)- and (3+1)-avoiding graded posets, (2+2)-avoiding graded posets, and (3+1)-avoiding graded posets. We obtain enumerative and structural…

Combinatorics · Mathematics 2015-08-05 Yan X. Zhang

We show that for two quivers without oriented cycles related by a BGP reflection, the posets of their cluster tilting objects are related by a simple combinatorial construction, which we call a flip-flop. We deduce that the posets of…

Representation Theory · Mathematics 2007-10-16 Sefi Ladkani

Steiner quadruple systems are set systems in which every triple is contained in a unique quadruple. It is will known that Steiner quadruple systems of order v, or SQS(v), exist if and only if v = 2, 4 mod 6. Universal cycles, introduced by…

Combinatorics · Mathematics 2012-04-17 Victoria Horan , Glenn Hurlbert

The notion of clause set cycle abstracts a family of methods for automated inductive theorem proving based on the detection of cyclic dependencies between clause sets. By discerning the underlying logical features of clause set cycles, we…

Logic in Computer Science · Computer Science 2022-08-05 Stefan Hetzl , Jannik Vierling

An exactly solvable family of models describing the wrinkling of substrate-supported inextensible elastic rings under compression is identified. The resulting wrinkle profiles are shown to be related to the buckled states of an unsupported…

Soft Condensed Matter · Physics 2022-08-30 Benjamin Foster , Nicolás Verschueren , Edgar Knobloch , Leonardo Gordillo

A universal cycle for permutations of length $n$ is a cyclic word or permutation, any factor of which is order-isomorphic to exactly one permutation of length $n$, and containing all permutations of length $n$ as factors. It is well known…

Combinatorics · Mathematics 2018-07-24 Alice L. L. Gao , Sergey Kitaev , Wolfgang Steiner , Philip B. Zhang

Interval-closed sets of a poset are a natural superset of order ideals. We initiate the study of interval-closed sets of finite posets from enumerative and dynamical perspectives. In particular, we use the generalized toggle group to define…

Combinatorics · Mathematics 2023-09-22 Jennifer Elder , Nadia Lafrenière , Erin McNicholas , Jessica Striker , Amanda Welch

This work regards the order polytopes arising from the class of generalized snake posets and their posets of meet-irreducible elements. Among generalized snake posets of the same rank, we characterize those whose order polytopes have…

We prove a result of cohomology and base change for families of coherent systems over a curve. We use that in order to prove the existence of (non-split, non-degenerate) universal families of extensions for families of coherent systems (in…

Algebraic Geometry · Mathematics 2012-12-04 Matteo Tommasini

We enumerate total cyclic orders on $\left\{1,\ldots,n\right\}$ where we prescribe the relative cyclic order of consecutive triples $(i,{i+1},{i+2})$, these integers being taken modulo $n$. In some cases, the problem reduces to the…

Combinatorics · Mathematics 2020-07-10 Sanjay Ramassamy