Related papers: Rang maximal pour $T_P^n$

This paper aims to find efficient solutions to a multi-objective optimization problem (MP) with convex polynomial data. To this end, a hybrid method, which allows us to transform problem (MP) into a scalar convex polynomial optimization…

We leverage the connections between nonexpansive maps, monotone Lipschitz operators, and proximal mappings to obtain near-optimal (i.e., optimal up to poly-log factors in terms of iteration complexity) and parameter-free methods for solving…

Let $(\mathcal{O}_n, \mathfrak{m})$ denote the ring of germs of holomorphic functions $\mathbb{C}^n\to \mathbb{C}$, and let $I\subseteq \mathcal{O}_n$ be an $\mathfrak{m}$-primary ideal. Demailly and Pham showed that $\mathrm{lct}(I) \geq…

In this paper we research all possible finite-dimensional representations and corresponding values of the Barbero-Immirzi parameter contained in EPRL simplicity constraints by using Naimark's fundamental theorem of the Lorentz group…

It is shown that the methods and algorithms, developed in (A. Capani et al., Computing minimal finite free resolutions, {\it Journal of Pure and Applied Algebra}, (117& 118)(1997), 105 -- 117; M. Kreuzer and L. Robbiano, {\it Computational…

If r\geq 6, r\neq 9, we show that the Minimal Resolution Conjecture fails for a general set of m points in P^r for almost 1/2\sqrt r values of m. This strengthens the result of Eisenbud and Popescu [1999], who found a unique such m for each…

We study the closure of the locus of radical ideals in the multigraded Hilbert scheme associated with a standard graded polynomial ring and the Hilbert function of a homogeneous coordinate ring of points in general position in projective…

This is an expository paper on the characterization of the even (or odd) smooth homogeneous convolution Calder\'on-Zygmund operators in R^n such that the maximal singular integral can be controlled in the L^2 norm by the singular integral.…

Call a monomial ideal M "generic" if no variable appears with the same nonzero exponent in two distinct monomial generators. Using a convex polytope first studied by Scarf, we obtain a minimal free resolution of M. Any monomial ideal M can…

Let $X$ be a complete simplicial toric variety over a finite field with a split torus $T_X$. For any matrix $Q$, we are interested in the subgroup $Y_Q$ of $T_X$ parameterized by the columns of $Q$. We give an algorithm for obtaining a…

We study the convex relaxation of a polynomial optimization problem, maximizing a product of linear forms over the complex sphere. We show that this convex program is also a relaxation of the permanent of Hermitian positive semidefinite…

In this paper we investigate the class of rigid monomial ideals. We give a characterization of the minimal free resolutions of certain classes of these ideals. Specifically, we show that the ideals in a particular subclass of rigid monomial…

In this paper, we study symmetry and existence of solutions of minimal gradient graph equations on punctured space $\mathbb R^n\setminus\{0\}$, which include the Monge-Amp\`ere equation, inverse harmonic Hessian equation and the special…

We consider the problem of finding the homogenization limit of oscillating linear elliptic equations on an arbitrary parallelizable manifold $(M,g,\Gamma)$. We replicate the concept of two-scale convergence by pulling back tensors $T$…

Any homogeneous harmonic polynomial can be decomposed as a sum of powers of isotropic linear forms, that is, linear forms whose coefficients are the coordinates of isotropic points. The minimum size of such decompositions for a harmonic…

We use the theory of poset resolutions to construct the minimal free resolution of an arbitrary stable monomial ideal in the polynomial ring whose coefficients are from a field. This resolution is recovered by utilizing a poset of…

In this paper we study minimal free resolutions of some classes of monomial ideals. we first give a sufficient condition to check the minimality of the resolution obtained by the mapping cone. Using it, we obtain the Betti numbers of…

Overdetermined systems of first kind integral equations appear in many applications. When the right-hand side is discretized, the resulting finite-data problem is ill-posed and admits infinitely many solutions. We propose a numerical method…

The main goal of this article is to provide a proof of the Pederson-Roy-Szpirglas theorem about counting common real zeros of real polynomial equations by using basic results from Linear algebra and Commutative algebra. The main tools are…

For the rank regularized minimization problem, we introduce several kinds of stationary points by the problem itself and its equivalent reformulations including the mathematical program with an equilibrium constraint (MPEC), the global…