Related papers: Computing generalized Frobenius powers of monomial…
We use geometric and cohomological methods to show that given a degree bound for membership in ideals of a fixed degree type in the polynomial ring P=k[x_0,..., x_d], one obtains a good generic degree bound for membership in the tight…
The index of a graded ideal measures the number of linear steps in the graded minimal free resolution of the ideal. In this paper we study the index of powers and squarefree powers of edge ideals. Our results indicate that the index as a…
We use the arithmetic of ideals in orders to parameterize the roots $\mu \pmod m$ of the polynomial congruence $F(\mu) \equiv 0 \pmod m$, $F(X) \in \mathbb{Z}[X]$ monic, irreducible and degree $d$. Our parameterization generalizes Gauss's…
In this work, we introduce the harmonic generalization of the $m$-tuple weight enumerators of codes over finite Frobenius rings. A harmonic version of the MacWilliams-type identity for $m$-tuple weight enumerators of codes over finite…
In this paper we study the growth of ideals in $\mathbb{Z}[t]/(f)$ for a monic cubic polynomial $f$. We also compute the ideal zeta function of $\mathbb{Z}[t]/(t^n)$ for any $n \in \mathbb{N}$.
We study the general theory of Frobenius algebras with group actions. These structures arise when one is studying the algebraic structures associated to a geometry stemming from a physical theory with a global finite gauge group, i.e.…
The aim of this paper is to establish various factorization results and then to derive estimates for linear functionals through the use of a generalized Taylor theorem. Additionally, several error bounds are established including…
We present an effective method for computing parametric primary decomposition via comprehensive Gr\"obner systems. In general, it is very difficult to compute a parametric primary decomposition of a given ideal in the polynomial ring with…
Two correspondences have been provided that associate any linear code over a finite field with a binomial ideal. In this paper, algorithms for computing their Graver bases and universal Gr\"obner bases are given. To this end, a connection…
In this article, I introduce a group-theoretical method to prove positivity of certain linear combinations (with coefficients generally lying in $\mathbb{C}$) of exponential functions under a set of semidefinite linear constraints. The…
We present new bounds for the numerical radius of bounded linear operators and $2\times 2$ operator matrices. We apply upper bounds for the numerical radius to the Frobenius companion matrix of a complex monic polynomial to obtain new…
In this paper we describe the method which we applied to successfully compute the primary decomposition of a certain ideal coming from applications in combinatorial algebra and algebraic statistics regarding conditional independence…
We explore the dependence of the Betti numbers of monomial ideals on the characteristic of the field. A first observation is that for a fixed prime $p$ either the $i$-th Betti number of all high enough powers of a monomial ideal differs in…
In this paper we develop a Grobner bases theory for ideals of partial difference polynomials with constant or non-constant coefficients. In particular, we introduce a criterion providing the finiteness of such bases when a difference ideal…
In this paper, we study ideals spanned by polynomials or overconvergent series in a Tate algebra. With state-of-the-art algorithms for computing Tate Gr{\"o}bner bases, even if the input is polynomials, the size of the output grows with the…
Hochster and Huneke proved in \cite{HH5} fine behaviors of symbolic powers of ideals in regular rings, using the theory of tight closure. In this paper, we use generalized test ideals, which are a characteristic $p$ analogue of multiplier…
We apply the Frobenius (power-series) method to some simple exactly-solvable and conditionally-solvable quantum-mechanical models with supposed physical interest. We show that the supposedly exact solutions to radial eigenvalue equations…
We study second order and third order linear differential equations with analytic coefficients under the viewpoint of finding formal solutions and studying their convergence. We address some untouched aspects of Frobenius methods for second…
We give an algorithm for computing the factor ring of a given ideal in a Dedekind domain with finite rank, which runs in deterministic and polynomial-time. We provide two applications of the algorithm: judging whether a given ideal is prime…
We give an efficient quantum algorithm for the Moebius function $\mu(n)$ from the natural numbers to $\{-1,0,1\}$. The cost of the algorithm is asymptotically quadratic in $\log n$ and does not require the computation of the prime…