English
Related papers

Related papers: Rang maximal pour $T_P^n$

200 papers

Given a set of inequalities determined by homogeneous forms, the following intertwined results are established: (1) the volume of the real semi-algebraic domain determined by these inequalities is explicitly determined; it is shown to be…

Number Theory · Mathematics 2023-06-01 Faustin Adiceam , Oscar Marmon

Let $R$ be a $d$-dimensional standard graded ring over an Artin local ring. Let $M$ be the unique maximal homogeneous ideal of $R.$ Let $h^i(R)_n$ denote the length of $H^i_M(R)_n$, i.e. the nth graded component of the ith local cohomology…

Commutative Algebra · Mathematics 2007-05-23 Clare D'Cruz , Vijay Kodiyalam , Jugal. K. Verma

We prove sharp estimates on the quadratic strand of the resolution of any homogeneous prime ideal in a standard graded polynomial ring over an arbitrary field. Our bounds only depend on the height of the prime ideal, and they are optimal…

Commutative Algebra · Mathematics 2026-05-12 Giulio Caviglia , Alessandro De Stefani

In this paper we will consider Rohde's general form of {1}-inverse of a matrix A. The necessary and sufficient condition for consistency of a linear system Ax=c will be represented. We will also be concerned with the minimal number of free…

Rings and Algebras · Mathematics 2013-07-23 Branko Malesevic , Ivana Jovovic , Milica Makragic , Biljana Radicic

In this paper we consider reduced homogeneous ideals $\Jcal\subset S$ of a polynomial ring $S$, having a 2-linear resolution. 1. We study systems of generators of $\Jcal\subset S$. 2. We compute the arithmetical rank for a large class of…

Commutative Algebra · Mathematics 2008-03-12 Marcel Morales

Let $k$ be a field of characteristic zero, and $R=k[x_1, \ldots, x_d]$ with $d \geq 3$ be a polynomial ring in $d$ variables. Let $\m=(x_1, \ldots, x_d)$ be the homogeneous maximal ideal of $R$. Let $\mathcal{K}$ be the kernel of the…

Commutative Algebra · Mathematics 2018-09-25 Sudeshna Roy

This article is devoted to the analysis of a Monte Carlo method to approximate effective coefficients in stochastic homogenization of discrete elliptic equations. We consider the case of independent and identically distributed coefficients,…

Probability · Mathematics 2013-07-23 Antoine Gloria , Jean-Christophe Mourrat

We study the Heilbronn triangle problem, which involves placing n points in the unit square such that the minimum area of any triangle formed by these points is maximized. A straightforward maximin formulation of this problem is highly…

Computational Geometry · Computer Science 2025-12-17 Amirhossein Monji , Amirali Modir , Burak Kocuk

We consider the variant of stochastic homogenization theory introduced in [X. Blanc, C. Le Bris and P.-L. Lions, C. R. Acad. Sci. Serie I 2006 and Journal de Mathematiques Pures et Appliquees 2007]. The equation under consideration is a…

Analysis of PDEs · Mathematics 2019-02-20 Frederic Legoll , Florian Thomines

The purpose of this paper is to prove that the symbolic Rees rings of ideals defining certain finite sets of points in the projective plane over an algebraically closed field are finitely generated using a ring theoretical criterion which…

Commutative Algebra · Mathematics 2020-08-19 Keisuke Kai , Koji Nishida

For an ideal $I\subseteq\mathbb{R}[x]$ given by a set of generators, a new semidefinite characterization of its real radical $I(V_\mathbb{R}(I))$ is presented, provided it is zero-dimensional (even if $I$ is not). Moreover we propose an…

Algebraic Geometry · Mathematics 2018-11-20 J. B. Lasserre , M. Laurent , P. Rostalski

Let $I$ be a monomial ideal in two variables generated by three monomials and let $\mathcal{R}(I)$ be its Rees ideal. We describe an algorithm to compute the minimal generating set of $\mathcal{R}(I)$. Based on the data obtained by this…

Commutative Algebra · Mathematics 2024-01-23 Rodrigo Iglesias , Matthias Orth , Eduardo Sáenz-de-Cabezón , Werner M. Seiler

In recent studies, the tensor ring (TR) rank has shown high effectiveness in tensor completion due to its ability of capturing the intrinsic structure within high-order tensors. A recently proposed TR rank minimization method is based on…

Computer Vision and Pattern Recognition · Computer Science 2020-05-21 Meng Ding , Ting-Zhu Huang , Xi-Le Zhao , Tian-Hui Ma

We study the linkage classes of homogeneous ideals in polynomial rings. An ideal is said to be homogeneously licci if it can be linked to a complete intersection using only homogeneous regular sequences at each step. We ask a natural…

Commutative Algebra · Mathematics 2007-08-27 Craig Huneke , Juan Migliore , Uwe Nagel , Bernd Ulrich

This note demonstrates that we can stably recover all symmetric Toeplitz matrices $\pmb{X}_0\in\mathbb{R}^{n\times n}$ of rank at most $r$ from a number of rank-one subgaussian measurements on the order of $r\log^{2} n$ with an…

Information Theory · Computer Science 2026-05-19 Gao Huang , Song Li

We study the complexity of solving the \emph{generalized MinRank problem}, i.e. computing the set of points where the evaluation of a polynomial matrix has rank at most $r$. A natural algebraic representation of this problem gives rise to a…

Symbolic Computation · Computer Science 2015-03-19 Jean-Charles Faugère , Mohab Safey El Din , Pierre-Jean Spaenlehauer

We establish Maximum Principles which apply to vectorial approximate minimizers of the general integral functional of Calculus of Variations. Our main result is a version of the Convex Hull Property. The primary advance compared to results…

Analysis of PDEs · Mathematics 2013-04-22 Nikolaos I. Katzourakis

We are concerned with the dependence of the lowest positive eigenvalue of the Dirac operator on the geometry of rectangles, subject to infinite-mass boundary conditions. We conjecture that the square is a global minimiser both under the…

Spectral Theory · Mathematics 2022-08-22 Philippe Briet , David Krejcirik

In many applications that require matrix solutions of minimal rank, the underlying cost function is non-convex leading to an intractable, NP-hard optimization problem. Consequently, the convex nuclear norm is frequently used as a surrogate…

Machine Learning · Computer Science 2014-08-12 David Wipf

In many applications that require matrix solutions of minimal rank, the underlying cost function is non-convex leading to an intractable, NP-hard optimization problem. Consequently, the convex nuclear norm is frequently used as a surrogate…

Machine Learning · Statistics 2012-07-11 David Wipf