Related papers: Abstract tubes associated with perturbed polyhedra…
Arithmetic automata recognize infinite words of digits denoting decompositions of real and integer vectors. These automata are known expressive and efficient enough to represent the whole set of solutions of complex linear constraints…
This paper surveys recent contructions in higher Auslander--Reiten theory. We focus on those which, due to their combinatorial properties, can be regarded as higher dimensional analogues of path algebras of linearly oriented type…
After a recollection on compression through a projection onto a polyhedral set (which generalizes the compression by coordinates quantization), we express, in this framework, the probability that an image is coded with $K$ coefficients as…
The composite $L_q~(0<q<1)$ minimization problem over a general polyhedron has received various applications in machine learning, wireless communications, image restoration, signal reconstruction, etc. This paper aims to provide a…
The implementation of reliable and efficient geometric algorithms is a challenging task. The reason is the following conflict: On the one hand, computing with rounded arithmetic may question the reliability of programs while, on the other…
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…
In the paper the foundation of the $k$-orbit theory is developed. The theory opens a new simple way to the investigation of groups and multidimensional symmetries. The relations between combinatorial symmetry properties of a $k$-orbit and…
The concept of representing a polytope that is associated with some combinatorial optimization problem as a linear projection of a higher-dimensional polyhedron has recently received increasing attention. In this paper (written for the…
We show that the closed convex hull of any one-dimensional semi-algebraic subset of R^n has a semidefinite representation, meaning that it can be written as a linear projection of the solution set of some linear matrix inequality. This is…
We suggest a method of computing volume for a simple polytope $P$ in three-dimensional hyperbolic space $\mathbb{H}^3$. This method combines the combinatorial reduction of $P$ as a trivalent graph $\Gamma$ (the $1$-skeleton of $P$) by…
Let $M$ be a representation of an acyclic quiver $Q$ over an infinite field $k$. We establish a deterministic algorithm for computing the Harder-Narasimhan filtration of $M$. The algorithm is polynomial in the dimensions of $M$, the weights…
We study approximations of smooth convex bodies by random ball-polytopes. We examine the following probability model: let $K\subset{\bf R}^d$ be a convex body such that $K$ slides freely in a ball of radius $R>0$ and has $C^2$ smooth…
Polyhedra and spectrahedra over the real numbers, or more generally their images under linear maps, are respectively the feasible sets of linear and semidefinite programming, and form the family of semidefinite-representable sets. This…
Crawley-Boevey and Shaw recently introduced a certain multiplicative analogue of the deformed preprojective algebra, which they called the multiplicative preprojective algebra. In this paper we study the moduli space of (semi)stable…
It is important to design separation algorithms of low computational complexity in mixed integer programming. We study the separation problems of the two continuous knapsack polyhedra with divisible capacities. The two polyhedra are the…
Harmonic analysis on Hermitian symmetric spaces of tube type is a natural framework for introducing multivariate Meixner-Pollaczek polynomials. Their main properties are established in this setting: generating and determinantal formulae,…
We discuss the cone and contraction theorem in a suitable complex analytic setting. More precisely, we establish the cone and contraction theorem of normal pairs for projective morphisms between complex analytic spaces. This result is a…
We observe that the characteristic polynomial of a linearly perturbed semidefinite matrix can be used to give the convergence rate of alternating projections for the positive semidefinite cone and a line. As a consequence, we show that such…
We consider the quantum inverse scattering method for several mixed integrable models based on the rational SU(N) R-matrix with general toroidal boundary conditions. This includes systems whose Hilbert spaces are invariant by the discrete…
We devise a {\sl non--perturbative} method, called {\sl Parametric Perturbation Theory} (PPT), which is alternative to the ordinary perturbation theory. The method relies on a principle of simplicity for the observable solutions, which are…