中文
相关论文

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

200 篇论文

We introduce a new criterion, the Rank Selection Criterion (RSC), for selecting the optimal reduced rank estimator of the coefficient matrix in multivariate response regression models. The corresponding RSC estimator minimizes the Frobenius…

统计理论 · 数学 2011-10-18 Florentina Bunea , Yiyuan She , Marten H. Wegkamp

We show that maximal $S$-free convex sets are polyhedra when $S$ is the set of integral points in some rational polyhedron of $\mathbb{R}^n$. This result extends a theorem of Lov\'asz characterizing maximal lattice-free convex sets. Our…

最优化与控制 · 数学 2017-01-24 Amitabh Basu , Michele Conforti , Gerard Cornuejols , Giacomo Zambelli

A sparse generic matrix is a matrix whose entries are distinct variables and zeros. Such matrices were studied by Giusti and Merle who computed some invariants of their ideals of maximal minors. In this paper we extend these results by…

交换代数 · 数学 2012-12-06 Adam Boocher

Let $I$ be a graded ideal of $K[x_1,\ldots,x_n]$ generated by homogeneous polynomials of a same degree $d$, and assume that $I$ has linear quotients. In this note, we use Horseshoe Lemma to give a relatively direct inductive construction of…

交换代数 · 数学 2016-10-04 A-Ming Liu , Tongsuo Wu

Let I be a complete m-primary ideal of a regular local ring (R,m). In the case where R has dimension two, the beautiful theory developed by Zariski implies that I factors uniquely as a product of powers of simple complete ideals and each of…

交换代数 · 数学 2014-04-08 William Heinzer , Mee-Kyoung Kim

Let X be a zero-dimensional scheme in P1 \times P1. Then X has a minimal free resolution of length 2 if and only if X is ACM. In this paper we determine a class of reduced schemes whose resolutions, similarly to the ACM case, can be…

代数几何 · 数学 2011-08-22 Paola Bonacini , Lucia Marino

This is the continuation of Montes' paper "On the canonical discussion of polynomial systems with parameters". In this paper we define the Minimal Canonical Comprehensive Groebner System (MCCGS) of a parametric ideal and fix under which…

交换代数 · 数学 2007-05-23 Antonio Montes , Montserrat Manubens

We give a short proof of an inequality, conjectured by Tsfasman and proved by Serre, for the maximum number of points on hypersurfaces over finite fields. Further, we consider a conjectural extension, due to Tsfasman and Boguslavsky, of…

代数几何 · 数学 2016-03-23 Mrinmoy Datta , Sudhir R. Ghorpade

We give an optimal in mixed (anisotropic) Strichartz type Lebesgue space-time norm estimates for the solution of linear parabolic inhomogeneous initial problem, with are exact or exact up to multiplicative constant coefficient evaluation.

偏微分方程分析 · 数学 2014-01-07 E. Ostrovsky , L. Sirota

We say that a subset of $\mathbb{P}^n(\mathbb{R})$ is maximally singular if its contains points with $\mathbb{Q}$-linearly independent homogenous coordinates whose uniform exponent of simultaneous rational approximation is equal to $1$, the…

数论 · 数学 2020-09-28 Anthony Poëls

We consider practical methods for the problem of finding a minimum-weight triangulation (MWT) of a planar point set, a classic problem of computational geometry with many applications. While Mulzer and Rote proved in 2006 that computing an…

计算几何 · 计算机科学 2018-02-20 Andreas Haas

We investigate the approximation of Monge--Kantorovich problems on general compact metric spaces, showing that optimal values, plans and maps can be effectively approximated via a fully discrete method. First we approximate optimal values…

数值分析 · 数学 2024-01-29 Maximiliano Frungillo

This paper outlines a novel extension of the classical Pontryagin minimum (maximum) principle to stochastic optimal control problems. Contrary to the well-known stochastic Pontryagin minimum principle involving forward-backward stochastic…

最优化与控制 · 数学 2026-05-11 Manfred Opper , Sebastian Reich

We generalize Buchsbaum and Eisenbud's resolutions for the powers of the maximal ideal of a polynomial ring to resolve powers of the homogeneous maximal ideal over graded Koszul algebras. Our approach has the advantage of producing…

Matrix rank minimization problems are gaining a plenty of recent attention in both mathematical and engineering fields. This class of problems, arising in various and across-discipline applications, is known to be NP-hard in general. In…

最优化与控制 · 数学 2010-10-06 Yun-Bin Zhao

A local convergence rate is established for an orthogonal collocation method based on Gauss quadrature applied to an unconstrained optimal control problem. If the continuous problem has a sufficiently smooth solution and the Hamiltonian…

最优化与控制 · 数学 2016-07-12 William W. Hager , Hongyan Hou , Anil V. Rao

Let $Q=k[x_1,..., x_n]$ be a polynomial ring over a field $k$ with the standard $N^n$-grading. Let $\phi$ be a morphism of finite free $N^n$-graded $Q$-modules. We translate to this setting several notions and constructions that appear…

交换代数 · 数学 2007-05-23 H. Charalambous , A. Tchernev

We give a complete conjectural formula for the number $e_r(d,m)$ of maximum possible ${\mathbb{F}}q$-rational points on a projective algebraic variety defined by $r$ linearly independent homogeneous polynomial equations of degree $d$ in…

代数几何 · 数学 2022-03-23 Peter Beelen , Mrinmoy Datta , Sudhir R. Ghorpade

In recent years, the combinatorial properties of monomials ideals and binomial ideals have been widely studied. In particular, combinatorial interpretations of free resolution algorithms have been given in both cases. In this present work,…

交换代数 · 数学 2014-10-06 Trevor McGuire

For many applications in signal processing and machine learning, we are tasked with minimizing a large sum of convex functions subject to a large number of convex constraints. In this paper, we devise a new random projection method (RPM) to…

最优化与控制 · 数学 2024-04-08 Zhichun Yang , Fu-quan Xia , Kai Tu , Man-Chung Yue