English
Related papers

Related papers: Bubble Lattices I: Structure

200 papers

The shuffle lattice was introduced by Greene in 1988 as an idealized model for DNA mutation, when he revealed remarkable combinatorial properties of this structure. In this paper, we prove an explicit formula for the $M$-triangle of the…

Combinatorics · Mathematics 2024-09-26 Annabel Ma

In his study of a Hochschild complex arising in connection with the free loop fibration, S. Saneblidze defined the freehedron, a certain polytope constructed via a truncation process from the hypercube. It was recently conjectured by F.…

Combinatorics · Mathematics 2023-02-07 Henri Mühle

We study random bubble lattices which can be produced by processes such as first order phase transitions, and derive characteristics that are important for understanding the percolation of distinct varieties of bubbles. The results are…

High Energy Physics - Phenomenology · Physics 2009-10-31 Andrew de Laix , Tanmay Vachaspati

We introduce two simplicial complexes, the noncrossing matching complex and the noncrossing bipartite complex. Both complexes are intimately related to the bubble lattice introduced in our earlier article "Bubble Lattices I: Structure"…

Combinatorics · Mathematics 2025-10-02 Thomas McConville , Henri Mühle

We develop a combinatorial and order-theoretic framework for shuffles, understood as ordered concatenations of indexed families of sequences that induce total orders on the natural numbers. Motivated by the classical \v{S}arkovski\u{i}…

Combinatorics · Mathematics 2026-02-03 João Dias , Bruno Dinis , Carlos Correia Ramos

We study the $(m,n)$-word lattices recently introduced by V. Pilaud and D. Poliakova in their study of generalized Hochschild polytopes. We prove that these lattices are extremal and constructable by interval doublings. Moreover, we…

Combinatorics · Mathematics 2025-10-02 Henri Mühle

Hochschild lattices are specific intervals in the dexter meet-semilattices recently introduced by Chapoton. A natural geometric realization of these lattices leads to some cell complexes introduced by Saneblidze, called the Hochschild…

Combinatorics · Mathematics 2020-07-02 Camille Combe

We characterize commutative idempotent involutive residuated lattices as disjoint unions of Boolean algebras arranged over a distributive lattice. We use this description to introduce a new construction, called gluing, that allows us to…

Logic · Mathematics 2021-08-27 Peter Jipsen , Olim Tuyt , Diego Valota

The DNA molecule is modeled by a parabola embedded chain with long-range interactions between twisted base pair dipoles. A mechanism for bubble generation is presented and investigated in two different configurations. Using random normally…

Pattern Formation and Solitons · Physics 2007-05-23 Peter V. Larsen , Peter L. Christiansen , Ole Bang , Juan F. R. Archilla , Yuri B. Gaididei

De Morgan bisemilattices are expansions of distributive bisemilattices by an involution satisfying De Morgan properties. They have attracted interest both as algebraic models of analytic containment logics, and as a case study for a certain…

Logic · Mathematics 2026-03-13 Francesco Paoli , Damian Szmuc , Agustina Borzi , Martina Zirattu

This survey article is devoted to general results in combinatorial enumeration. The first part surveys results on growth of hereditary properties of combinatorial structures. These include permutations, ordered and unordered graphs and…

Combinatorics · Mathematics 2008-04-01 Martin Klazar

We investigate the lattice of machine invariant classes. This is an infinite completely distributive lattice but it is not a Boolean lattice. We show the subword complexity and the growth function create machine invariant classes. So the…

Cryptography and Security · Computer Science 2007-05-23 Janis Buls

Advances in DNA nanotechnology have stimulated the search for simple motifs that can be used to control the properties of DNA nanostructures. One such motif, which has been used extensively in structures such as polyhedral cages,…

Soft Condensed Matter · Physics 2015-06-10 John S. Schreck , Thomas E. Ouldridge , Flavio Romano , Ard A. Louis , Jonathan P. K. Doye

We introduce the blockwise gluing construction. This describes residuated integral chains which can be decomposed into (possibly) partial algebras, stacked one on top of the other, and such that elements in a certain component multiply in…

Logic · Mathematics 2025-12-22 Valeria Giustarini , Sara Ugolini

We discuss a notion of shuffle for trees which extends the usual notion of a shuffle for two natural numbers. We give several equivalent descriptions, and prove some algebraic and combinatorial properties. In addition, we characterize…

Combinatorics · Mathematics 2017-05-11 Eric Hoffbeck , Ieke Moerdijk

A lattice L is spatial if every element of L is a join of completely join-irreducible elements of L (points), and strongly spatial if it is spatial and the minimal coverings of completely join-irreducible elements are well-behaved.…

Rings and Algebras · Mathematics 2011-07-04 Luigi Santocanale , Friedrich Wehrung

Goulden and Jackson introduced a very powerful method to study the distributions of certain consecutive patterns in permutations, words, and other combinatorial objects which is now called the cluster method. There are a number of natural…

Combinatorics · Mathematics 2017-06-06 Ran Pan , Jeffrey Brian Remmel

In this paper, we characterize the congruences of an arbitrary i--lattice, investigate the structure of the lattice they form and how it relates to the structure of the lattice of lattice congruences, then, for an arbitrary non--zero…

Rings and Algebras · Mathematics 2018-12-10 Claudia Muresan

We investigate the structure theory of the variety of \emph{PBZ*-lattices} and some of its proper subvarieties. These lattices with additional structure originate in the foundations of quantum mechanics and can be viewed as a common…

Logic · Mathematics 2019-05-16 Roberto Giuntini , Claudia Mureşan , Francesco Paoli

This paper studies biased riffle shuffles, first defined by Diaconis, Fill, and Pitman. These shuffles generalize the well-studied Gilbert-Shannon-Reeds shuffle and convolve nicely. An upper bound is given for the time for these shuffles to…

Combinatorics · Mathematics 2007-05-23 Jason Fulman
‹ Prev 1 2 3 10 Next ›