English
Related papers

Related papers: Pattern Recognition on Oriented Matroids: Layers o…

200 papers

The typical problem in (generalized) Ramsey theory is to find the order of the largest monochromatic member of a family F (for example matchings, paths, cycles, connected subgraphs) that must be present in any edge coloring of a complete…

Combinatorics · Mathematics 2013-04-04 András Gyárfás , Gábor N. Sárközy , Stanley Selkow

We present statistics on the decompositions (with respect to a distinguished symmetric 2t-cycle) of vertices of the hypercube graph, whose negative parts are covered by two subsets of the ground set {1,...,t} of the corresponding oriented…

Combinatorics · Mathematics 2023-03-24 Andrey O. Matveev

We give an effective upper bound on the h^*-polynomial of a lattice polytope in terms of its degree and leading coefficient, confirming a conjecture of Batyrev. We deduce this bound as a consequence of a strong Cayley decomposition theorem…

Combinatorics · Mathematics 2010-02-14 Christian Haase , Benjamin Nill , Sam Payne

Las Vergnas introduced several lattice structures on the bases of an ordered matroid M by using their external and internal activities. He also noted that when computing the Moebius function of these lattices, it was often zero, although he…

Combinatorics · Mathematics 2007-05-23 Rieuwert Blok , Bruce Sagan

It has been conjectured that the classical dynamics of M theory is equivalent to a null geodesic motion in the infinite-dimensional coset space E10/K(E10) where K(E10) is the maximal compact subgroup of the hyperbolic Kac-Moody group E10.…

High Energy Physics - Theory · Physics 2009-11-11 T. Damour , H. Nicolai

A well-known conjecture of Richard Stanley posits that the $h$-vector of the independence complex of a matroid is a pure ${\mathcal O}$-sequence. The conjecture has been established for various classes but is open for graphic matroids. A…

Combinatorics · Mathematics 2023-08-11 Preston Cranford , Anton Dochtermann , Evan Haithcock , Joshua Marsh , Suho Oh , Anna Truman

For a matroid $M$ of rank $r$ on $n$ elements, let $b(M)$ denote the fraction of bases of $M$ among the subsets of the ground set with cardinality $r$. We show that $$\Omega(1/n)\leq 1-b(M)\leq O(\log(n)^3/n)\text{ as }n\rightarrow \infty$$…

Combinatorics · Mathematics 2016-10-24 Rudi Pendavingh , Jorn van der Pol

Let $M_k$ be a $2n$-vertex graph with $n$ pairwise disjoint edges and let $\mathcal{H}^{(p,s)}(n)$ be the family of subsets of $V(M_n)$ that span exactly $p$ edges and $s$ isolated vertices. We prove that for $n\ge 2p+s$ this family has the…

Combinatorics · Mathematics 2024-07-25 Dániel T. Nagy

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

Tropical oriented matroids were defined by Ardila and Develin in 2007. They are a tropical analogue of classical oriented matroids in the sense that they encode the properties of the types of points in an arrangement of tropical hyperplanes…

Combinatorics · Mathematics 2012-12-11 Silke Horn

A structure of a complete lattice (in the sense of a poset) is defined on the underlying set of the orhtogonal group of a real Euclidean space, by a construction analogous to that of the weak order of a Coxeter system in terms of its root…

Group Theory · Mathematics 2011-10-21 Annette Pilkington

We compare classes of finite relational structures via monadic second-order transductions. More precisely, we study the preorder where we set C \subseteq K if, and only if, there exists a transduction {\tau} such that C\subseteq{\tau}(K).…

Logic · Mathematics 2015-07-01 Achim Blumensath , Bruno Courcelle

Let $\cX$ be a family of subsets of a finite set $E$. A matroid on $E$ is called an $\cX$-matroid if each set in $\cX$ is a circuit. We consider the problem of determining when there exists a unique maximal $\cX$-matroid in the weak order…

Combinatorics · Mathematics 2021-03-16 Bill Jackson , Shin-ichi Tanigawa

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

We establish strong vanishing theorems for line bundles on wonderful varieties of hyperplane arrangements, and we show that the resulting positivity properties of Euler characteristics extend to all matroids. We achieve this by showing that…

Algebraic Geometry · Mathematics 2025-10-08 Christopher Eur , Alex Fink , Matt Larson

This paper studies systems of polynomial equations that provide information about orientability of matroids. First, we study systems of linear equations over GF(2), originally alluded to by Bland and Jensen in their seminal paper on weak…

Combinatorics · Mathematics 2013-10-01 J. A. De Loera , J. Lee , S. Margulies , J. Miller

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…

Combinatorics · Mathematics 2025-04-22 Christin Bibby

Matroid bundles, introduced by MacPherson, are combinatorial analogues of real vector bundles. This paper sets up the foundations of matroid bundles, and defines a natural transformation from isomorphism classes of real vector bundles to…

Geometric Topology · Mathematics 2015-12-01 Laura Anderson , James F. Davis

In this paper, we establish two main results concerning the Mumford-Tate conjecture for hyper-K\"ahler varieties. First, we prove the conjecture for the semisimplified $\ell$-adic Galois representations attached to hyper-K\"ahler varieties…

Algebraic Geometry · Mathematics 2026-02-24 Zhichao Tang , Haitao Zou

A lattice path matroid is a transversal matroid for which some collection of incomparable intervals in some linear order on the ground set is a presentation. We characterize the minor-closed class of lattice path matroids by its excluded…

Combinatorics · Mathematics 2024-08-07 Joseph E. Bonin
‹ Prev 1 8 9 10 Next ›