English
Related papers

Related papers: Well-quasi-ordering in lattice path matroids

200 papers

Logical transductions provide a very useful tool to encode classes of structures inside other classes of structures. In this paper we study first-order (FO) transductions and the quasiorder they induce on infinite classes of finite graphs.…

Combinatorics · Mathematics 2021-07-14 Jaroslav Nesetril , Patrice Ossona de Mendez , Sebastian Siebertz

We investigate, through the density-matrix renormalization group and the Lanczos technique, the possibility of a two-leg Kondo ladder present an incommensurate orbital order. Our results indicate a staggered short-range orbital order at…

Strongly Correlated Electrons · Physics 2009-11-11 J. C. Xavier , A. L. Malvezzi

We introduce a combinatorial model for the Milnor fibration of a complexified real arrangement using oriented matroids. It is a poset quasi-fibration, a notion recently introduced by the first author, whose domain is a subdivision of the…

Algebraic Geometry · Mathematics 2025-08-22 Paul Mücksch , Masahiko Yoshinaga

Matching of the quasi parton distribution functions between continuum and lattice is addressed using lattice perturbation theory specifically with Wilson-type fermions. The matching is done for nonlocal quark bilinear operators with a…

High Energy Physics - Lattice · Physics 2018-04-18 Tomomi Ishikawa

We introduce semidistrim lattices, a simultaneous generalization of semidistributive and trim lattices that preserves many of their common properties. We prove that the elements of a semidistrim lattice correspond to the independent sets in…

Combinatorics · Mathematics 2021-11-17 Colin Defant , Nathan Williams

For L a finite lattice, let C(L) denote the set of pairs g = (g_0,g_1) such that g_0 is a lower cover of g_1 and order it as follows: g <= d iff g_0 <= d_0, g_1 <= d_1, but not g_1 <= d_0. Let C(L,g) denote the connected component of g in…

Logic · Mathematics 2008-07-22 Luigi Santocanale

A unified classification and analysis is presented of two dimensional Dirac operators of QCD-like theories in the continuum as well as in a naive lattice discretization. Thereby we consider the quenched theory in the strong coupling limit.…

High Energy Physics - Lattice · Physics 2013-10-28 Mario Kieburg , Jacobus J. M. Verbaarschot , Savvas Zafeiropoulos

The weak order is a classical poset structure on a Coxeter group; it is a lattice when the group is finite but merely a meet-semilattice when the group is infinite. Motivated by problems in Kazhdan--Lusztig theory, Matthew Dyer introduced…

Combinatorics · Mathematics 2025-09-03 Grant Barkley , Colin Defant , Patricia Hersh , Jon McCammond , Thomas McConville , David E Speyer

We consider partially ordered sets of combinatorial structures under consecutive orders, meaning that two structures are related when one embeds in the other such that `consecutive' elements remain consecutive in the image. Given such a…

Combinatorics · Mathematics 2026-04-22 Victoria Ironmonger , Nik Ruškuc

Ceballos and Pons generalized weak order on permutations to a partial order on certain labeled trees, thereby introducing a new class of lattices called $s$-weak order. They also generalized the Tamari lattice by defining a particular…

Combinatorics · Mathematics 2020-09-08 Stephen Lacina

The parity anomaly for Dirac fermions in two spatial dimensions has shaped perspectives in quantum field theory and condensed matter physics. In condensed matter it has evolved as a mechanism for half-quantized Hall responses in systems…

Strongly Correlated Electrons · Physics 2026-04-10 Shun-Qing Shen

Motivated by a property of linear resistive electrical networks, we introduce the class of Rayleigh matroids. This is a subclass of the balanced matroids introduced by Feder and Mihail [FM] in 1992. We prove a variety of results relating…

Combinatorics · Mathematics 2007-05-23 Y. -B. Choe , D. G. Wagner

Daligault, Rao and Thomass\'e asked whether every hereditary graph class that is well-quasi-ordered by the induced subgraph relation has bounded clique-width. Lozin, Razgon and Zamaraev (JCTB 2017+) gave a negative answer to this question,…

Combinatorics · Mathematics 2017-11-27 Konrad K. Dabrowski , Vadim V. Lozin , Daniël Paulusma

Let $\cX$ be a family of subsets of a finite set $E$. A matroid on $E$ is called an $\cX$-matroid if each set in $\cX$ is a circuit. We consider the problem of determining when there exists a unique maximal $\cX$-matroid in the weak order…

Combinatorics · Mathematics 2021-03-16 Bill Jackson , Shin-ichi Tanigawa

We construct a metrizable semitopological semilattice $X$ whose partial order $P=\{(x,y)\in X\times X:xy=x\}$ is a non-closed dense subset of $X\times X$. As a by-product we find necessary and sufficient conditions for the existence of a…

General Topology · Mathematics 2021-11-01 Taras Banakh , Serhii Bardyla , Alex Ravsky

A well-known conjecture states that the Whitney numbers of the second kind of a geometric lattice (simple matroid) are logarithmically concave. We show this conjecture to be equivalent to proving an upper bound on the number of new copoints…

Combinatorics · Mathematics 2011-11-10 W. M. B. Dukes

Lattice paths called $\ell$-Schr\"oder paths are introduced. They are paths on the upper half-plane consisting of $\ell+2$ types of steps: $(i,\ell-i)$ for $i=0,\ldots,\ell$, and $(1,-1)$. Those paths generalize Schr\"oder paths and some…

Combinatorics · Mathematics 2023-10-17 Mawo Ito

We study the combinatorics of modular flats of oriented matroids and the topological consequences for their Salvetti complexes. We show that the natural map to the localized Salvetti complex at a modular flat of corank one is what we call a…

Combinatorics · Mathematics 2024-07-03 Paul Mücksch

We discuss a conjecture of Ingleton on excluded minors for base-orderability, and, extending a result he stated, we prove that infinitely many of the matroids that he identified are excluded minors for base-orderability, as well as for the…

Combinatorics · Mathematics 2024-08-07 Joseph E. Bonin , Thomas J. Savitsky

Coxeter groups are equipped with a partial order known as the weak order, such that $u \leq v$ if the inversions of $u$ are a subset of the inversions of $v$. In finite Coxeter groups, weak order is a complete lattice, but in infinite…

Combinatorics · Mathematics 2025-12-23 Grant T. Barkley , David E Speyer
‹ Prev 1 8 9 10 Next ›