Related papers: Hilbert Functions of Chopped Ideals
Let $M$ be a finite module and let $I$ be an arbitrary ideal over a Noetherian local ring. We define the generalized Hilbert function of $I$ on $M$ using the 0th local cohomology functor. We show that our definition re-conciliates with that…
We consider the problem of separability: decide whether a Hermitian operator on a finite dimensional Hilbert tensor product is separable or entangled. We show that the tensor convolution defined for certain mappings on an almost arbitrary…
Ideals are used to define homological functors for additive categories. In abelian categories the ideals corresponding to the usual universal objects are principal, and the construction reduces, in a choice dependent way, to homology…
The idea of slicing divergences has been proven to be successful when comparing two probability measures in various machine learning applications including generative modeling, and consists in computing the expected value of a `base…
Let H_X be the trigraded Hilbert function of a set X of reduced points in P^1 x P^1 x P^1. We show how to extract some geometric information about X from H_X. This note generalizes a similar result of Giuffrida, Maggioni, and Ragusa about…
In this paper, we study different generalizations of the notion of squarefreeness for ideals to the more general case of modules. We describe the cones of Hilbert functions for squarefree modules in general and those generated in degree…
We study birational maps with empty base locus defined by almost complete intersection ideals. Birationality is shown to be expressed by the equality of two Chern numbers. We provide a relatively effective method of their calculation in…
The reduction algorithm is used to compute reduced ideals of a number field. However, there are reduced ideals that can never be obtained from this algorithm. In this paper, we will show that these ideals have inverses of larger norms among…
We consider determinantal ideals, where the generating minors are encoded in a hypergraph. We study when the generating minors form a Gr\"obner basis. In this case, the ideal is radical, and we can describe algebraic and numerical…
We study kernel functions, and associated reproducing kernel Hilbert spaces $\mathscr{H}$ over infinite, discrete and countable sets $V$. Numerical analysis builds discrete models (e.g., finite element) for the purpose of finding…
Let $(R, \mathcal{M})$ be a local ring over a field $k$ with $k = R/\mathcal M$ and $J$ an ideal in $R$ such that $A =R/J$ is an Artinian Gorenstein (AG) $k$-algebra. In 1989, A. Iarrobino introduced the symmetric decomposition of the…
We expand the basic geometric elements of the simplex method to linear programs in locally convex topological vector spaces and provide conditions under which the method converges in value to optimality. This setting generalizes many…
In this paper the turnpike property is established for a non-convex optimal control problem in discrete time. The functional is defined by the notion of the ideal convergence and can be considered as an analogue of the terminal functional…
Let $G$ be a simple graph on $n$ vertices, and let $J_G$ denotes the corresponding binomial edge ideal in $S=\mathbb{K}[x_1,\ldots,x_n,y_1,\ldots,y_n]$, where $\mathbb{K}$ is a field. We show that if a vertex satisfies a certain degree…
We describe a general approach for computing generators for elimination ideals associated with matrix and hypermatrix spectral decomposition constraints. We derive from these generators iterative procedures for approximating the spectral…
This paper focuses on estimating the Taylor coefficients for Hilbert spaces of holomorphic functions on the disk using intrinsic features of univalent functions and of Teichmuller spaces. Estimating these coefficients has a long history but…
It remains an open problem to classify the Hilbert functions of double points in $\mathbb{P}^2$. Given a valid Hilbert function $H$ of a zero-dimensional scheme in $\mathbb{P}^2$, we show how to construct a set of fat points $Z \subseteq…
We introduce a fixed point iteration process built on optimization of a linear function over a compact domain. We prove the process always converges to a fixed point and explore the set of fixed points in various convex sets. In particular,…
Let $X$ be an integral scheme of finite type over a complete DVR of mixed characteristic. We provide a definition of a test ideal which agrees with the multiplier ideal after inverting $p$, is computed from a sufficiently large alteration,…
This survey is an introduction to positive definite kernels and the set of methods they have inspired in the machine learning literature, namely kernel methods. We first discuss some properties of positive definite kernels as well as…