相关论文: Discrete Polymatroids
The study of the combinatorial diameter of a polyhedron is a classical topic in linear-programming theory due to its close connection with the possibility of a polynomial simplex-method pivot rule. The 2-sum operation is a classical…
We introduce a construction of oriented matroids from a triangulation of a product of two simplices. For this, we use the structure of such a triangulation in terms of polyhedral matching fields. The oriented matroid is composed of…
This paper surveys the theory of multiple packings and coverings. The study of multiple arrangements started in the 60s of the last century, and it was restricted mostly to lattice arrangements on the plane or of general arrangements of…
The cave polynomial of a polymatroid was recently introduced and used to study the syzygies of polymatroidal ideals. We study the combinatorial relationships between three formulas for the cave polynomial. As an application, we interpret…
A polytope is called indecomposable if it cannot be expressed nontrivially as a Minkowski sum of other polytopes. Since Gale introduced the concept in 1954, several increasingly strong criteria have been developed to characterize…
The intersection data of a hyperplane arrangement is described by a geometric lattice, or equivalently a simple matroid. There is a rich interplay between this combinatorial structure and the topology of the arrangement complement. In this…
This study aims to shed light on new (sub)classes of matroids originating from cluster algebras and investigate their properties. We focus on what we call cluster matroids and build some results on them. Then, we point out a relationship…
A transversal matroid whose dual is also transversal is called bi-transversal. Let $G$ be an undirected graph with vertex set $V$. In this paper, for every subset $W$ of $V$, we associate a bi-transversal matroid to the pair $(G,W)$. We…
Enumeration of all combinatorial types of point configurations and polytopes is a fundamental problem in combinatorial geometry. Although many studies have been done, most of them are for 2-dimensional and non-degenerate cases. Finschi and…
A partly autobiographical survey of the development of enumerative and algebraic combinatorics in the 1960's and 1970's.
Abstract polytopes are combinatorial structures with distinctive geometric, algebraic, or topological characteristics, that generalize (the face lattice of) traditional polyhedra, polytopes or tessellations. Most research has focused on…
We introduce an axiomatic theory of spherical diagrams as a tool to study certain combinatorial properties of polyhedra in $\mathbb R^3$, which are of central interest in the context of Art Gallery problems for polyhedra and other…
The Tutte polynomial for matroids is not directly applicable to polymatroids. For instance, deletion-contraction properties do not hold. We construct a polynomial for polymatroids which behaves similarly to the Tutte polynomial of a…
The purpose of this work is to analyse a family of mutually orthogonal polynomials on the unit ball with respect to an inner product which includes an additional term on the sphere. First, we will get connection formulas relating classical…
In this paper we study algorithmic aspects of tropical intersection theory. We analyse how divisors and intersection products on tropical cycles can actually be computed using polyhedral geometry. The main focus of this paper is the study…
A discrete analog of the holomorphic map $z^{\gamma}$ is studied. It is given by Schramm's circle pattern with the combinatorics of the square grid. It is shown that the corresponding circle patterns are embedded and described by special…
We present a method of constructing discrete integrable systems with crystallographic reflection group (Weyl) symmetries, thus clarifying the relationship between different discrete integrable systems in terms of their symmetry groups.…
We introduce and prove some basic results about a combinatorial model which produces embedded polygons in the plane. The model is closely related to outer billiards on kites, and also is related to corner percolation, to Hooper's Truchet…
For a finite simplicial complex K and a CW-pair (X,A), there is an associated CW-complex Z_K(X,A), known as a polyhedral product. We apply discrete Morse theory to a particular CW-structure on the n-sphere moment-angle complexes Z_K(D^{n},…
Based on the well-established theory of discrete conjugate nets in discrete differential geometry, we propose and examine discrete analogues of important objects and notions in the theory of semi-Hamiltonian systems of hydrodynamic type. In…