中文
相关论文

相关论文: Rang maximal pour $T_P^n$

200 篇论文

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…

最优化与控制 · 数学 2012-12-24 Michele Pavon , Augusto Ferrante

We study the fluctuations of random surfaces on a two-dimensional discrete torus. The random surfaces we consider are defined via a nearest-neighbor pair potential which we require to be twice continuously differentiable on a (possibly…

概率论 · 数学 2016-08-08 Piotr Miłoś , Ron Peled

We estimate the growth rate of the function which counts the number of torsion points of order at most $T$ on an algebraic subvariety of the algebraic torus $\mathbb G_m^n$ over some algebraically closed field. We prove a general upper…

数论 · 数学 2022-09-26 Gerold Schefer

We prove a universal mesoscopic central limit theorem for linear eigenvalue statistics of a Wigner-type matrix inside the bulk of the spectrum with compactly supported twice continuously differentiable test functions. The main novel…

概率论 · 数学 2023-01-05 Volodymyr Riabov

The standard well-known Remez inequality gives an upper estimate of the values of polynomials on $[-1,1]$ if they are bounded by $1$ on a subset of $[-1,1]$ of fixed Lebesgue measure. The extremal solution is given by the rescaled Chebyshev…

经典分析与常微分方程 · 数学 2020-07-06 B. Eichinger , P. Yuditskii

In this paper, we establish a min-max theory for constructing minimal disks with free boundary in any closed Riemannian manifold. The main result is an effective version of the partial Morse theory for minimal disks with free boundary…

偏微分方程分析 · 数学 2020-04-01 Longzhi Lin , Ao Sun , Xin Zhou

Given a compact parameter set $Y\subset R^p$, we consider polynomial optimization problems $(P_y$) on $R^n$ whose description depends on the parameter $y\inY$. We assume that one can compute all moments of some probability measure $\phi$ on…

最优化与控制 · 数学 2009-05-18 Jean B. Lasserre

We construct a class of Gorenstein local rings $R$ which admit minimal complete $R$-free resolutions $\bd C$ such that the sequence $\{\rank_R C_i\}$ is constant for $i< 0$, and grows exponentially for all $i>0$. Over these rings we show…

交换代数 · 数学 2007-05-23 David A. Jorgensen , Liana M. Sega

In numerical analysis it is often necessary to estimate the condition number $CN(T)=||T||_{} \cdot||T^{-1}||_{}$ and the norm of the resolvent $||(\zeta-T)^{-1}||_{}$ of a given $n\times n$ matrix $T$. We derive new spectral estimates for…

数值分析 · 数学 2018-02-27 Oleg Szehr , Rachid Zarouf

Let $R=k[x,y,z]$ be a standard graded $3$-variable polynomial ring, where $k$ denotes any field. We study grade $3$ homogeneous ideals $I \subseteq R$ defining compressed rings with socle $k(-s)^{\ell} \oplus k(-2s+1)$, where $s \geq3$ and…

交换代数 · 数学 2021-05-28 Keller VandeBogert

We consider the class of mathematical programs with orthogonality type constraints (MPOC). Orthogonality type constraints appear by reformulating the sparsity constraint via auxiliary binary variables and relaxing them afterwards. For MPOC…

最优化与控制 · 数学 2021-10-25 Sebastian Lämmel , Vladimir Shikhman

A parametric spectral estimation problem in the style of Byrnes, Georgiou, and Lindquist was posed in \cite{FPZ-10}, but the existence of a solution was only proved in a special case. Based on their results, we show that a solution indeed…

统计理论 · 数学 2019-08-08 Bin Zhu , Giacomo Baggio

We compute the linear strand of the minimal free resolution of the ideal generated by k x k sub-permanents of an n x n generic matrix and of the ideal generated by square-free monomials of degree k. The latter calculation gives the full…

计算复杂性 · 计算机科学 2017-12-05 Klim Efremenko , J. M. Landsberg , Hal Schenck , Jerzy Weyman

In this work we solve, for given bounded operators $B,C$ and Hilbert-Schmidt operator $M$ acting on potentially infinite-dimensional separable Hilbert spaces, the reduced rank approximation problem, $\min\{\lVert M-BXC\rVert_{L_2}:\…

泛函分析 · 数学 2026-05-27 Giuseppe Carere , Han Cheng Lie

We consider the problem of minimizing a continuous function f over a compact set K. We analyze a hierarchy of upper bounds proposed by Lasserre in [SIAM J. Optim. 21(3) (2011), pp. 864--885], obtained by searching for an optimal probability…

最优化与控制 · 数学 2015-09-09 Etienne de Klerk , Monique Laurent , Zhao Sun

We present an essentially complete solution to the Minimal Resolution Conjecture for general curves, determining the shape of the minimal resolution of general sets of points on a general curve C of degree d>2r-1 in P^r. Our methods also…

代数几何 · 数学 2024-01-15 Gavril Farkas , Eric Larson

The main goal of this paper is to relate the topologically relevant stationary points of a cardinality-constrained optimization problem and its continuous reformulation up to their type. For that, we focus on the nondegenerate M- and…

最优化与控制 · 数学 2022-12-29 Sebastian Lämmel , Vladimir Shikhman

Using the matrix product state (MPS) representation of the recently proposed tensor ring decompositions, in this paper we propose a tensor completion algorithm, which is an alternating minimization algorithm that alternates over the factors…

机器学习 · 计算机科学 2017-07-27 Wenqi Wang , Vaneet Aggarwal , Shuchin Aeron

Let $M_n$ be an $n \times n$ random matrix with i.i.d. sparse discrete entries. In this paper, we develop a simple framework to solve the approximate Spielman-Teng theorem for $M_n$, which has the following form: There exist constants $C,…

概率论 · 数学 2025-07-24 Kexin Yu

We relate the problem of best low-rank approximation in the spectral norm for a matrix $A$ to Kolmogorov $n$-widths and corresponding optimal spaces. We characterize all the optimal spaces for the image of the Euclidean unit ball under $A$…

数值分析 · 数学 2021-05-25 Michael S. Floater , Carla Manni , Espen Sande , Hendrik Speleers
‹ 上一页 1 8 9 10 下一页 ›