Zobrazeno 1 - 10
of 464
pro vyhledávání: '"52B40"'
Autor:
Wang, Jidong
We introduce a notion of Lorentzian proper position in close analogy to proper position of stable polynomials. Using this notion, we give a new characterization of elementary quotients of M-convex function that parallels the Lorentzian characterizati
Externí odkaz:
http://arxiv.org/abs/2412.12059
We study the set of linear subspaces of a fixed dimension intersecting a given polytope. To describe this set as a semialgebraic subset of a Grassmannian, we introduce a Schubert arrangement of the polytope, defined by the Chow forms of the polytope'
Externí odkaz:
http://arxiv.org/abs/2412.00551
We study the equivariant cohomology classes of torus-equivariant subvarieties of the space of matrices. For a large class of torus actions, we prove that the polynomials representing these classes (up to suitably changing signs) are covolume polynomi
Externí odkaz:
http://arxiv.org/abs/2411.17572
This article introduces the theory of Veronese polytopes, a broad generalisation of cyclic polytopes. These arise as convex hulls of points on curves with one or more connected components, obtained as the image of the rational normal curve in affine
Externí odkaz:
http://arxiv.org/abs/2411.13702
Autor:
Rettenmayr, Stefan, Werner, Annette
We explore birational geometry of matroids by investigating automorphisms of their coarse Bergman fans. Combinatorial Cremona maps provide such automorphisms of Bergman fans which are not induced by matroid automorphisms. We investigate the structure
Externí odkaz:
http://arxiv.org/abs/2411.09987
Autor:
Esterov, Alexander, Voorhaar, Arina
Many (if not most) of convex polytopes, important for combinatorial and algebraic geometry, are closely related to secondary polytopes of point configurations, or base polytopes of submodular functions, or their numerous variations and generalization
Externí odkaz:
http://arxiv.org/abs/2411.02234
Autor:
Devriendt, Karel
This article introduces and studies a new class of graphs motivated by discrete curvature. We call a graph resistance nonnegative if there exists a distribution on its spanning trees such that every vertex has expected degree at most two in a random
Externí odkaz:
http://arxiv.org/abs/2410.07756
Autor:
McGinnis, Daniel
We prove a KKM-type theorem for matroid colored families of set coverings of a polytope. This generalizes Gale's colorful KKM theorem as well as recent sparse-colorful variants by Sober\'on, and McGinnis and Zerbib.
Externí odkaz:
http://arxiv.org/abs/2409.03026
Autor:
van der Hulst, Rolf, Walter, Matthias
Given a $\{0,1\}$-matrix $M$, the graph realization problem for $M$ asks if there exists a spanning forest such that the columns of $M$ are incidence vectors of paths in the forest. The problem is closely related to the recognition of network matrice
Externí odkaz:
http://arxiv.org/abs/2408.12869
Autor:
Pendavingh, Rudi
The {\em Dressian} of a matroid $M$ is the set of all valuations of $M$. This Dressian is the support of a polyhedral complex $\mathcal{Dr}(M)$ whose open cells correspond 1-1 with matroid subdivisions of the matroid polytope of $M$. We present upper
Externí odkaz:
http://arxiv.org/abs/2408.09466