中文
相关论文

相关论文: The minimizers of the $p$-frame potential

200 篇论文

We develop a natural generalization of vector-valued frame theory, we term operator-valued frame theory, using operator-algebraic methods. This extends work of the second author and D. Han which can be viewed as the multiplicity one case…

泛函分析 · 数学 2007-07-24 Victor Kaftal , David Larson , Shuang Zhang

We prove a lower bound theorem for the number of $k$-faces ($1\le k\le d-2$) in a $d$-dimensional polytope $P$ (or $d$-polytope) with up to $3d-1$ vertices. Previous lower bound theorems for $d$-polytopes with few vertices concern those…

组合数学 · 数学 2025-12-09 Guillermo Pineda-Villavicencio , Jie Wang

Given a rational $a=p/q$ and $N$ nonnegative $d$-dimensional real vectors $u_1$, ..., $u_N$, we show that it is always possible to choose $(d-1)+\lceil (pN-d+1)/q\rceil$ of them such that their sum is (componentwise) at least…

组合数学 · 数学 2013-05-06 Ilya I. Bogdanov , Grigory R. Chelnokov

Let $P$ be a set of $n$ points in $\mathbb{R}^d$, in general position. We remove all of them one by one, in each step erasing one vertex of the convex hull of the current remaining set. Let $g_d(P)$ denote the number of different removal…

组合数学 · 数学 2024-11-15 Dániel Gábor Simon

This paper provides a unifying view of a wide range of problems of interest in machine learning by framing them as the minimization of functionals defined on the space of probability measures. In particular, we show that generative…

机器学习 · 计算机科学 2019-05-21 Casey Chu , Jose Blanchet , Peter Glynn

Given $n+1$ unit vectors in $\mathbf{R}^n$ or $\mathbf{C}^n,$ consider the absolute values of the determinants of the vectors taken $n$ at a time. By taking a geometric perspective, we show that the minimum of these determinants is…

度量几何 · 数学 2016-08-23 Mark Fincher

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…

计算复杂性 · 计算机科学 2013-07-25 Christian Knauer , Stefan König , Daniel Werner

We present a special-purpose algorithm for factoring semiprimes $N = pq$ in which one prime factor satisfies $p \approx c\,(a/b)^n$ for positive integers $a, b, c, n$ with $a > b$ and $\gcd(a,b) = 1$. Given the correct parameters $(a, b)$,…

数论 · 数学 2026-05-12 Sam Blake

We define a family of functionals, called p-oscillation functionals, that can be interpreted as discrete versions of the classical total variation functional for p=1 and of the p-Dirichlet functionals for p>1. We introduce the notion of…

偏微分方程分析 · 数学 2018-03-06 Annalisa Cesaroni , Serena Dipierro , Matteo Novaga , Enrico Valdinoci

In this manuscript we provide necessary and sufficient conditions for the $\textnormal{weak}(1,p)$ boundedness, $1< p<\infty,$ of discrete Fourier multipliers (Fourier multipliers on $\mathbb{Z}^n$). Our main goal is to apply the results…

泛函分析 · 数学 2019-01-23 Duván Cardona

This paper studies the relationship between the nuclear norm-regularized minimization problem, which minimizes the sum of a $C^2$ function $h$ and a positive multiple of the nuclear norm, denoted by $f$, and its factorized problem obtained…

最优化与控制 · 数学 2026-01-06 Wenqing Ouyang , Ting Kei Pong , Man-Chung Yue

For a field $\mathbb{F}$ and integers $d$ and $k$, a set of vectors of $\mathbb{F}^d$ is called $k$-nearly orthogonal if its members are non-self-orthogonal and every $k+1$ of them include an orthogonal pair. We prove that for every prime…

计算几何 · 计算机科学 2024-05-21 Dror Chawin , Ishay Haviv

In the subspace approximation problem, we seek a k-dimensional subspace F of R^d that minimizes the sum of p-th powers of Euclidean distances to a given set of n points a_1, ..., a_n in R^d, for p >= 1. More generally than minimizing sum_i…

数据结构与算法 · 计算机科学 2015-10-22 Kenneth L. Clarkson , David P. Woodruff

We present a new proof (based on spectral decomposition) of a bound originally proved by Sidelnikov~\, for the frame potentials $\sum_{ij} \left( {\bf P}_i \cdot {\bf P}_j \right)^\ell $ on a unit--sphere in $d$ dimensions. Sidelnikov's…

数学物理 · 物理学 2024-12-10 Paolo Amore , Ricardo A. Sáenz

A common optimization problem is the minimization of a symmetric positive definite quadratic form $< x,Tx >$ under linear constrains. The solution to this problem may be given using the Moore-Penrose inverse matrix. In this work we extend…

泛函分析 · 数学 2010-03-31 Dimitrios Pappas

It is known that random quantum channels exhibit significant violations of multiplicativity of maximum output p-norms for any p>1. In this work, we show that a weaker variant of multiplicativity nevertheless holds for these channels. For…

量子物理 · 物理学 2015-06-03 Ashley Montanaro

We have an $\m\x\n$ real-valued arbitrary matrix $A$ (e.g. a dictionary) with $\m<\n$ and data $d$ describing the sought-after object with the help of $A$. This work provides an in-depth analysis of the (local and global) minimizers of an…

数值分析 · 数学 2013-05-16 Mila Nikolova

We give a weak factorization proof of the Hardy space $H^{p}(\mathbb{R}^{n})$ in the multilinear setting, for $\frac{n}{n+1} < p <1$. As a consequence, we obtain a characterization of the boundedness of the commutator $[b,T]$ from…

经典分析与常微分方程 · 数学 2018-02-07 Marie-Jose S. Kuffner

We formulate a quantitative finite-dimensional conjecture about frame multipliers and prove that it is equivalent to Conjecture 1 in [SB2]. We then present solutions to the conjecture for certain classes of frame multipliers. In particular,…

泛函分析 · 数学 2022-12-05 Peter Balazs , Daniel Freeman , Roxana Popescu , Michael Speckbacher

Negative type inequalities arise in the study of embedding properties of metric spaces, but they often reduce to intractable combinatorial problems. In this paper we study more quantitative versions of these inequalities involving the…

度量几何 · 数学 2015-01-20 Ian Doust , Stephen Sánchez , Anthony Weston