English
Related papers

Related papers: A generalization of Filliman duality

200 papers

In this paper we generalize the classical Groebner basis technique to prove the existence and present a method of computation of a dimension polynomial in two variables associated with a finitely generated D-module, that is, a finitely…

Rings and Algebras · Mathematics 2012-12-11 Christian Dönch , Alexander Levin

For a d-dimensional convex lattice polytope P, a formula for the boundary volume is derived in terms of the number of boundary lattice points on the first $\floor{d/2}$ dilations of P. As an application we give a necessary and sufficient…

Combinatorics · Mathematics 2012-12-21 Gábor Hegedüs , Alexander M. Kasprzyk

Suppose we have a signal y which we wish to represent using a linear combination of a number of basis atoms a_i, y=sum_i x_i a_i = Ax. The problem of finding the minimum L0 norm representation for y is a hard problem. The Basis Pursuit (BP)…

Information Theory · Computer Science 2016-08-04 Mark D. Plumbley

Three results in p-convex geometry are established. First is the analogue of the Levi problem in several complex variables, namely: local p-convexity implies global p-convexity. The second asserts that the support of a minimal p-dimensional…

Differential Geometry · Mathematics 2017-12-12 F. Reese Harvey , H. Blaine Lawson

Let $\pi_1$ be a standard representation of $\mathrm{GL}_{n+1}(F)$ and let $\pi_2$ be the smooth dual of a standard representation of $\mathrm{GL}_n(F)$. When $F$ is non-Archimedean, we prove that $\mathrm{Ext}^i_{\mathrm{GL}_n(F)}(\pi_1,…

Representation Theory · Mathematics 2023-02-09 Kei Yuen Chan

We explore the extent to which the Fourier transform of an $L^p$ density supported on the sphere in $\mathbb{R}^n$ can have large mass on affine subspaces, placing particular emphasis on lines and hyperplanes. This involves establishing…

Classical Analysis and ODEs · Mathematics 2020-01-07 Jonathan Bennett , Shohei Nakamura

We show that the multivariate generating function of appropriately normalized moments of a measure with homogeneous polynomial density supported on a compact polytope P in R^d is a rational function. Its denominator is the product of linear…

Metric Geometry · Mathematics 2018-04-09 Nick Gravin , Dmitrii V. Pasechnik , Boris Shapiro , Michael Shapiro

Convex algebraic geometry concerns the interplay between optimization theory and real algebraic geometry. Its objects of study include convex semialgebraic sets that arise in semidefinite programming and from sums of squares. This article…

Optimization and Control · Mathematics 2010-06-28 Philipp Rostalski , Bernd Sturmfels

Plonka sums consist of an algebraic construction similar, in some sense to direct limits, which allows to represent classes of algebras defined by means of regular identities (namely those equations where the same set of variables appears…

Logic · Mathematics 2020-04-20 Stefano Bonzio

The algebra B of bicomplex numbers is viewed as a complexification of the Archimedean f-algebra of hyperbolic numbers D. This lattice-theoretic approach allows us to establish new properties of the so-called D-norms. In particular, we show…

Functional Analysis · Mathematics 2023-06-22 Hichem Gargoubi , Sayed Kossentini

We define an abstract regular polytope to be internally self-dual if its self-duality can be realized as one of its symmetries. This property has many interesting implications on the structure of the polytope, which we present here. Then,…

Group Theory · Mathematics 2016-10-11 Gabe Cunningham , Mark Mixer

A shape of a combinatorial polytope is a convex embedding into Euclidean space. We provide necessary and sufficient conditions for a piecewise linear map between two shapes of the same polytope to be a compression (respectively a weak…

Metric Geometry · Mathematics 2025-06-24 José Ayala , David Kirszenblat , J. Hyam Rubinstein

We study approximations of polytopes in the standard model for computing polytopes using Minkowski sums and (convex hulls of) unions. Specifically, we study the ability to approximate a target polytope by polytopes of a given depth. Our…

Metric Geometry · Mathematics 2025-07-11 Egor Bakaev , Florestan Brunck , Amir Yehudayoff

The Fourier transforms of polyhedral cones can be used, via Brion's theorem, to compute various geometric quantities of polytopes, such as volumes, moments, and lattice-point counts. We present a novel method of computing these conic…

Combinatorics · Mathematics 2018-08-02 Quang-Nhat Le

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…

Combinatorics · Mathematics 2011-04-07 Volker Kaibel

Consider a convex polygon P in the plane, and denote by U a homothetical copy of the vector sum of P and (-P). Then the polygon U, as unit ball, induces a norm such that, with respect to this norm, P has constant Minkowskian width. We…

Differential Geometry · Mathematics 2015-07-03 Marcos Craizer , Horst Martini

This note provides a simple proof for the equality between the normalized volume of a convex polytope with $m$ vertices and the mixed volume of $m$ simplices and thus shows the seemingly restrictive problem of computing mixed volume of…

Metric Geometry · Mathematics 2021-08-31 Tianran Chen

We develop a technique using dual mixed-volumes to study the isotropic constants of some classes of spaces. In particular, we recover, strengthen and generalize results of Ball and Junge concerning the isotropic constants of subspaces and…

Functional Analysis · Mathematics 2007-05-23 Emanuel Milman

We define two generalizations of the totally nonnegative Grassmannian and determine their topology in the case of real projective space. We find the spaces to be PL manifolds with boundary which are homotopy equivalent to another real…

Combinatorics · Mathematics 2023-04-28 John Machacek

The paper investigates the problem of performing correlation analysis when the number of observations is very large. In such a case, it is often necessary to combine the random observations to achieve dimensionality reduction of the…

Information Theory · Computer Science 2020-10-19 Pavel Loskot