Related papers: Algebraic Independence in Positive Characteristic …
An independent set in a graph is a set of pairwise non-adjacent vertices. Let $\alpha(G)$ denote the cardinality of a maximum independent set in the graph $G = (V, E)$. Gutman and Harary defined the independence polynomial of $G$ \[ I(G;x)…
We study identities of finite dimensional algebras over a field of characteristic zero, graded by an arbitrary groupoid $\Gamma$. First we prove that its graded colength has a polynomially bounded growth. For any graded simple algebra $A$…
The Jacobian conjecture is a well-known open problem in affine algebraic geometry that asks if any polynomial endomorphism of the affine space $\mathbb{A}_{\mathbb{C}}^{n}$ ($n\geq2$) with jacobian $1$ is an automorphism. We present a…
The independence gap of a graph was introduced by Ekim et al. (2018) as a measure of how far a graph is from being well-covered. It is defined as the difference between the maximum and minimum size of a maximal independent set. We…
We establish the independence of multipliers for polynomial endomorphisms of $\mathbb C^n$ and endomorphisms of $\mathbb P^n.$ This allows us to extend results about the bifurcation measure and the critical height obtained in…
Let $K$ be a finite extension of $\mathbb{Q}_p$ that is totally ramified over $\mathbb{Q}_p$. The set $\mathcal{M}\mathcal{F}(K)$ consists of power series in $1+zK[[z]]$ that are solutions of differential operators in $K(z)[d/dz]$ equipped…
We present a single, common tool to strictly subsume all known cases of polynomial time blackbox polynomial identity testing (PIT) that have been hitherto solved using diverse tools and techniques. In particular, we show that polynomial…
An important invariant of a polynomial $f$ is its Jacobian algebra defined by its partial derivatives. Let $f$ be invariant with respect to the action of a finite group of diagonal symmetries $G$. We axiomatically define an orbifold…
Let $K$ be an infinite field of characteristic different from two and let $U_1$ be the Lie algebra of the derivations of the algebra of Laurent polynomials $K[t,t^{-1}]$. The algebra $U_1$ admits a natural $\mathbb{Z}$-grading. We provide a…
Let $X$ be a second countable locally compact Abelian group. We prove some group analogues of the Skitovich--Darmois, Heyde and Kac--Bernstein characterisation theorems for $Q$-independent random variables taking values in the group $X$.…
Conditional independence testing is a key problem required by many machine learning and statistics tools. In particular, it is one way of evaluating the usefulness of some features on a supervised prediction problem. We propose a novel…
In this paper we study the $p$-adic equation $x^q=a$ over the field of $p$-adic numbers. We construct an algorithm of calculation of criteria of solvability in the case of $q=p^m$ and present a computer program to compute the criteria for…
We show that the stochastic independence of real-valued random variables is equivalent to the conditional uncorrelation, where the conditioning takes place over the Cartesian products of intervals. Next, we express the mutual independence…
In this paper we study arithmetic computations in the nonassociative, and noncommutative free polynomial ring $\mathbb{F}\{x_1,x_2,\ldots,x_n\}$. Prior to this work, nonassociative arithmetic computation was considered by Hrubes, Wigderson,…
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 use homotopy theory to define certain rational coefficients characteristic numbers with integral values, depending on a given prime number q and positive integer t. We prove the first nontrivial degree formula and use it to show that…
The graphoid axioms for conditional independence, originally described by Dawid [1979], are fundamental to probabilistic reasoning [Pearl, 19881. Such axioms provide a mechanism for manipulating conditional independence assertions without…
We present a non-standard proof of the fact that the existence of a local (i.e. restricted to a point) characteristic-zero, semi-parametric lifting for a variety defined by the zero locus of polynomial equations over the integers is…
We prove that Hamiltonian characteristic classes defined as fibre integrals of powers of the coupling class are algebraically independent for generic coadjoint orbits.
A polynomial identity testing algorithm must determine whether a given input polynomial is identically equal to 0. We give a deterministic black-box identity testing algorithm for univariate polynomials of the form $\sum_{j=0}^t c_j…