Related papers: Generalized minimum distance functions
This paper studies the concept and the computation of approximately vanishing ideals of a finite set of data points. By data points, we mean that the points contain some uncertainty, which is a key motivation for the approximate treatment.…
We survey recent contributions to finite element exterior calculus on manifolds and surfaces within a comprehensive formalism for the error analysis of vector-valued partial differential equations on manifolds. Our primary focus is on…
Multivariate functions encountered in high-dimensional uncertainty quantification problems often vary most strongly along a few dominant directions in the input parameter space. We propose a gradient-based method for detecting these…
Let $R$ be a standard graded algebra over an infinite field $\mathbb{K}$ and $M$ a finitely generated $\ZZ$-graded $R$-module. Let $I_1,\ldots I_m$ be graded ideals of $R$. The functions $r(M/I_1^{a_1}\ldots I_m^{a_m}M)$ and…
We consider the problem of finding the isolated common roots of a set of polynomial functions defining a zero-dimensional ideal I in a ring R of polynomials over C. Normal form algorithms provide an algebraic approach to solve this problem.…
Let K be a finite field and let X* be an affine algebraic toric set parameterized by monomials. We give an algebraic method, using Groebner bases, to compute the length and the dimension of C_X*(d), the parameterized affine code of degree d…
In this paper we will estimate the main parameters of some evaluation codes which are known as projective parameterized codes. We will find the length of these codes and we will give a formula for the dimension in terms of the Hilbert…
We study the generalized roundness of finite metric spaces whose distance matrix $D$ has the property that every row of $D$ is a permutation of the first row. The analysis provides a way to characterize subsets of the Hamming cube $\{ 0, 1…
We introduce the notion of generalized function taking values in a smooth manifold into the setting of full Colombeau algebras. After deriving a number of characterization results we also introduce a corresponding concept of generalized…
Gaussian universality results assert that the properties of many estimators remain unchanged when the input data are replaced by Gaussians. Such results have gained popularity in high-dimensional statistics and machine learning, as…
A distance mean function measures the average distance of points from the elements of a given set of points (focal set) in the space. The level sets of a distance mean function are called generalized conics. In case of infinite focal points…
Let $\mathscr{A}$ be a finite set of closed rational points in projective space, let $\mathscr{I}$ be the vanishing ideal of $\mathscr{A}$, and let $\mathscr{D}(\mathscr{A})$ be the set of exponents of those monomials which do not occur as…
In this paper we introduce a new class of extremal codes, namely the $i$-BMD codes. We show that for this family several of the invariants are determined by the parameters of the underlying code. We refine and extend the notion of an…
We study the minimization of a convex function $f(X)$ over the set of $n\times n$ positive semi-definite matrices, but when the problem is recast as $\min_U g(U) := f(UU^\top)$, with $U \in \mathbb{R}^{n \times r}$ and $r \leq n$. We study…
Vanishing polynomials are polynomials over a ring which output $0$ for all elements in the ring. In this paper, we study the ideal of vanishing polynomials over specific types of rings, along with the closely related ring of polynomial…
We upper bound the number of common zeros over a finite grid of multivariate polynomials and an arbitrary finite collection of their consecutive Hasse derivatives (in a coordinate-wise sense). To that end, we make use of the tool from…
In this paper, we extend the Generalized Moving Least-Squares (GMLS) method in two different ways to solve the vector-valued PDEs on unknown smooth 2D manifolds without boundaries embedded in $\mathbb{R}^{3}$, identified with randomly…
In this paper we find the number of homogeneous polynomials of degree d such that they vanish on cuspidal modular forms of even weight $m\geq 2$ that form a basis for $S_m(\Gamma_0(N))$. We use these cuspidal forms to embedd $X_0(N)$ to…
We study a variant of the univariate approximate GCD problem, where the coefficients of one polynomial f(x)are known exactly, whereas the coefficients of the second polynomial g(x)may be perturbed. Our approach relies on the properties of…
Let $\mathbb K$ be a field of characteristic 0. Let $\Gamma\subset\mathbb P^n_{\mathbb K}$ be a reduced finite set of points, not all contained in a hyperplane. Let $hyp(\Gamma)$ be the maximum number of points of $\Gamma$ contained in any…