Related papers: Computing generalized Frobenius powers of monomial…
A finite sum of exponential functions may be expressed by a linear combination of powers of the independent variable and by successive integrals of the sum. This is proved for the general case and the connection between the parameters in…
We apply Frobenius integrability theorem in the search of invariants for one-dimensional Hamiltonian systems with a time-dependent potential. We obtain several classes of potential functions for which Frobenius theorem assures the existence…
In his Ph.D. thesis, Sean Griffin introduced a family of ideals and found monomial bases for their quotient rings. These rings simultaneously generalize the Delta Conjecture coinvariant rings of Haglund-Rhoades-Shimozono and the cohomology…
We develop a class of minimax estimators for a normal mean matrix under the Frobenius loss, which generalizes the James--Stein and Efron--Morris estimators. It shrinks the Schatten norm towards zero and works well for low-rank matrices. We…
The aim of this article is to introduce standard bases of ideals in polynomial rings with respect to a class of orderings which are not necessarily semigroup orderings. Our approach generalises the concept of standard bases with respect to…
We generalize the analog of Buchberger's first criterion, stated by Boulier et al., for detecting useless S-polynomials reductions in the computation of characteristic sets of differential ideals. The original version assumes linear…
We investigate the rational powers of ideals. We find that in the case of monomial ideals, the canonical indexing leads to a characterization of the rational powers yielding that symbolic powers of squarefree monomial ideals are indeed…
We study the set of circuits of a homogeneous ideal and that of its truncations, and introduce the notion of generic circuits set. We show how this is a well-defined invariant that can be used, in the case of initial ideals with respect to…
The efficiency of Gr\"obner basis computation, the standard engine for solving systems of polynomial equations, depends on the choice of monomial ordering. Despite a near-continuum of possible monomial orders, most implementations rely on…
Freiman's theorem gives a lower bound for the cardinality of the doubling of a finite set in $\RR^n$. In this paper we give an interpretation of his theorem for monomial ideals and their fiber cones. We call a quasi-equigenerated monomial…
This paper addresses the problem of finding the closest generalized essential matrix from a given $6\times 6$ matrix, with respect to the Frobenius norm. To the best of our knowledge, this nonlinear constrained optimization problem has not…
The package Binomials contains implementations of specialized algorithms for binomial ideals, including primary decomposition into binomial ideals. The current implementation works in characteristic zero. Primary decomposition is restricted…
Let $I$ be an equidimensional ideal of a ring polynomial $R$ over $\mathbb{C}$ and let $J$ be its generic linkage. We prove that there is a uniform bound of the difference between the F-pure thresholds of $I_p$ and $J_p$ via the generalized…
In this paper we study classes of monomial ideals for which all of its powers have a linear resolution. Let K[x_{1},x_{2}] be the polynomial ring in two variables over the field K, and let L be the generalized mixed product ideal induced by…
It has been discovered that linear codes may be described by binomial ideals. This makes it possible to study linear codes by commutative algebra and algebraic geometry methods. In this paper, we give a decoding algorithm for binary linear…
In this paper we study the (classical) Frobenius problem, namely the problem of finding the largest integer that cannot be represented as a nonnegative integral combination of given relatively prime (strictly) positive integers (known as…
Prime-based ordering which is proved to be admissible, is the encoding of indeterminates in power-products with prime numbers and ordering them by using the natural number order. Using Eiffel, four versions of Buchberger's improved…
Let $(f\_1,\dots, f\_s) \in \mathbb{Q}\_p [X\_1,\dots, X\_n]^s$ be a sequence of homogeneous polynomials with $p$-adic coefficients. Such system may happen, for example, in arithmetic geometry. Yet, since $\mathbb{Q}\_p$ is not an effective…
We propose a general error analysis related to the low-rank approximation of a given real matrix in both the spectral and Frobenius norms. First, we derive deterministic error bounds that hold with some minimal assumptions. Second, we…
An equigenerated monomial ideal $I$ is a Freiman ideal if $\mu(I^2)=\ell(I)\mu(I)-{\ell(I)\choose 2}$ where $\ell(I)$ is the analytic spread of $I$ and $\mu(I)$ is the least number of monomial generators of $I$. Freiman ideals are special…