Related papers: The close relation between border and Pommaret mar…
We define a new type of ideal basis called the proper basis that improves both Gr\"obner basis and Buchberger's algorithm. Let $x_1$ be the least variable of a monomial ordering in a polynomial ring $K[x_1,\dotsc,x_n]$ over a field $K$. The…
Let $\mathcal{O}_K$ be the ring of integers of an algebraic number field $K$ embedded into $\mathbb{C}$. Let $X$ be a subset of the Euclidean space $\mathbb{R}^d$, and $D(X)$ be the set of the squared distances of two distinct points in…
We propose new structures called almost o-minimal structures and $\mathfrak X$-structures. The former is a first-order expansion of a dense linear order without endpoints such that the intersection of a definable set with a bounded open…
We generalize signature Gr\"obner bases, previously studied in the free algebra over a field or polynomial rings over a ring, to ideals in the mixed algebra $R[x_1,...,x_k]\langle y_1,\dots,y_n \rangle$ where $R$ is a principal ideal…
Border complexity measures are defined via limits (or topological closures), so that any function which can approximated arbitrarily closely by low complexity functions itself has low border complexity. Debordering is the task of proving an…
We establish formulas for the Hilbert series of the Chow ring of a polymatroid using arbitrary building sets. For braid matroids and minimal building sets, our results produce new formulas for the Poincar\'e polynomial of the moduli space…
In this work, we provide a necessary and sufficient condition on a polyomino ideal for having the set of inner 2-minors as degree reverse lexicographic Gr\"obner basis, due to combinatorial properties of the polyomino itself. Moreover, we…
The theory of spectral methods for partial differential equations leads to infinite-dimensional matrices which represent the derivative operator with respect to an underlying orthonormal basis. Favourable properties of such differentiation…
In a 2014 paper, R.E. Curto and S. Yoo proved that a moment matrix $M(3)$ with specific harmonic polynomials as column relations admits a representing measure if and only if a condition at the level of moments holds. \ In this paper, we…
In this paper, a method for constructing a near optimal normal basis for algebraic extensions of a finite field is described. In each extension, except for the squares of basis elements, the product of two distinct normal basis elements can…
In this note we provide a counter-example to a conjecture of K. Pardue [Thesis, Brandeis University, 1994.], which asserts that if a monomial ideal is $p$-Borel-fixed, then its $\naturals$-graded Betti table, after passing to any field does…
A bound for Betti numbers of sets definable in o-minimal structures is presented. An axiomatic complexity measure is defined, allowing various concrete complexity measures for definable functions to be covered. This includes common concrete…
A fundamental question in parallel computation, posed by Karp, Upfal, and Wigderson (FOCS 1985, JCSS 1988), asks: \emph{given only independence-oracle access to a matroid on $n$ elements, how many rounds are required to find a basis using…
We focus on Gr\"obner bases for modules of univariate polynomial vectors over a ring. We identify a useful property, the "predictable leading monomial (PLM) property" that is shared by minimal Gr\"{o}bner bases of modules in F[x]^q, no…
We give a criterion for a collection of polynomials to be a universal Gr\"{o}bner basis for an ideal in terms of the multidegree of the closure of the corresponding affine variety in $(\mathbb{P}^1)^N$. This criterion can be used to give…
In a recent paper by Harada, Seceleanu, and \c{S}ega, the Hilbert function, betti table, and graded minimal free resolution of a general principal symmetric ideal are determined when the number of variables in the polynomial ring is…
A relaxation method based on border basis reduction which improves the efficiency of Lasserre's approach is proposed to compute the optimum of a polynomial function on a basic closed semi algebraic set. A new stopping criterion is given to…
Parametric model order reduction (pMOR) is a powerful tool for accelerating finite element (FE) simulations while maintaining parametric dependencies. For geometric parameters, pMOR by matrix interpolation is a well-suited approach because…
In this work, we introduce and investigate a new class of sets, the \textit{$k$th Order Preserving Sets}, arising naturally from the Fourier analysis of support functions associated with hedgehogs. Specifically, we focus on sets whose…
In this PhD thesis we propose an algorithmic approach to the study of the Hilbert scheme. Developing algorithmic methods, we also obtain general results about Hilbert schemes. In Chapter 1 we discuss the equations defining the Hilbert…