Related papers: The Differential Dimension Polynomial for Characte…
We study mixtures of decomposable graphical models, focusing on their ideals and dimensions. For mixtures of clique stars, we characterize the ideals in terms of ideals of mixtures of independence models. We also give a recursive formula…
In this paper we generalize the classical Groebner basis technique to prove the existence and present a method of computation of a dimension polynomial in two variables associated with a finitely generated D-module, that is, a finitely…
A univariate polynomial f over a field is decomposable if it is the composition f = g(h) of two polynomials g and h whose degree is at least 2. We determine the dimension (over an algebraically closed field) of the set of decomposables, and…
In this paper, we give decision criteria for normal binomial difference polynomial ideals in the univariate difference polynomial ring F{y} to have finite difference Groebner bases and an algorithm to compute the finite difference Groebner…
We study correlation functions of the characteristic polynomials in coupled matrix models based on the Schur polynomial expansion, which manifests their determinantal structure.
We address the problem of classification of integrable differential-difference equations in 2+1 dimensions with one/two discrete variables. Our approach is based on the method of hydrodynamic reductions and its generalisation to dispersive…
Let $f$ be a transcendental meromorphic function, defined in the complex plane $\mathbb{C}$. In this paper, we give a quantitative estimations of the characteristic function $T(r,f)$ in terms of the counting function of a homogeneous…
Second-order polynomials generalize classical first-order ones in allowing for additional variables that range over functions rather than values. We are motivated by their applications in higher-order computational complexity theory,…
We introduce partial differential encodings of Boolean functions as a way of measuring the complexity of Boolean functions. These encodings enable us to derive from group actions non-trivial bounds on the Chow-Rank of polynomials used to…
In this paper, basic properties of monomial difference ideals are studied. We prove the finitely generated property of well-mixed difference ideals generated by monomials. Furthermore, a finite prime decomposition of radical well-mixed…
We are concerned with polynomial involutions in characteristic two. In this note, we look for involutions among triangular automorphisms of the four-dimensional polynomial ring in characteristic two and obtain three types of such…
The ideals of the Lie algebras of unitriangular polynomial derivations are classified. An isomorphism criterion is given for the Lie factor algebras of the Lie algebras of unitriangular polynomial derivations.
We show that some hard to detect properties of quadratic ODEs (eg certain preserved integrals and measures) can be deduced more or less algorithmically from their Kahan discretization, using Darboux Polynomials (DPs). Somewhat similar…
We prove upper and lower bounds for leading coefficient of Kolchin dimension polynomial of systems of partial linear differential equations in codimension two.
We calculate joint moments of the characteristic polynomial of a random unitary matrix from the circular unitary ensemble and its derivative in the case that the power in the moments is an odd positive integer. The calculations are carried…
This paper describes an algorithm which computes the characteristic polynomial of a matrix over a field within the same asymptotic complexity, up to constant factors, as the multiplication of two square matrices. Previously, this was only…
We evaluate the number of monic polynomials (of arbitrary degree $N$) the zeros of which equal their coefficients when these are allowed to take arbitrary complex values. In the following, we call polynomials with this property {\em…
In this paper, we present a modular strategy which describes key properties of the absolute primary decomposition of an equidimensional polynomial ideal defined by polynomials with rational coefficients. The algorithm we design is based on…
A polynomial f (multivariate over a field) is decomposable if f = g(h) with g univariate of degree at least 2. We determine the dimension (over an algebraically closed field) of the set of decomposables, and an approximation to their number…
Factoring ideals in integral domains is a central topic in multiplicative ideal theory. In the present paper we study monoids of ideals and consider factorizations of ideals into multiplicatively irreducible ideals. The focus is on the…