English
Related papers

Related papers: The $cd$-index of base polytopes for connected spl…

200 papers

Using the cyclotomic identity we compute sums over d-tuples of monic polynomials in F_q[x] weighted by the multiplicity of their irreducible factors. As consequences we determine explicit expressions for the number of d-tuples of…

Number Theory · Mathematics 2025-09-03 Richard Ehrenborg

We study some properties of the {\bf cd}-index of the Boolean lattice. They are extremely similar to the properties of the {\ab}-index, or equivalently, the flag $h$-vector of the Boolean lattice and hence may be viewed as their {\bf…

Combinatorics · Mathematics 2007-05-23 Swapneel Mahajan

Fix two lattice paths $P$ and $Q$ from $(0,0)$ to $(m,r)$ that use East and North steps with $P $ never going above $Q$. Bonin et al. show that the lattice paths that go from $(0,0)$ to $(m,r)$ and remain bounded by $P$ and $Q$ can be…

Combinatorics · Mathematics 2012-12-27 Hoda Bidkhori

Matroids give rise to several natural constructions of polytopes. Inspired by this, we examine polytopes that arise from the signed circuits of an oriented matroid. We give the dimensions of these polytopes arising from graphical oriented…

Combinatorics · Mathematics 2025-01-03 Laura Escobar , Jodi McWhirter

The submodular partitioning problem asks to minimize, over all partitions $P$ of a ground set $V$, the sum of a given submodular function $f$ over the parts of $P$. The problem has seen considerable work in approximability, as it…

Data Structures and Algorithms · Computer Science 2025-07-03 Kristóf Bérczi , Karthekeyan Chandrasekaran , Tamás Király , Daniel P. Szabo

We give an algorithm that constructs the Hasse diagram of the face lattice of a convex polytope P from its vertex-facet incidences in time O(min{n,m}*a*f), where n is the number of vertices, m is the number of facets, a is the number of…

Metric Geometry · Mathematics 2007-05-23 Volker Kaibel , Marc E. Pfetsch

The weak-map order on the matroid base polytopes is the partial order defined by inclusion. Lucas proved that the base polytope of no binary matroid includes the base polytope of a connected matroid. A matroid base polytope is said to be…

Combinatorics · Mathematics 2012-03-26 Kenji Kashiwabara

We apply a theorem of Gel'fand, Goresky, MacPherson, and Serganova about matroid polytopes to study semistability of partial flags relative to a T-linearized ample line bundle of a flag space F = SL(n)/P where T is a maximal torus in SL(n)…

Algebraic Geometry · Mathematics 2007-05-23 Benjamin J. Howard

Let ${\mathcal{M} = (M_i \colon i\in K)}$ be a finite or infinite family consisting of matroids on a common ground set $E$ each of which may be finitary or cofinitary. We prove the following Cantor-Bernstein-type result: If there is a…

Combinatorics · Mathematics 2024-05-27 Joshua Erde , Pascal Gollin , Attila Joó , Paul Knappe , Max Pitz

In this paper, we present a new method for computing bounded-degree factors of lacunary multivariate polynomials. In particular for polynomials over number fields, we give a new algorithm that takes as input a multivariate polynomial f in…

Symbolic Computation · Computer Science 2016-02-01 Bruno Grenet

In this paper, we present a lattice-theoretic characterization for valuated matroids, which is an extension of the well-known cryptomorphic equivalence between matroids and geometric lattices ($=$ atomistic semimodular lattices). We…

Combinatorics · Mathematics 2019-03-04 Hiroshi Hirai

A skew polynomial ring $R=K[x;\sigma,\delta]$ is a ring of polynomials with non-commutative multiplication. This creates a difference between left and right divisibility, and thus a concept of left and right evaluations and roots. A…

Rings and Algebras · Mathematics 2018-08-17 Travis Baumbaugh , Felice Manganiello

We give an algorithm for computing approximate PSD factorizations of nonnegative matrices. The running time of the algorithm is polynomial in the dimensions of the input matrix, but exponential in the PSD rank and the approximation error.…

Data Structures and Algorithms · Computer Science 2016-02-25 Amitabh Basu , Michael Dinitz , Xin Li

The foundation of a matroid is a canonical algebraic invariant which classifies representations of the matroid up to rescaling equivalence. Foundations of matroids are pastures, a simultaneous generalization of partial fields and…

Combinatorics · Mathematics 2020-08-04 Matthew Baker , Oliver Lorscheid

The face numbers of simplicial complexes without missing faces of dimension larger than $i$ are studied. It is shown that among all such $(d-1)$-dimensional complexes with non-vanishing top homology, a certain polytopal sphere has the…

Combinatorics · Mathematics 2009-07-13 Michael Goff , Steven Klee , Isabella Novik

Consider the gradient map associated to any non-constant homogeneous polynomial $f\in \C[x_0,...,x_n]$ of degree $d$, defined by \[\phi_f=grad(f): D(f)\to \CP^n, (x_0:...:x_n)\to (f_0(x):...:f_n(x))\] where $D(f)=\{x\in \CP^n; f(x)\neq 0\}$…

Algebraic Geometry · Mathematics 2010-03-10 Imran Ahmed

It is known that the $k$-faces of the permutohedron $\Pi_n$ are labeled by (all possible) linearly ordered partitions of the set $[n]=\{1,...,n\}$ into $(n-k)$ non-empty parts. The incidence relation corresponds to the refinement: a face…

Metric Geometry · Mathematics 2014-11-11 Gaiane Panina

Gr\"unbaum, Barnette, and Reay in 1974 completed the characterization of the pairs $(f_i,f_j)$ of face numbers of $4$-dimensional polytopes. Here we obtain a complete characterization of the pairs of flag numbers $(f_0,f_{03})$ for…

Metric Geometry · Mathematics 2020-01-28 Hannah Sjöberg , Günter M. Ziegler

For an $n \times n$ nonnegative matrix $P$, an isomorphism is obtained between the lattice of initial subsets (of ${1,...,n}$) for $P$ and the lattice of $P$-invariant faces of the nonnegative orthant $\IR^{n}_{+}$. Motivated by this…

Rings and Algebras · Mathematics 2007-05-23 Bit-Shun Tam , Hans Schneider

We show that the topes of a complex of oriented matroids (abbreviated COM) of VC-dimension $d$ admit a proper labeled sample compression scheme of size $d$. This considerably extends results of Moran and Warmuth on ample classes, of…

Combinatorics · Mathematics 2023-04-21 Victor Chepoi , Kolja Knauer , Manon Philibert
‹ Prev 1 4 5 6 7 8 10 Next ›