English
Related papers

Related papers: Estimating Maximum by Moments for Functions on Orb…

200 papers

This paper proves a bound for exponential sums over orbits of vectors in $\mathbb{F}_p^d$ under subgroups of $\rm{GL}_d(\mathbb{F}_p)$. The main tool is a classification theorem for approximate groups due to Gill, Helfgott, Pyber, and…

Number Theory · Mathematics 2016-08-24 Sarah Peluse

Peak estimation of hybrid systems aims to upper bound extreme values of a state function along trajectories, where this state function could be different in each subsystem. This finite-dimensional but nonconvex problem may be lifted into an…

Optimization and Control · Mathematics 2023-03-22 Jared Miller , Mario Sznaier

Given a finite-dimensional real inner product space V and a finite subgroup G of linear isometries, max filtering affords a bilipschitz Euclidean embedding of the orbit space V/G. We identify the max filtering maps of minimum distortion in…

Optimization and Control · Mathematics 2022-12-13 Dustin G. Mixon , Daniel Packer

A moment body is a linear projection of the spectraplex, the convex set of trace-one positive semidefinite matrices. Determining whether a given point lies within a given moment body is a problem with numerous applications in quantum state…

Optimization and Control · Mathematics 2025-07-04 Didier Henrion

The problem of maximizing the $p$-th power of a $p$-norm over a halfspace-presented polytope in $\R^d$ is a convex maximization problem which plays a fundamental role in computational convexity. It has been shown in 1986 that this problem…

Computational Complexity · Computer Science 2013-07-25 Christian Knauer , Stefan König , Daniel Werner

Finding the $r\times r$ submatrix of maximum volume of a matrix $A\in\mathbb R^{n\times n}$ is an NP hard problem that arises in a variety of applications. We propose a new greedy algorithm of cost $\mathcal O(n)$, for the case $A$…

Numerical Analysis · Mathematics 2021-04-05 Stefano Massei

We show that a simple geometric result suffices to derive the form of the optimal solution in a large class of finite and infinite-dimensional maximum entropy problems concerning probability distributions, spectral densities and covariance…

Optimization and Control · Mathematics 2012-12-24 Michele Pavon , Augusto Ferrante

Let $G$ be a locally compact group. Then for every $G$-space $X$ the maximal $G$-proximity $\beta_G$ can be characterized by the maximal topological proximity $\beta$ as follows: $$ A \ \overline{\beta_G} \ B \Leftrightarrow \exists V \in…

General Topology · Mathematics 2022-02-01 Michael Megrelishvili

We discuss the notion of optimal polynomial approximants in multivariable reproducing kernel Hilbert spaces. In particular, we analyze difficulties that arise in the multivariable case which are not present in one variable, for example, a…

Complex Variables · Mathematics 2022-05-03 Meredith Sargent , Alan Sola

We compute the mapping class group orbits in the homotopy set of framings of a compact connected oriented surface with non-empty boundary. In the case $g > 1$ the computation is some modification of Johnson's results and certain arguments…

Geometric Topology · Mathematics 2017-03-30 Nariya Kawazumi

We consider pairs of finitely presented, residually finite groups $P\hookrightarrow\G$ for which the induced map of profinite completions $\hat P\to \hat\G$ is an isomorphism. We prove that there is no algorithm that, given an arbitrary…

Group Theory · Mathematics 2008-10-03 Martin R. Bridson

Given a graph $G$, the NP-hard Maximum Planar Subgraph problem (MPS) asks for a planar subgraph of $G$ with the maximum number of edges. There are several heuristic, approximative, and exact algorithms to tackle the problem, but---to the…

Data Structures and Algorithms · Computer Science 2016-08-29 Markus Chimani , Karsten Klein , Tilo Wiedera

A perfect matching in an undirected graph $G=(V,E)$ is a set of vertex disjoint edges from $E$ that include all vertices in $V$. The perfect matching problem is to decide if $G$ has such a matching. Recently Rothvo{\ss} proved the striking…

Discrete Mathematics · Computer Science 2018-04-26 David Avis , David Bremner , Hans Raj Tiwary , Osamu Watanabe

Given an undirected bipartite graph $G=(A \cup B, E)$, a many-to-many matching (MM) in $G$ matches each vertex $v$ in $A$ (resp. $B$) to at least one vertex in $B$ (resp. $A$). In this paper, we consider the limited-capacity many-to-many…

Data Structures and Algorithms · Computer Science 2025-10-28 Fatemeh Rajabi-Alni , Behrouz Minaei-Bidgoli

Given a real inner product space $V$ and a group $G$ of linear isometries, we construct a family of $G$-invariant real-valued functions on $V$ that we call max filters. In the case where $V=\mathbb{R}^d$ and $G$ is finite, a suitable max…

Information Theory · Computer Science 2022-05-30 Jameson Cahill , Joseph W. Iverson , Dustin G. Mixon , Daniel Packer

The direct and inverse theorems are established for the best approximation in the weighted $L^p$ space on the unit sphere of $\RR^{d+1}$, in which the weight functions are invariant under finite reflection groups. The theorems are stated…

Classical Analysis and ODEs · Mathematics 2007-05-23 Yuan Xu

Let $X$ be a finite set in $Z^d$. We consider the problem of optimizing linear function $f(x) = c^T x$ on $X$, where $c\in Z^d$ is an input vector. We call it a problem $X$. A problem $X$ is related with linear program $\max\limits_{x \in…

Computational Complexity · Computer Science 2018-04-18 Aleksandr Maksimenko

We investigate geometric features of the unit ball corresponding to the sum of the nuclear norm of a matrix and the $l_1$ norm of its entries --- a common penalty function encouraging joint low rank and high sparsity. As a byproduct of this…

Optimization and Control · Mathematics 2014-01-21 D. Drusvyatskiy , S. A. Vavasis , H. Wolkowicz

We study quantitative criteria for evaluating the strength of valid inequalities for Gomory and Johnson's finite and infinite group models and we describe the valid inequalities that are optimal for these criteria. We justify and focus on…

Optimization and Control · Mathematics 2018-06-12 Amitabh Basu , Michele Conforti , Marco Di Summa , Giacomo Zambelli

We study orbit-finite systems of linear equations, in the setting of sets with atoms. Our principal contribution is a decision procedure for solvability of such systems. The procedure works for every field (and even commutative ring) under…

Computation and Language · Computer Science 2024-02-28 Arka Ghosh , Piotr Hofman , Sławomir Lasota