English
Related papers

Related papers: The excluded minors for lattice path polymatroids

200 papers

This paper has two aims. The first is to study ideals of minors of matrices whose entries are among the variables of a polynomial ring. Specifically, we describe matrices whose ideals of minors of a given size are prime. The main result in…

Commutative Algebra · Mathematics 2007-05-23 Mordechai Katzman

We prove that the ranks of the subsets and the activities of the bases of a matroid define valuations for the subdivisions of a matroid polytope into smaller matroid polytopes.

Combinatorics · Mathematics 2019-08-15 Federico Ardila , Alex Fink , Felipe Rincón

This sequel to our paper (Infinite gammoids, 2014) considers minors and duals of infinite gammoids. We prove that a class of gammoids definable by digraphs not containing a certain type of substructure, called an outgoing comb, is…

Combinatorics · Mathematics 2014-11-11 Seyed Hadi Afzali Borujeni , Hiu Fai Law , Malte Müller

Toric geometry provides a bridge between the theory of polytopes and algebraic geometry: one can associate to each lattice polytope a polarized toric variety. In this paper we explore this correspondence to classify smooth lattice polytopes…

Algebraic Geometry · Mathematics 2013-02-08 Carolina Araujo , Douglas Monsôres

We give upper bounds on the minimal degree of a model in $\mathbb{P}^2$ and the minimal bidegree of a model in $\mathbb{P}^1 \times \mathbb{P}^1$ of the curve defined by a given Laurent polynomial, in terms of the combinatorics of the…

Combinatorics · Mathematics 2015-05-22 Wouter Castryck , Filip Cools

We construct Euclidean lattices whose sets of minimal vectors support some large equiangular families of lines, using notably reduction modulo~$2$ of lattices. %as considered in \cite{Ma1} and \cite{Ma2}. We also consider some related…

Number Theory · Mathematics 2024-03-15 Jacques Martinet

We study the higher-order Euler polynomials and give the corresponding monic orthogonal polynomials, which are Meixner-Pollaczek polynomials with certain arguments and constant factors. Moreover, through a general connection between moments…

Combinatorics · Mathematics 2018-08-14 Lin Jiu , Diane Yahui Shi

Inspired by the work of Izakhian and Rhodes, a theory of representation of hereditary collections by boolean matrices is developed. This corresponds to representation by finite $\vee$-generated lattices. The lattice of flats, defined for…

Combinatorics · Mathematics 2012-10-29 John Rhodes , Pedro V. Silva

We show that an adjoint of a loopless matroid is connected if and only if it itself is connected. Our first goal is to study the adjoint of modular matroids. We prove that a modular matroid has only one adjoint (up to isomorphism) which can…

Combinatorics · Mathematics 2023-04-18 Houshan Fu , Chunming Tang , Suijie Wang

We characterize the class of threshold matroids by the structure of their defining bases. We also give an example of a shifted matroid which is not threshold, answering a question of Deza and Onn. We conclude by exploring consequences of…

Combinatorics · Mathematics 2025-09-01 Ethan Partida

Matroid is a generalization of many fundamental objects in combinatorial mathematics , and matroid intersection problem is a classical subject in combinatorial optimization . However , only the intersection of two matroids are well…

Combinatorics · Mathematics 2023-01-10 Tianyu Liu

The family of 2-level matroids, that is, matroids whose base polytope is 2-level, has been recently studied and characterized by means of combinatorial properties. 2-level matroids generalize series-parallel graphs, which have been already…

Combinatorics · Mathematics 2015-10-15 Francesco Grande , Juanjo Rué

We prove that the Tutte polynomial of a coloopless paving matroid is convex along the portions of the line segments x+y=p lying in the positive quadrant. Every coloopless paving matroids is in the class of matroids which contain two…

Combinatorics · Mathematics 2010-04-16 L. E. Chavez-Lomelí , C. Merino , S. D. Noble , M. Ramírez-Ibañez

A tope committee K* for a simple oriented matroid M is a subset of its maximal covectors such that every positive halfspace of M contains more than half of the covectors from K*. The structures of the family of all committees for M, and of…

Combinatorics · Mathematics 2008-11-30 Andrey O. Matveev

Given a matroid or flag of matroids we introduce several broad classes of polynomials satisfying Deletion-Contraction identities, and study their singularities. There are three main families of polynomials captured by our approach:…

Algebraic Geometry · Mathematics 2024-04-12 Daniel Bath , Uli Walther

A self-avoiding polygon is a lattice polygon consisting of a closed self-avoiding walk on a square lattice. Surprisingly little is known rigorously about the enumeration of self-avoiding polygons, although there are numerous conjectures…

Combinatorics · Mathematics 2019-08-15 Kyungpyo Hong , Seungsang Oh

In this paper we highlight some enumerative results concerning matroids of low rank and prove the tail-ends of various sequences involving the number of matroids on a finite set to be log-convex. We give a recursion for a new, slightly…

Combinatorics · Mathematics 2007-05-23 W. M. B. Dukes

We classify minimal extrinsically homogeneous submanifolds of complex hyperbolic spaces.

Differential Geometry · Mathematics 2026-05-12 Ángel Cidre-Díaz , Miguel Domínguez-Vázquez

In this note we characterize tropical bases as sets of circuits that by orthogonality determine the set of cocircuits of a simple matroid. Furthermore, we show that any circuit, which itself is closed, must be contained in any tropical…

Combinatorics · Mathematics 2024-06-21 Winfried Hochstättler

We study point-line configurations, their minimal matroids, and their associated circuit varieties. We present an algorithm for identifying the minimal matroids of these configurations with respect to dependency order, or equivalently, the…

Combinatorics · Mathematics 2025-02-04 Emiliano Liwski , Fatemeh Mohammadi
‹ Prev 1 4 5 6 7 8 10 Next ›