English
Related papers

Related papers: Singular matroid realization spaces

200 papers

We find sharp absolute constants $C_1$ and $C_2$ with the following property: every well-rounded lattice of rank 3 in a Euclidean space has a minimal basis so that the solid angle spanned by these basis vectors lies in the interval…

Metric Geometry · Mathematics 2010-11-29 Lenny Fukshansky , Sinai Robins

We define a generic rigidity matroid for $k$-volumes of a simplicial complex in $\mathbb{R}^d$, and prove that for $2\leq k \leq d-1$ it has the same rank as the classical generic $d$-rigidity matroid on the same vertex set (namely, the…

Combinatorics · Mathematics 2025-03-04 Alan Lew , Eran Nevo , Yuval Peled , Orit E. Raz

Let $M$ be a matroid satisfying a matroidal analogue of the Cayley-Bacharach condition. Given a number $k \ge 2$, we show that there is no nontrivial bound on ranks of a $k$-tuple of flats covering the underlying set of $M$. This addresses…

Combinatorics · Mathematics 2022-11-15 Soohyun Park

This paper is a continuation of my paper "Lattices of flats for symplectic matroids". We explore geometric constructions originating from the lattice of flats of ranked symplectic matroids. We observe that a ranked symplectic matroid always…

Combinatorics · Mathematics 2026-01-08 Or Raz

For a complex elliptic curve $E$ and a point $p$ of order $n$ on it, the images of the points $p_k=kp$ under the Weierstrass embedding of $E$ into $\mathbb{C}\mathbb{P}^2$ are collinear if and only if the sum of indices is divisible by $n$.…

Algebraic Geometry · Mathematics 2024-04-09 Lev Borisov , Xavier Roulleau

Let G be a connected semisimple Lie group without compact factors whose real rank is at least 2, and let \Gamma \subset G be an irreducible lattice. We provide a C^\infty classification for volume-preserving Cartan actions of \Gamma and G.…

dg-ga · Mathematics 2008-02-03 Edward R. Goetze , Ralf J. Spatzier

Generalizing a theorem of the first two authors and Geelen for planes, we show that, for a real-representable matroid $M$, either the average hyperplane-size in $M$ is at most a constant depending only on its rank, or each hyperplane of $M$…

Combinatorics · Mathematics 2025-09-03 Rutger Campbell , Matthew E. Kroeker , Ben Lund

Let $(M^{n+1},g,e^{-f}d\mu)$ be a complete smooth metric measure space with $2\leq n\leq 6$ and Bakry-\'{E}mery Ricci curvature bounded below by a positive constant. We prove a smooth compactness theorem for the space of complete embedded…

Differential Geometry · Mathematics 2015-03-09 Ezequiel Barbosa , Ben Sharp , Yong Wei

In 1977 Stanley conjectured that the $h$-vector of a matroid independence complex is a pure $O$-sequence. In this paper we use lexicographic shellability for matroids to motivate a combinatorial strengthening of Stanley's conjecture. This…

Combinatorics · Mathematics 2014-06-10 Steven Klee , Jose Alejandro Samper

We study the complexity of testing if two given matroids are isomorphic. The problem is easily seen to be in $\Sigma_2^p$. In the case of linear matroids, which are represented over polynomially growing fields, we note that the problem is…

Computational Complexity · Computer Science 2008-11-25 Raghavendra Rao B. V. , Jayalal M. N. Sarma

We study completion of partial matrices with nonnegative entries to matrices of nonnegative rank at most $r$ for some $r \in \mathbb{N}$. Most of our results are for $r \leq 3$. We show that a partial matrix with nonnegative entries has a…

Metric Geometry · Mathematics 2026-01-13 Kaie Kubjas , Lilja Metsälampi

In this note, we generalize the technique developed in [13] and prove that every 5xn matrix of tropical rank at most 3 has Kapranov rank at most 3, for the ground field that contains at least 4 elements. For the ground field either F_2 or…

Combinatorics · Mathematics 2012-07-20 Yaroslav Shitov

This paper develops matroidal analogues of classical results on matchings in abelian groups. By embedding matroid ground sets in an abelian group, we introduce base matchings between matroid bases, recover the group-theoretic setting in the…

Combinatorics · Mathematics 2026-04-21 Mohsen Aliabadi , Elliot Krop

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…

Combinatorics · Mathematics 2012-09-26 Komei Fukuda , Hiroyuki Miyata , Sonoko Moriyama

We show that nilpotent matrices that yield the Schrodinger equation from its first order form encode the fingerprints of grand unified theories. We perform a rigorous search for all such nilpotent matrices and find that the resulting…

High Energy Physics - Phenomenology · Physics 2025-12-03 M. Adeel Ajaib

In this paper we study very smooth points of Banach spaces with special emphasis on spaces of operators. We show that when the space of compact operators is an $M$-ideal in the space of bounded operators, a very smooth operator $T$ attains…

Functional Analysis · Mathematics 2007-05-23 T. S. S. R. K. Rao

We study the differential and metric structures of the set of real square roots of a non-singular real matrix, under the assumption that the matrix and its square roots are semi-simple, or symmetric, or orthogonal.

Differential Geometry · Mathematics 2020-10-30 Alberto Dolcetti , Donato Pertici

A basis shape locus takes as input data a zero/nonzero pattern in an $n \times k$ matrix, which is equivalent to a presentation of a transversal matroid. The locus is defined as the set of points in the Grassmannian of $k$ planes in…

Combinatorics · Mathematics 2019-05-01 Cameron Marcott

We develop a theory of representations of (discrete) polymatroids over tracts in terms of Pl\"ucker coordinates and suitable Pl\"ucker relations. As special cases, we recover polymatroids themselves as polymatroid representations over the…

Combinatorics · Mathematics 2025-09-19 Matthew Baker , June Huh , Donggyu Kim , Mario Kummer , Oliver Lorscheid

We prove that the maximum size of a simple binary matroid of rank $r \geq 5$ with no AG(3,2)-minor is $\binom{r+1}{2}$ and characterise those matroids achieving this bound. When $r \geq 6$, the graphic matroid $M(K_{r+1})$ is the unique…

Combinatorics · Mathematics 2013-04-10 Joseph P. S. Kung , Dillon Mayhew , Irene Pivotto , Gordon F. Royle
‹ Prev 1 4 5 6 7 8 10 Next ›