Related papers: Extremal functions for real convex bodies: simplic…
We give the complete list of possible torsion subgroups of elliptic curves with complex multiplication over number fields of degree 1-13. Additionally we describe the algorithm used to compute these torsion subgroups and its implementation.
We prove that for any given upper semicontinuous function $\varphi$ on an open subset $E$ of $\mathbb C^n\setminus\{0\}$, such that the complex cone generated by $E$ minus the origin is connected, the homogeneous Siciak-Zaharyuta function…
Given any finite graph, we offer a simple realization of the graph-associahedron polytope using integer coordinates.
In this paper, we derive new estimates for the remainder term of the midpoint, trapezoid, and Simpson formulae for functions whose derivatives in absolute value at certain power are h-convex and we point out the results for some special…
We write down estimates for the surface area, and more generally, integral mean curvatures of an ellipsoid E in n-dimensional Euclidean space in terms of the lengths of the major semi-axes. We give applications to estimating the area of…
A biconvex polytope is a classical and tropical convex hull of finitely many points. Given a biconvex polytope, for each vertex of it we construct a directed bigraph and a gammoid so that the collection of base polytopes of those gammoids…
We give two new upper bounds on the covering minima of convex bodies, depending on covering minima of certain projections and intersections with linear subspaces. We show one bound to be sharp for direct sums of two convex bodies,…
We develop approximations for the Riemann zeta function that enable high-precision computation within the critical strip and other vertical strips. These approximations combine the main sum of the Riemann-Siegel formula with a simple…
We present a simple algorithm for determining the extremal points in Euclidean space whose convex hull is the nth polytope in the sequence known as the multiplihedra. This answers the open question of whether the multiplihedra could be…
Extending classical results on polytopal approximation of convex bodies, we derive asymptotic formulas for the weighted approximation of smooth convex functions by piecewise affine convex functions as the number of their facets tends to…
This note wants to explain how to obtain meaningful pictures of (possibly high-dimensional) convex polytopes, triangulated manifolds, and other objects from the realm of geometric combinatorics such as tight spans of finite metric spaces…
We prove a sharp H\"older estimate for solutions of linear two-dimensional, divergence form elliptic equations with measurable coefficients, such that the matrix of the coefficients is symmetric and has {\em unit determinant}. Our result…
Our work explores fusions, the multidimensional counterparts of mean-preserving contractions and their extreme and exposed points. We reveal an elegant geometric/combinatorial structure for these objects. Of particular note is the…
We give real Jacobian elliptic function parametrizations for a genuinely asymmetric biquadratic curve where the variables and parameters are real.
In this paper we extend recent results of Fiorini et al. on the extension complexity of the cut polytope and related polyhedra. We first describe a lifting argument to show exponential extension complexity for a number of NP-complete…
We use "generalized" version of total variation, coarea formulas, isoperimetric inequalities to obtain sharp estimates for solutions (and for their gradients) to anisotropic elliptic equations with a lower order term, comparing them with…
Polytopes are the basic finite data structures for convex sets: they appear as feasible regions in linear optimization, as geometric summaries in algorithms, and as random objects in stochastic geometry. A natural geometric question is…
We give a sharp convexity estimate for L-functions which have a functional equation and an Euler product.
We present new computational results for symplectic monodromy groups of hypergeometric differential equations. In particular, we compute the arithmetic closure of each group, sometimes justifying arithmeticity. The results are obtained by…
An ordered hypergraph is a hypergraph whose vertex set is linearly ordered, and a convex geometric hypergraph is a hypergraph whose vertex set is cyclically ordered. Extremal problems for ordered and convex geometric graphs have a rich…