English
Related papers

Related papers: Ghost Kohnert posets

200 papers

This note is a response to one of problems posed by A.K. Kwasniewski in one of his recent papers. Namely for the sequence of finite cobweb subposets, the looked for explicit formulas for corresponding sequence of characteristic polynomials…

Combinatorics · Mathematics 2008-02-21 Ewa Krot-Sieniawska

We show that a variety of monodromy phenomena arising in geometric topology and algebraic geometry are most conveniently described in terms of quandle homomorphisms from a knot quandle associated to the base to a quandle associated to a…

Geometric Topology · Mathematics 2007-05-23 D. N. Yetter

Monodromy groups, i.e. the groups of isometries of the intersection lattice L_X:=H_2/torsion generated by the monodromy action of all deformation families of a given surface, have been computed in math.AG/0006231 for any minimal elliptic…

Algebraic Geometry · Mathematics 2007-05-23 Michael Lönne

We establish a conjecture of Defant, Hopkins, Poznanovi\'{c}, and Propp concerning the dimensions of toggleability spaces for products of chains, shifted staircases, type-A root posets, and type-B posets. Generalizing this result, we show…

Combinatorics · Mathematics 2025-08-22 Ben Adenbaum , Spencer Daugherty , Nicholas Mayers

Ghost modules were introduced in [I3] without definitions or proofs. We also introduced stability diagrams or "relative pictures" for torsion classes and torsion-free classes for representations of Dynkin quivers. Modules which were not in…

Representation Theory · Mathematics 2025-08-19 Kiyoshi Igusa

In 2016, Hasebe and Tsujie gave a recursive characterization of the set of induced $N$-free and bowtie-free posets; Misanantenaina and Wagner studied these orders further, naming them "$\mathcal{V}$-posets". Here we offer a new…

Combinatorics · Mathematics 2018-11-15 Joshua Cooper , Peter Gartland , Hays Whitlatch

For each permutation $w$, we consider the set $\mathrm{PD}(w)$ of reduced pipe dreams for $w$, partially ordered so that cover relations correspond to (generalized) chute moves. Settling a conjecture of Rubey from 2012, we prove that…

Combinatorics · Mathematics 2025-07-18 Ilani Axelrod-Freed , Colin Defant , Hanna Mularczyk , Son Nguyen , Katherine Tung

Anders Bjorner characterized which finite graded partially ordered sets arise as the posets of closure relations on cells of a finite, regular CW complex. His characterization of these "CW posets" required each open interval $(\hat{0},u)$…

Combinatorics · Mathematics 2014-11-06 Patricia Hersh

Given a finite poset $\mathcal P$, we say that a family $\mathcal F$ of subsets of $[n]$ is $\mathcal P$-saturated if $\mathcal F$ does not contain an induced copy of $\mathcal P$, but adding any other set to $\mathcal F$ creates an induced…

Combinatorics · Mathematics 2026-05-26 Maria-Romina Ivan , Sean Jaffe

Graded posets frequently arise throughout combinatorics, where it is natural to try to count the number of elements of a fixed rank. These counting problems are often $\#\textbf{P}$-complete, so we consider approximation algorithms for…

Data Structures and Algorithms · Computer Science 2023-04-11 Prateek Bhakta , Ben Cousins , Matthew Fahrbach , Dana Randall

In this paper we consider the characteristic polynomial of not necessarily ranked posets. We do so by allowing the rank to be an arbitrary function from the poset to the nonnegative integers. We will prove two results showing that the…

Combinatorics · Mathematics 2014-11-13 Joshua Hallam

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…

A toric arrangement is an arrangement of subtori of codimension one in a real or complex torus. The poset of layers is the set of connected components of non-empty intersections of these subtori, partially ordered by reverse inclusion. In…

Combinatorics · Mathematics 2017-08-25 Matthias Lenz

We give a new combinatorial description for stable Grothendieck polynomials in terms of subdivisions of Gelfand-Zetlin polytopes. Moreover, these subdivisions also provide a description of Lascoux polynomials. This generalizes a similar…

Combinatorics · Mathematics 2024-10-15 Ekaterina Presnova , Evgeny Smirnov

Convex polyominoes can be refined according to the number of direction changes in monotone paths connecting pairs of cells, leading to the notion of $k$-convexity. In particular, the cases $k=1$ and $k=2$ correspond to $L$-convex and…

Combinatorics · Mathematics 2026-03-30 Nicholas Beaton , Simone Rinaldi

Motivated by applications to the fractional quantum Hall effect and, in particular, to the Bernevig-Haldane conjectures, we investigates the behavior of Macdonald polynomials under specializations of the form q a t b = 1. Our main focus is…

Combinatorics · Mathematics 2026-01-21 Christophe Carré , Ulysse Goncalves , Jean-Gabriel Luque

The purpose of the present paper is to give a realization of a cylindric diagram as a subset of root systems of type $A_{\kappa-1}^{(1)}$ and several characterization of its poset structure. Furthermore, the set of order ideals of a…

Combinatorics · Mathematics 2023-02-06 Kento Nakada , Takeshi Suzuki , Yoshitaka Toyosawa

We show a new class of interaction terms with higher derivatives that can be added to every low derivative real scalar, such that the theory is degenerate, and the equation of motion remains of second order. In contrast to previous setups,…

High Energy Physics - Theory · Physics 2021-03-22 Justo Lopez-Sarrion , Mauricio Valencia-Villegas

Paraorthomodular posets are bounded partially ordered set with an antitone involution induced by quantum structures arising from the logico-algebraic approach to quantum mechanics. The aim of the present work is starting a systematic…

Logic · Mathematics 2020-11-26 Ivan Chajda , Davide Fazio , Helmut Länger , Antonio Ledda , Jan Paseka

Alon and Shapira proved that every monotone class (closed under taking subgraphs) of undirected graphs is strongly testable, that is, under the promise that a given graph is either in the class or $\varepsilon$-far from it, there is a test…

Combinatorics · Mathematics 2024-09-25 Panna Tímea Fekete , Gábor Kun
‹ Prev 1 8 9 10 Next ›