Related papers: Computational methods for t-spread monomial ideals

T-distributed stochastic neighbor embedding (t-SNE) is a well-known algorithm for visualizing high-dimensional data by finding low-dimensional representations. In this paper, we study the convergence of t-SNE with generalized kernels and…

Given an ideal $I$ in a polynomial ring $K[x_1,\dots,x_n]$ over a field $K$, we present a complete algorithm to compute the binomial part of $I$, i.e., the subideal ${\rm Bin}(I)$ of $I$ generated by all monomials and binomials in $I$. This…

In this paper we develop a new technique to compute the Betti table of a monomial ideal. We present a prototype implementation of the resulting algorithm and we perform numerical experiments suggesting a very promising efficiency. On the…

We consider a connected undirected graph $G(n,m)$ with $n$ nodes and $m$ edges. A $k$-dominating set $D$ in $G$ is a set of nodes having the property that every node in $G$ is at most $k$ edges away from at least one node in $D$. Finding a…

In this paper, we present secure distributed matrix multiplication (SDMM) schemes over the complex numbers with good numerical stability and small mutual information leakage by utilizing polynomial interpolation with roots of unity.…

Let K be a field and let S = K[x_1, ..., x_n] be a polynomial ring. Consider a homogenous ideal I in S. Let t_i denote reg(Tor_i (S/I, K)), the maximal degree of an ith syzygy of S/I. We prove bounds on the numbers t_i for i > n/2 purely in…

In this work we approach the problem of approximating uniformly continuous semialgebraic maps $f:S\to T$ from a compact semialgebraic set $S$ to an arbitrary semialgebraic set $T$ by semialgebraic maps $g:S\to T$ that are differentiable of…

We show that graphs excluding $K_{2,t}$ as a minor admit a $f(t)$-round $50$-approximation deterministic distributed algorithm for Minimum Dominating Set. The result extends to Minimum Vertex Cover. Though fast and approximate distributed…

We present a novel distributionally robust framework for dynamic programming that uses kernel methods to design feedback control policies. Specifically, we leverage kernel mean embedding to map the transition probabilities governing the…

Solving a system of nonlinear inequalities is an important problem for which conventional numerical analysis has no satisfactory method. With a box-consistency algorithm one can compute a cover for the solution set to arbitrarily close…

We introduce to the context of multigraded modules the methods of modules over categories from algebraic topology and homotopy theory. We develop the basic theory quite generally, with a view toward future applications to a wide class of…

In this paper, we study the minimum dominating set (MDS) problem and the minimum total dominating set MTDS) problem which have many applications in real world. We propose a new idea to compute approximate MDS and MTDS. Next, we give an…

In this thesis we investigate certain types of monomial ideals of polynomial rings over fields. We are interested in minimal free resolutions of these ideals (or equivalently the quotients of the polynomial ring by the ideals) considered as…

Well ordered covers of square-free monomial ideals are subsets of the minimal generating set ordered in a certain way that give rise to a Lyubeznik resolution for the ideal, and have guaranteed nonvanishing Betti numbers in certain degrees.…

A method for moving least squares interpolation and differentiation is presented in the framework of orthogonal polynomials on discrete points. This yields a robust and efficient method which can avoid singularities and breakdowns in the…

In this short note we introduce a notion of extremality for Betti numbers of a minimal free resolution, which can be seen as a refinement of the notion of Mumford-Castelnuovo regularity. We show that extremal Betti numbers of an arbitrary…

Let $\KX =K\langle X_1,\ldots ,X_n\rangle$ be the free algebra generated by $X=\{ X_1,\ldots ,X_n\}$ over a field $K$. It is shown that with respect to any weighted $\mathbb{N}$-gradation attached to $\KX$, minimal homogeneous generating…

Following work of Keel and Tevelev, we give explicit polynomials in the Cox ring of $\mathbb{P}^1\times\cdots\times\mathbb{P}^{n-3}$ that, conjecturally, determine $\overline{M}_{0,n}$ as a subscheme. Using Macaulay2, we prove that these…

A $k$-dominating set is a set $D$ of nodes of a graph such that, for each node $v$, there exists a node $w \in D$ at distance at most $k$ from $v$. Our aim is the deterministic distributed construction of small $T$-dominating sets in time…

We study the class of squarefree principal vector-spread Borel ideals. We compute the minimal primary decomposition of these ideals and thereby we prove that they are sequentially Cohen-Macaulay. As the final conclusion of our results, we…