Related papers: Generalized minimum distance functions

In the last decade, the approximate vanishing ideal and its basis construction algorithms have been extensively studied in computer algebra and machine learning as a general model to reconstruct the algebraic variety on which noisy data…

This paper introduces the generalized forward-backward splitting algorithm for minimizing convex functions of the form $F + \sum_{i=1}^n G_i$, where $F$ has a Lipschitz-continuous gradient and the $G_i$'s are simple in the sense that their…

Let K be a finite field with q elements and let X be a subset of a projective space P^{s-1}, over the field K, which is parameterized by Laurent monomials. Let I(X) be the vanishing ideal of X. Some of the main contributions of this paper…

Explicit bases for the subfield subcodes of projective Reed-Muller codes over the projective plane and their duals are obtained. In particular, we provide a formula for the dimension of these codes. For the general case over the projective…

Let $R$ be a Cohen-Macaulay local ring of dimension $d$ with infinite residue field. Let $I$ be an $R$-ideal that has analytic spread $\ell(I)=d$, $G_d$ condition and the Artin-Nagata property $AN^-_{d-2}$. We provide a formula relating the…

The generalized Hamming weight (GHW) $d_r(C)$ of linear codes $C$ is a natural generalization of the minimum Hamming distance $d(C)(=d_1(C))$ and has become one of important research objects in coding theory since Wei's originary work [23]…

Motivated by conforming finite element methods for elliptic problems of second order, we analyze the approximation of the gradient of a target function by continuous piecewise polynomial functions over a simplicial mesh. The main result is…

We show that many important convex matrix functions can be represented as the partial infimal projection of the generalized matrix fractional (GMF) and a relatively simple convex function. This representation provides conditions under which…

We make use of a result of Hurwitz and Reznick, and a consequence of this result due to Fidalgo and Kovacec, to determine a new sufficient condition for a polynomial $f\in\mathbb{R}[X_1,...,X_n]$ of even degree to be a sum of squares. This…

We introduce a Hamming-type angular function $$\mathrm{angle}_H(u,v):= \min_{c \in \mathbb{F}_q^n} d_H(u, cv)$$ on pairs of nonzero vectors in $\mathbb{F}_q^n$ and show that it satisfies all three metric axioms up to scalar multiplication.…

This research focuses on analyzing the depth of generalized binomial edge ideals. We extend the notion of $d$-compatible map for the pairs of a complete graph and an arbitrary graph, and using it, we give a combinatorial lower bound for the…

Some properties of generalized convexity for sets and for functions are identified in case of the reliability polynomials of two dual minimal networks. A method of approximating the reliability polynomials of two dual minimal network is…

Let $(R,\mathfrak{m})$ be a $d$-dimensional Cohen-Macaulay local ring with infinite residue field. Let $I$ be an ideal of $R$ that has analytic spread $\ell(I)=d$, satisfies the $G_d$ condition, the weak Artin-Nagata property $AN_{d-2}^-$…

Let $f$ be a polynomial in $n$ variables $x_1,\dots,x_n$ with real coefficients. In [Ghasemi-Marshal], Ghasemi and Marshall give an algorithm, based on geometric programming, which computes a lower bound for $f$ on $\mathbb{R}^n$. In…

A theory of graded manifolds can be viewed as a generalization of differential geometry of smooth manifolds. It allows one to work with functions which locally depend not only on ordinary real variables, but also on $\mathbb{Z}$-graded…

Over fields of characteristic unequal to $2$, we can identify symmetric matrices with homogeneous polynomials of degree $2$. This allows us to view symmetric rank-metric codes as living inside the space of such polynomials. In this paper,…

Let $K$ be an infinite field and let $m_1,\ldots,m_n$ be a generalized arithmetic sequence of positive integers, i.e., there exist $h, d, m_1 \in\mathbb{Z}^+$ such that $m_i = h m_1 + (i-1)d$ for all $i \in \{2,\ldots,n\}$. We consider the…

Euclidean gradient descent algorithms barely capture the geometry of objective function-induced hypersurfaces and risk driving update trajectories off the hypersurfaces. Riemannian gradient descent algorithms address these issues but fail…

We present an extension of our GPGCD method, an iterative method for calculating approximate greatest common divisor (GCD) of univariate polynomials, to polynomials with the complex coefficients. For a given pair of polynomials and a…

Root separation bounds play an important role as a complexity measure in understanding the behaviour of various algorithms in computational algebra, e.g., root isolation algorithms. A classic result in the univariate setting is the…