Related papers: A matroid polytope approach to sharp affine isoper…
We study paving matroids, their realization spaces, and their closures, along with matroid varieties and circuit varieties. Within this context, we introduce three distinct methods for generating polynomials within the associated ideals of…
I extend the framework of rigid analytic geometry to the setting of algebraic geometry relative to monoids, and study the associated notions of separated, proper, and overconvergent morphisms. The category of affine manifolds embeds as a…
We present explicit representations in terms of hypergeometric functions for the scaling functions in the $C^0$ orthogonal multiresolution analyses associated with piecewise continuous polynomials. Closed formulas for the Mellin transform…
In this paper, it is shown that every polynomial function is mixed monotone globally with a polynomial decomposition function. For univariate polynomials, the decomposition functions can be constructed from the Gram matrix representation of…
We reinterpret the renormalized volume as the asymptotic difference of the isoperimetric profiles for convex co-compact hyperbolic 3-manifolds. By similar techniques we also prove a sharp Minkowski inequality for horospherically convex sets…
We consider two well-known problems: upper bounding the volume of lower dimensional ellipsoids contained in convex bodies given their John ellipsoid, and lower bounding the volume of ellipsoids containing projections of convex bodies given…
We give several unequivalent notions of convergency of meromorphic functions and more generally meromorphic mappings (strong, weak, $\Gamma $-convergency and some others). Relations between them are investigated. A version of Rouche theorem…
We study the interaction between two structures on the group of polynomial automorphisms of the affine plane: its structure as an amalgamated free product and as an infinite-dimensional algebraic variety. We introduce a new conjecture, and…
In this work, we introduce new families of nonconforming approximation methods for reconstructing functions on general polygonal meshes. These methods are defined using degrees of freedom based on weighted moments of orthogonal polynomials…
Matroid theory provides a unifying framework for studying dependence across combinatorics, geometry, and applications ranging from rigidity to statistics. In this work, we study circuit varieties of matroids, defined by their minimal…
The invariant polytope algorithm was a breakthrough in the joint spectral radius computation, allowing to find the exact value of the joint spectral radius for most matrix families~\cite{GP2013,GP2016}. This algorithm found many…
Although shape correspondence is a central problem in geometry processing, most methods for this task apply only to two-dimensional surfaces. The neglected task of volumetric correspondence--a natural extension relevant to shapes extracted…
We provide two algorithms for computing the volume of a convex polytope with half-space representation {x>=0; Ax <=b} for some (m,n) matrix A and some m-vector b. Both algorithms have a O(n^m) computational complexity which makes them…
In this paper, we propose a new type of matroids, namely covering matroids, and investigate the connections with the second type of covering-based rough sets and some existing special matroids. Firstly, as an extension of partitions,…
A method is presented for computing all the affine equivalences between two rational ruled surfaces defined by rational parametrizations that works directly in parametric rational form, i.e. without computing or making use of the implicit…
We observe that a large part of the volume of a hyperbolic polyhedron is taken by a tubular neighbourhood of its boundary, and use this to give a new proof for the finiteness of arithmetic maximal reflection groups following a recent work…
This paper develops a correspondence relating convex hulls of fractional functions with those of polynomial functions over the same domain. Using this result, we develop a number of new reformulations and relaxations for fractional…
In this paper we show how the superquadratic functions can be used as a tool for researching other types of convex functions like $\phi $-convexity, strong-convexity and uniform convexity. We show how to use inequalities satisfied by…
We develop an algorithmic theory of convex optimization over discrete sets. Using a combination of algebraic and geometric tools we are able to provide polynomial time algorithms for solving broad classes of convex combinatorial…
This paper studies geometric properties of the Iterated Matrix Multiplication polynomial and the hypersurface that it defines. We focus on geometric aspects that may be relevant for complexity theory such as the symmetry group of the…