English
Related papers

Related papers: The covariogram determines three-dimensional conve…

200 papers

The main result of this paper states that for any group $G$ with an automatic structure $L$ with unique representatives one can construct a uniform partial algorithm which detects $L$-rational subgroups and gives their preimages in $L$.…

Group Theory · Mathematics 2008-02-03 Ilya Kapovich

It is proved that for a symmetric convex body K in R^n, if for some tau > 0, |K cap (x+tau K)| depends on ||x||_K only, then K is an ellipsoid. As a part of the proof, smoothness properties of convolution bodies ls are studied.

Functional Analysis · Mathematics 2016-09-06 Mathieu Meyer , Shlomo Reisner , M. Schmuckenschlager

We formulate a generalization of the volume conjecture for planar graphs. Denoting by <G, c> the Kauffman bracket of the graph G whose edges are decorated by real "colors" c, the conjecture states that, under suitable conditions, certain…

Geometric Topology · Mathematics 2014-03-11 Francesco Costantino , François Guéritaud , Roland van der Veen

In an earlier paper, we studied solutions g to convolution equations of the form a_d*g^{*d}+a_{d-1}*g^{*(d-1)}+...+a_1*g+a_0=0, where a_0, ..., a_d are given arithmetic functions associated with Dirichlet series which converge on some right…

Functional Analysis · Mathematics 2007-12-20 Helge Glockner , Lutz G. Lucht , Stefan Porubsky

We study the two-dimensional geometric knapsack problem for convex polygons. Given a set of weighted convex polygons and a square knapsack, the goal is to select the most profitable subset of the given polygons that fits non-overlappingly…

Data Structures and Algorithms · Computer Science 2020-08-03 Arturo Merino , Andreas Wiese

Generalizing results by Valette, Zamfirescu and Laczkovich, we will prove that a convex body $K$ is a polytope if there are sufficiently many tilings which contain a tile similar to $K$. Furthermore, we give an example that this can not be…

Metric Geometry · Mathematics 2011-05-17 Karim Adiprasito

We describe an algorithm for determining whether two convex polytopes P and Q, embedded in a lattice, are isomorphic with respect to a lattice automorphism. We extend this to a method for determining if P and Q are equivalent, i.e. whether…

Combinatorics · Mathematics 2013-01-29 Roland Grinis , Alexander Kasprzyk

This paper was submitted to the Oberwolfach Conference "Combinatorial Convexity and Algebraic Geometry", October 1997. Let $M={\mathbb Z}^r$. For convex lattice polytopes $P,P'$ in ${\mathbb R}^r$, when is $(M \cap P)+ (M \cap P') = M \cap…

Algebraic Geometry · Mathematics 2008-12-09 Tadao Oda

We consider the question of determining the structure of the set of all $d$-dimensional vectors of the form $N^{-1}(1_A*1_{-A}(x_1), ..., 1_A*1_{-A}(x_d))$ for $A \subseteq \{1,...,N\}$, and also the set of all $(2N+1)^{-1}(1_B*1_B(x_1),…

Combinatorics · Mathematics 2023-11-06 Ernie Croot , Chi-Nuo Lee

Let $G$ be a connected reductive subgroup of a complex connected reductive group $\hat{G}$. Fix maximal tori and Borel subgroups of $G$ and $\hat{G}$. Consider the cone $LR^\circ(\hat{G},G)$ generated by the pairs $(\nu,\hat{\nu})$ of…

Algebraic Geometry · Mathematics 2015-05-13 Nicolas Ressayre

The cosmohedron was recently proposed as a polytope underlying the cosmological wavefunction for $\text{Tr}(\Phi^3)$ theory. Its faces were conjectured to be in bijection with Matryoshkas, which are obtained from a subdivision of a polygon…

Combinatorics · Mathematics 2026-03-23 Federico Ardila-Mantilla , Nima Arkani-Hamed , Carolina Figueiredo , Francisco Vazão

We study skew-orthogonal polynomials with respect to the weight function $\exp[-2V(x)]$, with $V(x)=\sum_{K=1}^{2d}(u_{K}/{K})x^{K}$, $u_{2d} > 0$, $d > 0$. A finite subsequence of such skew-orthogonal polynomials arising in the study of…

Mathematical Physics · Physics 2015-06-26 Saugata Ghosh

A Gelfand-Cetlin polytope is a convex polytope obtained as an image of certain completely integrable system on a partial flag variety. In this paper, we give an equivalent description of the face structure of a GC-polytope in terms of so…

Combinatorics · Mathematics 2021-01-11 Byung Hee An , Yunhyung Cho , Jang Soo Kim

We survey three settings in which dimensions of intersection cohomology groups of algebraic varieties provide deep combinatorial and representation-theoretic information, and computations of the groups themselves have been made using…

Algebraic Geometry · Mathematics 2026-01-14 Tom Braden , Nicholas Proudfoot

Let $X_1,\ldots,X_n$ be a standard normal sample in $\mathbb R^d$. We compute exactly the expected volume of the Gaussian polytope $\mathrm{conv}[X_1,\ldots,X_n]$, the symmetric Gaussian polytope $\mathrm{conv}[\pm X_1,\ldots,\pm X_n]$, and…

Probability · Mathematics 2017-06-27 Zakhar Kabluchko , Dmitry Zaporozhets

We study the connection between cyclic quasi-monotonicity and quasi-convexity, focusing on whether every cyclically quasi-monotone (possibly multivalued) map is included in the normal cone operator of a quasi-convex function, in analogy…

Optimization and Control · Mathematics 2025-09-12 Luigi De Pascale , Paul Pegon

In a previous paper, we showed how to use the Ehrhart function $L_P(s)$, defined by $L_P(s) = \#(sP \cap \mathbb Z^d)$, to reconstruct a polytope $P$. More specifically, we showed that, for rational polytopes $P$ and $Q$, if $L_{P + w}(s) =…

Combinatorics · Mathematics 2017-12-12 Tiago Royer

Recently, a combinatorial interpretation of Baldoni and Vergne's generalized Lidskii formula for the volume of a flow polytope was developed by Benedetti et al.. This converts the problem of computing Kostant partition functions into a…

Combinatorics · Mathematics 2019-10-23 Martha Yip

This paper constitutes a first step in the author's program to investigate the question of when a homotopy of 2-cocycles $\omega = \{\omega_t\}_{t \in [0,1]}$ on a locally compact Hausdorff groupoid $\mathcal{G}$ induces an isomorphism of…

Operator Algebras · Mathematics 2014-09-09 Elizabeth Gillaspy

We consider the computation of the volume of the union of high-dimensional geometric objects. While showing that this problem is #P-hard already for very simple bodies (i.e., axis-parallel boxes), we give a fast FPRAS for all objects where…

Computational Geometry · Computer Science 2010-06-09 Karl Bringmann , Tobias Friedrich
‹ Prev 1 8 9 10 Next ›