English
Related papers

Related papers: From affine to barycentric coordinates in polytope…

200 papers

We compute the number of points over finite fields of some algebraic varieties related to cluster algebras of finite type. More precisely, these varieties are the fibers of the projection map from the cluster variety to the affine space of…

Quantum Algebra · Mathematics 2009-12-14 Frédéric Chapoton

The bottom complex of a finite polyhedal pointed rational cone is the lattice polytopal complex of the compact faces of the convex hull of nonzero lattice points in the cone. The algebra, associated to the bottom complex of a cone, defines…

Commutative Algebra · Mathematics 2022-06-09 Joseph Gubeladze

Given a real closed polytope $P$, we first describe the Fourier transform of its indicator function by using iterations of Stokes' theorem. We then use the ensuing Fourier transform formulations, together with the Poisson summation formula,…

Combinatorics · Mathematics 2018-08-02 Ricardo Diaz , Quang-Nhat Le , Sinai Robins

Conventional approximations to Bayesian inference rely on either approximations by statistics such as mean and covariance or by point particles. Recent advances such as the ensemble Gaussian mixture filter have generalized these notions to…

Optimization and Control · Mathematics 2025-04-10 Andrey A Popov

This article provides an overview of our joint work on binary polynomial optimization over the past decade. We define the multilinear polytope as the convex hull of the feasible region of a linearized binary polynomial optimization problem.…

Optimization and Control · Mathematics 2025-01-10 Alberto Del Pia , Aida Khajavirad

Given a finite set of lattice points, we compare its sumsets and lattice points in its dilated convex hulls. Both of these are known to grow as polynomials. Generally, the former are subsets of the latter. In this paper, we will see that…

Number Theory · Mathematics 2007-05-23 Jaewoo Lee

The problem of finding a vector with the fewest nonzero elements that satisfies an underdetermined system of linear equations is an NP-complete problem that is typically solved numerically via convex heuristics or nicely-behaved non convex…

Optimization and Control · Mathematics 2012-05-03 Heinz H. Bauschke , D. Russell Luke , Hung M. Phan , Xianfu Wang

We introduce suitable coordinate systems for pipes and their variants that allow us to transform partial differential equations (PDEs) on the pipe surfaces or in the solid pipes into computational domains with fixed limits/ranges. Such a…

Numerical Analysis · Mathematics 2025-09-09 Shuaifei Hu , Yujian Jiao , Desong Kong , Li-Lian Wang

Motivated by an error-correcting generalization of Bachet's weights problem, we define and classify relaxed complete partitions. We show that these partitions enjoy a succinct description in terms of lattice points in polyhedra, with…

Combinatorics · Mathematics 2014-01-09 Jorge Bruno , Edwin O'Shea

We introduce a new family of affine metrics on a locally strictly convex surface $M$ in affine 4-space. Then, we define the symmetric and antisymmetric equiaffine planes associated with each metric. We show that if $M$ is immersed in a…

Differential Geometry · Mathematics 2014-04-11 Juan J. Nuño Ballesteros , Luis Sánchez

It is known that discrete Painlev\'e equations have symmetries of the affine Weyl groups. In this paper we propose a new representation of discrete Painlev\'e equations in which the symmetries become clearly visible. We know how to obtain…

Exactly Solvable and Integrable Systems · Physics 2007-05-23 Mikio Murata

We consider the problem of finding the isolated common roots of a set of polynomial functions defining a zero-dimensional ideal I in a ring R of polynomials over C. We propose a general algebraic framework to find the solutions and to…

Algebraic Geometry · Mathematics 2017-11-15 Simon Telen , Bernard Mourrain , Marc Van Barel

A $d$-dimensional simplex in Euclidean space is called orthocentric if all of its altitudes intersect at a single point, referred to as the orthocenter. We explicitly compute the internal and external angles at all faces of an orthocentric…

Metric Geometry · Mathematics 2025-05-09 Zakhar Kabluchko , Philipp Schange

A novel approach is introduced to a very widely occurring problem, providing a complete, explicit resolution of it: minimisation of a convex quadratic under a general quadratic, equality or inequality, constraint. Completeness comes via…

Optimization and Control · Mathematics 2017-07-21 Casper Albers , Frank Critchley , John Gower

We derive upper and lower bounds on the gradients of Wachspress coordinates defined over any simple convex d-dimensional polytope P. The bounds are in terms of a single geometric quantity h_*, which denotes the minimum distance between a…

Numerical Analysis · Mathematics 2022-02-22 Michael Floater , Andrew Gillette , N. Sukumar

Projectivizations of pointed polyhedral cones $C$ are positive geometries in the sense of Arkani-Hamed, Bai, and Lam. Their canonical forms look like $$ \Omega_C(x)=\frac{A(x)}{B(x)} dx, $$ with $A,B$ polynomials. The denominator $B(x)$ is…

Combinatorics · Mathematics 2025-04-11 Christian Gaetz

We extend the Billera-Ehrenborg-Readdy map between the intersection lattice and face lattice of a central hyperplane arrangement to affine and toric hyperplane arrangements. For arrangements on the torus, we also generalize Zaslavsky's…

Combinatorics · Mathematics 2022-10-07 Richard Ehrenborg , Margaret Readdy , MLE Slone

In this paper, we study the distribution of integral points on parametric families of affine homogeneous varieties. By the work of Borel and Harish-Chandra, the set of integral points on each such variety consists of finitely many orbits of…

Dynamical Systems · Mathematics 2013-06-20 Alexander Gorodnik , Frédéric Paulin

We present a novel, general, and unifying point of view on sparse approaches to polynomial optimization. Solving polynomial optimization problems to global optimality is a ubiquitous challenge in many areas of science and engineering.…

Optimization and Control · Mathematics 2024-03-07 Gennadiy Averkov , Benjamin Peters , Sebastian Sager

In a d-simplex every facet is a (d-1)-simplex. We consider as generalized simplices other combinatorial classes of polytopes, all of whose facets are in the class. Cubes and multiplexes are two such classes of generalized simplices. In this…

Combinatorics · Mathematics 2007-05-23 Margaret M. Bayer , Tibor Bisztriczky
‹ Prev 1 8 9 10 Next ›