Related papers: Computing multiplicity sequences
A dual approach to defining the triangle sequence (a type of multidimensional continued fraction algorithm, initially developed in NT/9906016) for a pair of real numbers is presented, providing a new, clean geometric interpretation of the…
Multimodal normal incestual systems are investigated in terms of multiple categories. The different sorted composition of operators are exhibited as 2-cells in multiple categories built up from 2-categories giving rise to different axioms.…
We present formulas for the homogenous multivariate resultant as a quotient of two determinants. They extend classical Macaulay formulas, and involve matrices of considerably smaller size, whose non zero entries include coefficients of the…
We establish a form of the Gotzmann representation of the Hilbert polynomial based on rank and generating degrees of a module, which allow for a generalization of Gotzmann's Regularity Theorem. Under an additional assumption on the…
In this paper, a new method is presented to compute the 2-adic complexity of pseudo-random sequences. With this method, the 2-adic complexities of all the known sequences with ideal 2-level autocorrelation are uniformly determined. Results…
Here the polynomial interpolation approach is used to introduce the main results on multivariate normal algebraic systems. Next we bring a construction which shows that any standard algebraic system, with finite set of solutions, can be…
In this paper, we estimate the Hilbert-Kunz multiplicity of the (extended) Rees algebras in terms of some invariants of the base ring. Also, we give an explicit formula for the Hilbert-Kunz multiplicities of Rees algebras over Veronese…
The j-multiplicity is an invariant that can be defined for any ideal in a Noetherian local ring $(R, m)$. It is equal to the Hilbert-Samuel multiplicity if the ideal is $m$-primary. In this paper we explore the computability of the…
We describe a relation between two invariants that measure the complexity of a hypersurface singularity. One is the Hodge spectrum which is related to the monodromy and the Hodge filtration on the cohomology of the Milnor fiber. The other…
The multivariate resultant is a fundamental tool of computational algebraic geometry. It can in particular be used to decide whether a system of n homogeneous equations in n variables is satisfiable (the resultant is a polynomial in the…
We deal with the algebraicity of an iterated Puiseux series in several variables in terms of the properties of its coefficients. Our aim is to generalize to several variables the results from [HM15]. We show that the algebraicity of such a…
This paper develops new combinatorial approaches to analyze and compute special set partitions, called complementary set partitions, which are fundamental in the study of generalized cumulants. Moving away from traditional graph-based and…
Let $R$ be a standard graded Noetherian algebra over an Artinian local ring. Motivated by the work of Achilles and Manaresi in intersection theory, we first express the multiplicity of $R$ by means of local $j$-multiplicities of various…
The aim of this paper is to introduce a method for computing Hilbert decompositions (and consequently the Hilbert depth) of a finitely generated multigraded module $M$ over the polynomial ring $K[X_1,..., X_n]$ by reducing the problem to…
There are three kinds of multiple polylogarithms; complex, finite and symmetric. The dualities for the complex and finite cases are known. In this paper, we present proofs of them via iterated integrals and its symmetric counterpart by a…
We lay out the theory of a multiplicity in the setting of a triangulated category having a central ring action from a graded-commutative ring $R$, in other words, an $R$-linear triangulated category. The invariant we consider is modelled on…
We give an efficient, deterministic algorithm to decide if two abelian varieties over a number field are isogenous. From this, we derive an algorithm to compute the endomorphism ring of an elliptic curve over a number field.
An ideal of a local polynomial ring can be described by calculating a standard basis with respect to a local monomial ordering. However standard basis algorithms are not numerically stable. Instead we can describe the ideal numerically by…
The computation of triangular decompositions are based on two fundamental operations: polynomial GCDs modulo regular chains and regularity test modulo saturated ideals. We propose new algorithms for these core operations relying on modular…
Solving multihomogeneous systems, as a wide range of structured algebraic systems occurring frequently in practical problems, is of first importance. Experimentally, solving these systems with Gr\"obner bases algorithms seems to be easier…