Related papers: On a criterion for algebraic independence and its …
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…
We prove a transcendence theorem concerning values of holomorphic maps from a disk to a quasi-projective variety over $\overline{\mathbf{Q}}$ that are integral curves of some algebraic vector field (defined over $\overline{\mathbf{Q}}$).…
The theme of symbolic computation in algebraic categories has become of utmost importance in the last decade since it enables the automatic modeling of modern algebra theories. On this theoretical background, the present paper reveals the…
Let $K$ be an arbitrary field of characteristic zero, $P_n:= K[ x_1, ..., x_n]$ be a polynomial algebra, and $P_{n, x_1}:= K[x_1^{-1}, x_1, ..., x_n]$, for $n\geq 2$. Let $\s' \in {\rm Aut}_K(P_n)$ be given by $$ x_1\mapsto x_1-1, \quad…
For each 3-dimensional non-Lie Leibniz algebra over the complex numbers, we describe the algebra of polynomial invariants and determine its group of automorphisms. As a consequence, we establish that any two non-nilpotent 3-dimensional…
The evolution equations mentioned in the title of this paper read as follows: x~n = P(n)(x1; x2) , n = 1, 2 , where l is the "discrete-time" independent variable taking integer values (l =0, 1, 2, ...), xn = xn (l) are the 2 dependent…
In 2012, Diem introduced a new figure of merit for cryptographic sequences called expansion complexity. Recently, a series of paper has been published for analysis of expansion complexity and for testing sequences in terms of this new…
The paper studies algebraic independence of certain reciprocal sums of Fibonacci and Lucas sequences. Also more general binary recurrences are considered. The main tool is Mahler's method reducing the investigation of the algebraic…
For a particular experimental design, there is interest in finding which polynomial models can be identified in the usual regression set up. The algebraic methods based on Groebner bases provide a systematic way of doing this. The algebraic…
In 1985, Yu. V. Nesterenko produced a criterion for linear independence, which is a variant of Siegel's. While Siegel uses upper bounds on full systems of forms, Nesterenko uses upper and lower bounds on sufficiently dense sequences of…
Cylindrical algebraic decomposition (CAD) is an important tool for working with polynomial systems, particularly quantifier elimination. However, it has complexity doubly exponential in the number of variables. The base algorithm can be…
We develop a theory of formal multivariate polynomials over commutative rings by treating them as ring terms. Our main result is that two ring terms are s-equivalent (when expanded they yield the same standard polynomial) iff they are…
Exact ground truth invariant polynomial systems can be written for arbitrarily correlated binary classifiers. Their solutions give estimates for sample statistics that require knowledge of the ground truth of the correct labels in the…
We consider systems of polynomial equations and inequalities in $\mathbb{Q}[\boldsymbol{y}][\boldsymbol{x}]$ where $\boldsymbol{x} = (x_1, \ldots, x_n)$ and $\boldsymbol{y} = (y_1, \ldots,y_t)$. The $\boldsymbol{y}$ indeterminates are…
We are concerned with the problem of decomposing the parameter space of a parametric system of polynomial equations, and possibly some polynomial inequality constraints, with respect to the number of real solutions that the system attains.…
Two varieties $V, W$ of the same type are independent if there is a binary term $t(x,y)$ such that $V \models t(x,y) \approx x$ and $W \models t(x,y) \approx y$. In this note, we give necessary and sufficient conditions for two finite…
The present paper introduces a modified version of cyclic-monotone independence which originally arose in the context of random matrices, and also introduces its natural analogy called cyclic-Boolean independence. We investigate formulas…
We develop a method for determining the density of squarefree values taken by certain multivariate integer polynomials that are invariants for the action of an algebraic group on a vector space. The method is shown to apply to the…
Let x be a random vector coming from any k-wise independent distribution over {-1,1}^n. For an n-variate degree-2 polynomial p, we prove that E[sgn(p(x))] is determined up to an additive epsilon for k = poly(1/epsilon). This answers an open…
The main purpose of this article is to provide new results on algebraic independence of values of Mahler functions and their generalizations. Simultaneously, we establish new measures of algebraic independence for these values. Among the…