English
Related papers

Related papers: Matchings in Matroids over Abelian Groups, III

200 papers

In recent years, various notions of algebraic independence have emerged as a central and unifying theme in a number of areas of applied mathematics, including algebraic statistics and the rigidity theory of bar-and-joint frameworks. In each…

Combinatorics · Mathematics 2019-01-08 Zvi Rosen , Jessica Sidman , Louis Theran

Matroid varieties are the closures in the Grassmannian of sets of points defined by specifying which Pl\"ucker coordinates vanish and which don't --- the set of nonvanishing Pl\"ucker coordinates forms a well-studied object called a…

Algebraic Geometry · Mathematics 2015-08-11 Nicolas Ford

The natural matroid of an integer polymatroid was introduced to show that a simple construction of integer polymatroids from matroids yields all integer polymatroids. As we illustrate, the natural matroid can shed much more light on integer…

Combinatorics · Mathematics 2024-08-07 Joseph E. Bonin , Carolyn Chun , Tara Fife

Using linear algebra methods we study certain algebraic properties of monomial rings and matroids. Let I be a monomial ideal in a polynomial ring over an arbitrary field. If the Rees cone of I is quasi-ideal, we express the normalization of…

Commutative Algebra · Mathematics 2011-04-05 Rafael H. Villarreal

In this paper we study a class of Riemannian metrics on the space of unparametrized curves and develop a method to compute geodesics with given boundary conditions. It extends previous works on this topic in several important ways. The…

Differential Geometry · Mathematics 2018-09-21 Martin Bauer , Martins Bruveris , Nicolas Charon , Jakob Møller-Andersen

Combinatorial gauge symmetry is a principle that allows us to construct lattice gauge theories with two key and distinguishing properties: a) only one- and two-body interactions are needed; and b) the symmetry is exact rather than emergent…

Strongly Correlated Electrons · Physics 2023-09-28 Hongji Yu , Dmitry Green , Andrei E. Ruckenstein , Claudio Chamon

In a recent paper Baker and Bowler introduced matroids over hyperfields, offering a common generalization of matroids, oriented matroids, and linear subspaces of based vector spaces. This paper introduces the notion of a topological…

Combinatorics · Mathematics 2018-11-06 James F. Davis , Laura Anderson

Consider a matroid where all elements are labeled with an element in $\mathbb{Z}$. We are interested in finding a base where the sum of the labels is congruent to $g \pmod m$. We show that this problem can be solved in $\tilde{O}(2^{4m} n…

Combinatorics · Mathematics 2024-03-22 Siyue Liu , Chao Xu

We construct two combinatorially equivalent line arrangements in the complex projective plane such that the fundamental groups of their complements are not isomorphic. The proof uses a new invariant of the fundamental group of the…

Algebraic Geometry · Mathematics 2015-07-08 Grigory Rybnikov

A topological mating is a map defined by gluing together the filled Julia sets of two quadratic polynomials. The identifications are visualized and understood by pinching ray-equivalence classes of the formal mating. For postcritically…

Dynamical Systems · Mathematics 2017-07-04 Wolf Jung

In this paper, we formulate and prove linear analogues of results concerning matchings in groups. A matching in a group G is a bijection f between two finite subsets A,B of G with the property, motivated by old questions on symmetric…

Number Theory · Mathematics 2012-08-15 Shalom Eliahou , Cedric Lecouvey

In this paper, we define locally matchable subsets of a group which is extracted from the concept of matchings in groups and used as a tool to give alternative proofs for existing results in matching theory. We also give the linear analogue…

Group Theory · Mathematics 2019-10-28 Mohsen Aliabadia , Mano Vikash Janardhanan

We introduce the notion of an arithmetic matroid, whose main example is given by a list of elements of a finitely generated abelian group. In particular we study the representability of its dual, providing an extension of the Gale duality…

Combinatorics · Mathematics 2011-07-26 Michele D'Adderio , Luca Moci

We give new characterizations for the class of uniformly dense matroids and study applications of these characterizations to graphic and real representable matroids. We show that a matroid is uniformly dense if and only if its base polytope…

Combinatorics · Mathematics 2026-02-03 Karel Devriendt , Raffaella Mulas

For a real oriented hyperplane arrangement, we show that the corresponding Salvetti complex is homotopy equivalent to the complement of the complexified arrangement. This result was originally proved by M. Salvetti. Our proof follows the…

Geometric Topology · Mathematics 2009-05-28 Dana C. Ernst

We investigate possible linear, algebraic, and Frobenius flock characteristic sets of matroids. In particular, we classify possible combinations of linear and algebraic characteristic sets when the algebraic characteristic set is finite or…

Combinatorics · Mathematics 2024-02-23 Dustin Cartwright , Dony Varghese

We prove that any degree $d$ rational map having a parabolic fixed point of multiplier $1$ with a fully invariant and simply connected immediate basin of attraction is mateable with the Hecke group $H_{d+1}$, with the mating realized by an…

Dynamical Systems · Mathematics 2026-03-25 Shaun Bullett , Luna Lomonaco , Mikhail Lyubich , Sabyasachi Mukherjee

There are two frameworks for mating Kleinian groups with rational maps on the Riemann sphere: the algebraic correspondence framework due to Bullett-Penrose-Lomonaco \cite{BP94,BL20} and the simultaneous uniformization mating framework of…

Dynamical Systems · Mathematics 2025-09-22 Mahan Mj , Sabyasachi Mukherjee

We introduce the notion of a quasi-matroidal class of ordered simplicial complexes: an approximation to the idea of a matroid cryptomorphism in the landscape of ordered simplicial complexes. A quasi-matroidal class contains pure shifted…

Combinatorics · Mathematics 2016-08-16 Jose Alejandro Samper

In this work we present an algorithm to construct sparse-paving matroids over finite set $S$. From this algorithm we derive some useful bounds on the cardinality of the set of circuits of any Sparse-Paving matroids which allow us to prove…

Combinatorics · Mathematics 2018-10-18 B. Mederos , M. Takane , G. Tapia-Sanchez , B. Zavala