English
Related papers

Related papers: Embedding simply connected 2-complexes in 3-space …

200 papers

Symanzik polynomials are defined on Feynman graphs and they are used in quantum field theory to compute Feynman amplitudes. They also appear in mathematics from different perspectives. For example, recent results show that they allow to…

Combinatorics · Mathematics 2024-01-22 Matthieu Piquerez

A recent line of research has concentrated on exploring the links between analytic and combinatorial theories of submodularity, uncovering several key connections between them. In this context, Lov\'asz initiated the study of matroids from…

Combinatorics · Mathematics 2024-10-16 Kristóf Bérczi , Márton Borbényi , László Lovász , László Márton Tóth

We give a correspondence between simple matroids and a reconstruction of Alfred North Whitehead's theory of dimension, as developed in "On Mathematical Concepts of the Material World" (1906). In brief, if a geometrical system in the…

Combinatorics · Mathematics 2026-04-28 Thomas Hales

We study paving matroids, their realization spaces, and their closures, along with matroid varieties and circuit varieties. Within this context, we introduce three distinct methods for generating polynomials within the associated ideals of…

Algebraic Geometry · Mathematics 2026-03-24 Emiliano Liwski , Fatemeh Mohammadi

This thesis is basically devoted to matroids -- fundamental structure of combinatorial optimization -- though some of our results concern simplicial complexes, or Euclidean spaces. We study old and new problems for these structures, with…

Combinatorics · Mathematics 2017-10-03 Michał Lasoń

We study metrics on two-dimensional simplicial complexes that are conformal either to flat Euclidean metrics or to the ideal hyperbolic metrics described by Charitos and Papadopoulos. Extending the results of our previous paper, we prove…

Differential Geometry · Mathematics 2021-10-26 Brian Freidin , Victoria Gras Andreu

We prove a duality theorem for simplicial complexes arising from a combinatorial construction we define, which applies to the squarefree monomial complexes for Veronese ideals of projective spaces and weighted projective spaces. Our theorem…

Commutative Algebra · Mathematics 2014-10-21 Stepan Paul

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…

Optimization and Control · Mathematics 2024-03-27 Steffen Borgwardt , Weston Grewe , Jon Lee

We give a new perspective of the relationship between simple matroids of rank 3 and pairwise balanced designs, connecting Wilson's theorems and tools with the theory of truncated boolean representable simplicial complexes. We also introduce…

Combinatorics · Mathematics 2019-04-09 Stuart W. Margolis , John Rhodes , Pedro Silva

We give a new proof of the fact that the complement of the complexification of a real hyperplane arrangement is homotopy equivalent to the Salvetti complex of the associated oriented matroid. Our proof involves no choices, is relatively…

Combinatorics · Mathematics 2025-07-10 Galen Dorpalen-Barry , Dan Dugger , Nicholas Proudfoot

Several tools have been developed to enhance automation of theorem proving in the 2D plane. However, in 3D, only a few approaches have been studied, and to our knowledge, nothing has been done in higher dimensions. In this paper, we present…

Computational Geometry · Computer Science 2022-01-04 Pascal Schreck , Nicolas Magaud , David Braun

The augmented Bergman complex of a matroid is a simplicial complex introduced recently in work of Braden, Huh, Matherne, Proudfoot and Wang. It may be viewed as a hybrid of two well-studied pure shellable simplicial complexes associated to…

This dissertation presents new results on three different themes all related to matroid polytopes. First we investigate properties of Ehrhart polynomials of matroid polytopes, independence matroid polytopes, and polymatroids. We prove that…

Combinatorics · Mathematics 2009-05-28 David C. Haws

We construct a combinatorial generalization of the Leray models for hyperplane arrangement complements. Given a matroid and some combinatorial blowup data, we give a presentation for a bigraded (commutative) differential-graded algebra. If…

Combinatorics · Mathematics 2022-03-30 Christin Bibby , Graham Denham , Eva Maria Feichtner

We introduce the intersection cohomology module of a matroid and prove that it satisfies Poincar\'e duality, the hard Lefschetz theorem, and the Hodge-Riemann relations. As applications, we obtain proofs of Dowling and Wilson's Top-Heavy…

Combinatorics · Mathematics 2023-04-11 Tom Braden , June Huh , Jacob P. Matherne , Nicholas Proudfoot , Botong Wang

I propose a scheme of constructing classical integrable models in 3+1 discrete dimensions, based on a relaxed version of the problem of factorizing a matrix into the product of four matrices of a special form.

solv-int · Physics 2007-05-23 I. G. Korepanov

Motivated by Kontsevich's graph complexes, this paper gives a systematic study of matroid complexes. We construct deletion and contraction bicomplexes on the vector space spanned by matroid classes equipped with ground-set orientations,…

Combinatorics · Mathematics 2026-05-26 Juliette Bruce , Jacob Bucciarelli , Bailee Zacovic

This paper is the second part of a two part paper which introduces the study of the Whitney Equisingularity of families of Symmetric determinantal singularities. This study reveals how to use the multiplicity of polar curves associated to a…

Algebraic Geometry · Mathematics 2021-03-05 Terence Gaffney , Michelle Molino

The Whitney module of a matroid is a natural analogue of the tensor algebra of the exterior algebra of a vector space that takes into account the dependencies of a matroid. In this paper we indicate the role that tableaux can play in…

Combinatorics · Mathematics 2010-06-17 Andrew Berget

A notion of branch-width, which generalizes the one known for graphs, can be defined for matroids. We first give a proof of the polynomial time model-checking of monadic second-order formulas on representable matroids of bounded…

Discrete Mathematics · Computer Science 2015-03-13 Yann Strozecki
‹ Prev 1 3 4 5 6 7 10 Next ›