Related papers: Software for the Thompson and Funk Polygonal Geome…
We explore the geometry behind the modular bootstrap and its image in the space of Taylor coefficients of the torus partition function. In the first part, we identify the geometry as an intersection of planes with the convex hull of moment…
We are concerned with the inverse scattering problem of extracting the geometric structures of an unknown/inaccessible inhomogeneous medium by using the corresponding acoustic far-field measurement. Using the intrinsic geometric properties…
In this paper, we introduce concepts of separable functions in balls and in the whole space, and develop a new method to investigate the qualitative properties of separable functions. We first study the axial symmetry and monotonicity of…
OSCAR is an innovative new computer algebra system which combines and extends the power of its four cornerstone systems - GAP (group theory), Singular (algebra and algebraic geometry), Polymake (polyhedral geometry), and Antic (number…
In this paper, a class of holomorphic invariant metrics is introduced on the irreducible classical domains of type I-IV, which are strongly pseudoconvex complex Finsler metrics in the strict sense of M. Abate and G. Patrizio[2]. These…
We introduce a class of functional analogs of the symmetric difference metric on the space of coercive convex functions on $\mathbb{R}^n$ with full-dimensional domain. We show that convergence with respect to these metrics is equivalent to…
This article is concerned with a geometric tool given by a pair of projector operators defined by almost product structures on finite dimensional manifolds, polarized by a distribution of constant rank and also endowed with some geometric…
In this note we give a short overview on symmetry exploiting techniques in three different branches of polyhedral computations: The representation conversion problem, integer linear programming and lattice point counting. We describe some…
In the present paper, we propose a novel generalization of the celebrated MMP algorithm in order to find the wavefront propagation and the cut-locus on a convex polyhedron with an emphasis on actual implementation for instantaneous…
Topological data analysis asks when balls in a metric space $(X,d)$ intersect. Geometric data analysis asks how much balls have to be enlarged to intersect. We connect this principle to the traditional core geometric concept of curvature.…
The work consists of solutions of metric problems for convex and finite subsets of geodesic spaces.
I present a Mathematica package designed for manipulations and evaluations of triple-K integrals and conformal correlation functions in momentum space. Additionally, the program provides tools for evaluation of a large class of 2- and…
We consider a system with a discrete configuration space. We show that the geometrical structures associated with such a system provide the tools necessary for a reconstruction of discrete quantum mechanics once dynamics is brought into the…
How much can randomness help computation? Motivated by this general question and by volume computation, one of the few instances where randomness provably helps, we analyze a notion of dispersion and connect it to asymptotic convex…
We describe the first-order variations of the angles of Euclidean, spherical or hyperbolic polygons under infinitesimal deformations such that the lengths of the edges do not change. Using this description, we introduce a vector-valued…
A wide array of image recovery problems can be abstracted into the problem of minimizing a sum of composite convex functions in a Hilbert space. To solve such problems, primal-dual proximal approaches have been developed which provide…
The purpose of this paper is to provide a set of sufficient conditions so that the normalized form of the Fox-Wright functions have certain geometric properties like close-to-convexity, univalency, convexity and starlikeness inside the unit…
We define quasiconvex programming, a form of generalized linear programming in which one seeks the point minimizing the pointwise maximum of a collection of quasiconvex functions. We survey algorithms for solving quasiconvex programs either…
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…
A finite-dimensional Hilbert space is usually described in terms of an orthonormal basis, but in certain approaches or applications a description in terms of a finite overcomplete system of vectors, called a finite tight frame, may offer…