English
Related papers

Related papers: Topological obstructions for vertex numbers of Min…

200 papers

We observe some higher order Poincare-type inequalities on a closed manifold, which is inspired by Hurwitz's proof of the Wirtinger's inequality using Fourier theory. We then give some geometric implication of these inequalities by applying…

Differential Geometry · Mathematics 2021-03-22 Kwok-Kun Kwong

Given two points $p,q$ in the real plane, the signed area of the rectangle with the diagonal $[pq]$ equals the square of the Minkowski distance between the points $p,q$. We prove that $N>1$ points in the Minkowski plane $\R^{1,1}$ generate…

Combinatorics · Mathematics 2013-03-18 Oliver Roche-Newton , Misha Rudnev

We consider the problem of finding the set of permutations $r_j$ of $\{1,\cdots , n\}$ such that $\sum_{i=1}^n \prod_{j=1}^k r_j(i)$ is maximized or minimized. While the set of permutations maximizing this value are easily determined,…

Combinatorics · Mathematics 2020-03-03 Chai Wah Wu

We give a complete classification of torsion pairs in the cluster category of Dynkin type D_n, via a bijection to new combinatorial objects called Ptolemy diagrams of type D. For the latter we give along the way different combinatorial…

Representation Theory · Mathematics 2013-03-08 Thorsten Holm , Peter Jorgensen , Martin Rubey

An ordered $r$-matching is an $r$-uniform hypergraph matching equipped with an ordering on its vertices. These objects can be viewed as natural generalisations of $r$-dimensional orders. The theory of ordered 2-matchings is well-developed…

Combinatorics · Mathematics 2025-03-19 Michael Anastos , Zhihan Jin , Matthew Kwan , Benny Sudakov

We study the topology of the real algebraic hypersurfaces in $\mathbb{P}^n$ that can be constructed via combinatorial patchworking using triangulations that are dilations by two of other triangulations. By examining the real critical points…

Algebraic Geometry · Mathematics 2026-01-13 Aloïs Demory

Using equivariant topology, we prove that it is always possible to find $n$ points in the $d$-dimensional faces of a $nd$-dimensional convex polytope $P$ so that their center of mass is a target point in $P$. Equivalently, the $n$-fold…

Metric Geometry · Mathematics 2014-06-06 Michael Gene Dobbins

We introduce and study four optimization problems that generalize the well-known subset sum problem. Given a node-weighted digraph, select a subset of vertices whose total weight does not exceed a given budget. Some additional constraints…

Computational Complexity · Computer Science 2016-09-06 Laurent Gourvès , Jérôme Monnot , Lydia Tlilane

In this note, we study B{\'e}zout type inequalities for mixed volume and Minkowski sum of convex bodies in R n. We first give a new proof and we extend inequalities of Jian Xiao on mixed discriminants. Then, we use mass transport method to…

Metric Geometry · Mathematics 2024-03-20 Cheikh Saliou Ndiaye

We consider the interplay of point counts, singular cohomology, \'etale cohomology, eigenvalues of the Frobenius and the Grothendieck ring of varieties for two families of varieties: spaces of rational maps and moduli spaces of marked,…

Algebraic Geometry · Mathematics 2019-01-03 Benson Farb , Jesse Wolfson

We study the following problem: Given $k$ paths that share the same vertex set, is there a simultaneous geometric embedding of these paths such that each individual drawing is monotone in some direction? We prove that for any dimension $d…

Inspired by the classical Riemannian systolic inequality of Gromov we present a combinatorial analogue providing a lower bound on the number of vertices of a simplicial complex in terms of its edge-path systole. Similarly to the Riemannian…

Metric Geometry · Mathematics 2022-07-15 Sergey Avvakumov , Alexey Balitskiy , Alfredo Hubard , Roman Karasev

We solve the following problem of Z. F\"uredi, J. C. Lagarias and F. Morgan [FLM]: Is there an upper bound polynomial in $n$ for the largest cardinality of a set S of unit vectors in an n-dimensional Minkowski space (or Banach space) such…

Metric Geometry · Mathematics 2007-07-23 Konrad J Swanepoel

2-level polytopes naturally appear in several areas of pure and applied mathematics, including combinatorial optimization, polyhedral combinatorics, communication complexity, and statistics. In this paper, we present a study of some 2-level…

Combinatorics · Mathematics 2017-12-15 Manuel Aprile , Alfonso Cevallos , Yuri Faenza

Let $A_1,\ldots,A_n$ be finite subsets of an additive abelian group $G$ with $|A_1|=\cdots=|A_n|\ge2$. Concerning the two new kinds of restricted sumsets $$L(A_1,\ldots,A_n)=\{a_1+\cdots+a_n:\ a_1\in A_1,\ldots,a_n\in A_n,\ \text{and}\…

Number Theory · Mathematics 2022-10-24 Han Wang , Zhi-Wei Sun

We consider the problem of maximizing the sum of squares of the leading coefficients of polynomials $P_{i_1}(x),\ldots ,P_{i_m}(x)$ (where $P_j(x)$ is a polynomial of degree $j$) under the restriction that the sup-norm of $\sum_{j=1}^m…

Classical Analysis and ODEs · Mathematics 2009-09-25 Holger Dette

Signed Minkowski decomposition is an expression of a polytope as a Minkowski sum and difference of smaller polytopes. Signed Minkowski decompositions of a polytope can be interpreted as factorizations of a max-plus (tropical) function. We…

Combinatorics · Mathematics 2025-06-27 Soujun Kitagawa

In 2010, Vershik proposed a new combinatorial invariant of metric spaces given by a class of polytopes that arise in the theory of optimal transport and are called ``Wasserstein polytopes'' or ``Kantorovich-Rubinstein polytopes'' in the…

Combinatorics · Mathematics 2025-05-14 Emanuele Delucchi , Lukas Kühne , Leonie Mühlherr

We investigate specific intrinsic curvatures $\rho_k$ (where $1\leq k\leq n$) that interpolate between the minimum Ricci curvature $\rho_1$ and the normalized scalar curvature $\rho_n=\rho$ of $n$-dimensional Riemannian manifolds. For…

Differential Geometry · Mathematics 2025-02-24 C. -R. Onti , K. Polymerakis , Th. Vlachos

Motivated by the theorem of Gy\H ori and Lov\'asz, we consider the following problem. For a connected graph $G$ on $n$ vertices and $m$ edges determine the number $P(G,k)$ of unordered solutions of positive integers $\sum_{i=1}^k m_i = m$…

Combinatorics · Mathematics 2023-10-11 Yair Caro , Balázs Patkós , Zsolt Tuza , Máté Vizer