Related papers: How to compute the Stanley depth of a module

Given arbitrary integers $d$ and $r$ with $d \geq 4$ and $1 \leq r \leq d + 1$, a reflexive polytope $\mathcal{P} \subset \mathbb{R}^d$ of dimension $d$ with ${\rm depth} K[\mathcal{P}] = r$ for which its dual polytope $\mathcal{P}^\vee$ is…

We consider the problem of computing the nearest matrix polynomial with a non-trivial Smith Normal Form. We show that computing the Smith form of a matrix polynomial is amenable to numeric computation as an optimization problem.…

Let R be a commutative noetherian local ring, and M a finitely generated R-module of infinite projective dimension. It is well-known that the depths of the syzygy modules of M eventually stabilize to the depth of R. In this paper, we…

We compute the degree of Stiefel manifolds, that is, the variety of orthonormal frames in a finite dimensional vector space. Our approach employs techniques from classical algebraic geometry, algebraic combinatorics, and classical invariant…

Repetitiveness in projective and injective resolutions and its influence on homological dimensions are studied. Some variations on the theme of repetitiveness are introduced, and it is shown that the corresponding invariants lead to very…

To each linear code over a finite field we associate the matroid of its parity check matrix. We show to what extent one can determine the generalized Hamming weights of the code (or defined for a matroid in general) from various sets of…

We generalize the Hamiltonian Monte Carlo algorithm with a stack of neural network layers and evaluate its ability to sample from different topologies in a two dimensional lattice gauge theory. We demonstrate that our model is able to…

The lattice size $\operatorname{ls_\Delta}(P)$ of a lattice polytope $P$ is a geometric invariant, which was formally introduced in relation to the problem of bounding the total degree and the bi-degree of the defining equation of an…

We investigate the complexity of counting the number of integer points in tropical polytopes, and the complexity of calculating their volume. We study the tropical analogue of the outer parallel body and establish bounds for its volume. We…

We prove upper bounds for the graded Betti numbers of Stanley-Reisner rings of balanced simplicial complexes. Along the way we show bounds for Cohen-Macaulay graded rings $S/I$, where $S$ is a polynomial ring and $I\subseteq S$ is an…

We study the computational complexity of satisfiability problems for classes of simple finite height (ortho)complemented modular lattices $L$. For single finite $L$, these problems are shown tobe $\mc{NP}$-complete; for $L$ of height at…

Let $R$ be a finite ring and let $M, N$ be two finite left $R$-modules. We present two distinct deterministic algorithms that decide in polynomial time whether or not $M$ and $N$ are isomorphic, and if they are, exhibit an isomorphism. As…

Several problems in computer algebra can be efficiently solved by reducing them to calculations over finite fields. In this paper, we describe an algorithm for the reconstruction of multivariate polynomials and rational functions from their…

Let $(A,\m)$ be a Noetherian local ring, let $M$ be a finitely generated \CM $A$-module of dimension $r \geq 2$ and let $I$ be an ideal of definition for $M$. Set $L^I(M) = \bigoplus_{n\geq 0}M/I^{n+1}M$. In part one of this paper we showed…

R. P. Stanley proved the Upper Bound Conjecture in 1975. We imitate his proof for the Ehrhart rings. We give some upper bounds for the volume of integrally closed lattice polytopes. We derive some inequalities for the delta-vector of…

For proper stacks, unlike schemes, there is a distinction between rational and integral points. Moreover, rational points have extra automorphism groups. We show that these distinctions exactly account for the lower order main terms…

Consider a matrix $\mathbf{F} \in \mathbb{K}[x]^{m \times n}$ of univariate polynomials over a field $\mathbb{K}$. We study the problem of computing the column rank profile of $\mathbf{F}$. To this end we first give an algorithm which…

The M-polynomial provides a unifying framework for a wide class of degree-based topological indices. Despite its structural importance, general methods for computing the M-polynomial under graph constructions remain limited. In this paper,…

We study the maximum modulus set, $\mathcal{M}(p)$, of a polynomial $p$. We are interested in constructing $p$ so that $\mathcal{M}(p)$ has certain exceptional features. Jassim and London gave a cubic polynomial $p$ such that…

Let $S=K[x_1,\ldots,x_n]$ be the ring of polynomials over a field $K$. Given two monomial ideals $0\subset I\subsetneq J \subset S$, we present a new method to compute the Hilbert depth of $J/I$. As an application, we show that if $u\in S$…