Related papers: Generalized Ellipsoids
A new version of the Graeffe algorithm for finding all the roots of univariate complex polynomials is proposed. It is obtained from the classical algorithm by a process analogous to renormalization of dynamical systems. This iteration is…
We present a novel parametric 3D shape representation, Generalized sum of Gaussians (G-SoG), which is particularly suitable for pose estimation of articulated objects. Compared with the original sum-of-Gaussians (SoG), G-SoG can handle both…
We study the Galois groups of polynomials arising from a compatible family of representations with big orthogonal monodromy. We show that the Galois groups are usually as large as possible given the constraints imposed on them by a…
For a family $\mathcal{C}$ of properly embedded curves in the 2-dimensional disk $\mathbb{D}^{2}$ satisfying certain uniqueness properties, we consider convex polygons $P\subset \mathbb{D}^{2}$ and define a metric $d$ on $P$ such that…
We announce two breakthrough results concerning important questions in the Theory of Computational Complexity. In this expository paper, a systematic and comprehensive geometric characterization of the Subset Sum Problem is presented. We…
A $d$-dimensional framework is a pair $(G,p)$, where $G=(V,E)$ is a graph and $p$ is a map from $V$ to $\mathbb{R}^d$. The length of an edge $uv\in E$ in $(G,p)$ is the distance between $p(u)$ and $p(v)$. The framework is said to be…
We study the cone of non-negative polynomials on generalized elliptic curves. We show that the zero set of every extreme ray has dense real points. If a generalized elliptic curve is embedded via a complete linear system, then we show that…
Let $\mathrm{R}$ be a real closed field and $\mathrm{D} \subset \mathrm{R}$ an ordered domain. We consider the algorithmic problem of computing the generalized Euler-Poincar\'e characteristic of real algebraic as well as semi-algebraic…
Abstract In this paper, we study affine bodies of revolution. This will allow us to prove that a convex body all whose orthogonal $n$-projections are affinely equivalent is an ellipsoid, provided $n\equiv 0,1, 2$ mod $4$, $n>1$ with the…
Symmetric edge polytopes are lattice polytopes associated with finite simple graphs that are of interest in both theory and applications. We investigate the facet structure of symmetric edge polytopes for various models of random graphs.…
We analyze rates of uniform convergence for a class of high-order semi-Lagrangian schemes for first-order, time-dependent partial differential equations on embedded submanifolds of $\mathbb{R}^d$ (including advection equations on surfaces)…
As a discrete counterpart to the classical John theorem on the approximation of (symmetric) $n$-dimensional convex bodies $K$ by ellipsoids, Tao and Vu introduced so called generalized arithmetic progressions $P(A,b)\subset Z^n$ in order to…
Many geometric optimization problems can be reduced to finding points in space (centers) minimizing an objective function which continuously depends on the distances from the centers to given input points. Examples are $k$-Means, Geometric…
We present a new $hp$-version space-time discontinuous Galerkin (dG) finite element method for the numerical approximation of parabolic evolution equations on general spatial meshes consisting of polygonal/polyhedral (polytopic) elements,…
This paper introduces and studies generalized degenerate Clifford and Lipschitz groups in geometric (Clifford) algebras. These Lie groups preserve the direct sums of the subspaces determined by the grade involution and reversion under the…
We describe new approaches for distances between pairs of 2-dimensional surfaces (embedded in 3-dimensional space) that use local structures and global information contained in inter-structure geometric relationships. We present algorithms…
Linear regression without correspondences is the problem of performing a linear regression fit to a dataset for which the correspondences between the independent samples and the observations are unknown. Such a problem naturally arises in…
We prove Gaussian approximation theorems for specific $k$-dimensional marginals of convex bodies which possess certain symmetries. In particular, we treat bodies which possess a 1-unconditional basis, as well as simplices. Our results…
We take a unifying and new approach toward polynomial and trigonometric approximation in an arbitrary number of variables, resulting in a precise and general ready-to-use tool that anyone can easily apply in new situations of interest. The…
A convex geometry is a closure system satisfying the anti-exchange property. This paper, following the work of Adaricheva and Bolat (2019) and the Polymath REU (2020), continues to investigate representations of convex geometries with small…