English
Related papers

Related papers: A Pattern Avoidance Characterization for Smoothnes…

200 papers

A matroid is a machine capturing linearity of mathematical objects and producing combinatorial structures. Matroid structure arises everywhere since linearity is a ubiquitous concept. One natural way to obtain matroids is by considering…

Combinatorics · Mathematics 2023-03-14 Jaeho Shin

We study the dimer model for a planar bipartite graph N embedded in a disk, with boundary vertices on the boundary of the disk. Counting dimer configurations with specified boundary conditions gives a point in the totally nonnegative…

Combinatorics · Mathematics 2017-05-17 Thomas Lam

We study rank-three matroids, known as point-line configurations, and their associated matroid varieties, defined as the Zariski closures of their realization spaces. Our focus is on determining finite generating sets of defining equations…

Combinatorics · Mathematics 2025-06-10 Emiliano Liwski , Fatemeh Mohammadi , Lisa Vandebrouck

We establish a link between open positroid varieties in the Grassmannians $G(k,n)$ and certain moduli spaces of complexes of vector bundles over Kodaira cycle $C^n$, using the shifted Poisson structure on the latter moduli spaces and…

Algebraic Geometry · Mathematics 2025-08-06 Zheng Hua , Alexander Polishchuk

A matroid is a combinatorial structure that captures and generalizes the algebraic concept of linear independence under a broader and more abstract framework. Matroids are closely related with many other topics in discrete mathematics, such…

Combinatorics · Mathematics 2022-03-16 Gianira N. Alfarano , Karan Khathuria , Simran Tinani

We extend the concept of pattern avoidance in permutations on a totally ordered set to pattern avoidance in permutations on partially ordered sets. The number of permutations on $P$ that avoid the pattern $\pi$ is denoted $Av_P(\pi)$. We…

Combinatorics · Mathematics 2019-12-24 Sam Hopkins , Morgan Weiler

We introduce and study different compactifications of the moduli space of $n$ distinct weighted labeled points in a flag of affine spaces. We construct these spaces via the weighted and generalized Fulton-MacPherson compactifications of…

Algebraic Geometry · Mathematics 2024-11-12 Patricio Gallardo , Javier González-Anaya , José Luis González

We initiate a systematic study of non-planar on-shell diagrams in N=4 SYM and develop powerful technology for doing so. We introduce canonical variables generalizing face variables, which make the dlog form of the on-shell form explicit. We…

High Energy Physics - Theory · Physics 2016-07-29 Sebastian Franco , Daniele Galloni , Brenda Penante , Congkao Wen

We prove the positivity of Kazhdan-Lusztig polynomials for sparse paving matroids, which are known to be logarithmically almost all matroids, but are conjectured to be almost all matroids. The positivity follows from a remarkably simple…

Combinatorics · Mathematics 2020-06-19 Kyungyong Lee , George D. Nasr , Jamie Radcliffe

We study the Chow classes of arbitrary matroids in the Grassmannian. We develop a new combinatorial approach for computing them, by first focusing on snake matroids and then extending our results via valuativity to any matroid. Our main…

Combinatorics · Mathematics 2025-11-21 Jon Pål Hamre , Benjamin Schröter , Lorenzo Vecchi , Emil Verkama

Let $\mathbb{G}(d,n)$ be the complex Grassmannian of affine $d$-planes in $n$-space. We study the problem of characterizing the set of algebraic subvarieties of $\mathbb{G}(d,n)$ invariant under the action of the maximal torus $T$ and…

Algebraic Geometry · Mathematics 2025-03-10 E. Javier Elizondo , Alex Fink , Cristhian Garay López

Let $\rho$ be a non-negative integer. A $\rho$-removed uniform matroid is a matroid obtained from a uniform matroid by removing a collection of $\rho$ disjoint bases. We present a combinatorial formula for Kazhdan-Lusztig polynomials of…

Combinatorics · Mathematics 2019-11-13 Kyungyong Lee , George D. Nasr , Jamie Radcliffe

Schubert varieties of hyperplane arrangements, also known as matroid Schubert varieties, play an essential role in the proof of the Dowling-Wilson conjecture and in Kazhdan-Lusztig theory for matroids. We study these varieties as…

Algebraic Geometry · Mathematics 2023-06-30 Colin Crowley

Swartz proved that any matroid can be realized as the intersection lattice of an arrangement of codimension one homotopy spheres on a sphere. This was an unexpected extension from the oriented matroid case, but unfortunately the…

Combinatorics · Mathematics 2015-03-13 Alexander Engstrom

The first problem we investigate is the following: given $k\in \mathbb{R}_{\ge 0}$ and a vector $v$ of Pl\"ucker coordinates of a point in the real Grassmannian, is the vector obtained by taking the $k$th power of each entry of $v$ again a…

Combinatorics · Mathematics 2019-10-03 Matthias Lenz

The structure of order ideals in the Bruhat order for the symmetric group is elucidated via permutation patterns. A method for determining non-isomorphic principal order ideals is described and applied for small lengths. The permutations…

Combinatorics · Mathematics 2007-05-23 Bridget Eileen Tenner

The purpose of the present work is to describe a dequantization procedure for topological modules over a deformed algebra. We define the characteristic variety of a topological module as the common zeroes of the annihilator of the…

Representation Theory · Mathematics 2015-06-26 Ali Baklouti , Sami Dhieb , Dominique Manchon

We primarily investigate the properties of characteristic polynomials of semimatroids. In particular, we provide a combinatorial interpretation of their coefficients, generalizing the Whitney's Broken Circuit Theorem. We also prove that the…

Combinatorics · Mathematics 2025-08-03 Houshan Fu

We introduce the self-projecting Grassmannian, an irreducible subvariety of the Grassmannian parametrizing linear subspaces that satisfy a generalized self-duality condition. We study its relation to classical moduli spaces, such as the…

Algebraic Geometry · Mathematics 2025-11-27 Alheydis Geiger , Francesca Zaffalon

A permutation of size $n$ can be identified to its diagram in which there is exactly one point per row and column in the grid $[n]^2$. In this paper we consider multidimensional permutations (or $d$-permutations), which are identified to…

Combinatorics · Mathematics 2022-10-12 Nicolas Bonichon , Pierre-Jean Morel
‹ Prev 1 4 5 6 7 8 10 Next ›