Related papers: Algebraic Independence and Blackbox Identity Testi…
The key to a robust and efficient implementation of a computational geometry algorithm is an efficient algorithm for detecting degenerate predicates. We study degeneracy detection in constructing the free space of a polyhedron that rotates…
In this paper, we prove that the world of near-vector spaces allows us to work with non-linear problems and yet, gives access to most of the tools linear algebra has to offer. We establish some fundamental results for near-vector spaces…
We make use of a forcing technique for extending Boolean algebras. The same type of forcing was employed in [BK81], [Kos99], and elsewhere. Using and modifying a lemma of Koszmider, and using CH, we obtain an atomless BA, A such that f(A) =…
Let $f=f(x_1,\dots,x_m)$ be a multilinear polynomial over a field $F$. An $F$-algebra $A$ is said to be $f$-zpd ($f$-zero product determined) if every $m$-linear functional $\varphi\colon A^{m}\rightarrow F$ which preserves zeros of $f$ is…
We present a new approach to singularity confinement which makes it an efficient and reliable discrete integrability detector. Our method is based on the full-deautonomisation procedure, which consists in analysing non-autonomous extensions…
The independence polynomial of a graph is the generating polynomial for the number of independent sets of each size. Two graphs are said to be \textit{independence equivalent} if they have equivalent independence polynomials. We extend…
Two polynomials $f, g \in \mathbb{F}[x_1, \ldots, x_n]$ are called shift-equivalent if there exists a vector $(a_1, \ldots, a_n) \in \mathbb{F}^n$ such that the polynomial identity $f(x_1+a_1, \ldots, x_n+a_n) \equiv g(x_1,\ldots,x_n)$…
A subspace of an algebra with involution is called a Lie skew-ideal if it is closed under Lie products with skew-symmetric elements. Lie skew-ideals are classified in central simple algebras with involution (there are eight of them for…
This article gives a class of Nullstellens\"atze for noncommutative polynomials. The singularity set of a noncommutative polynomial $f=f(x_1,\dots,x_g)$ is $Z(f)=(Z_n(f))_n$, where $Z_n(f)=\{X \in M_n^g: \det f(X) = 0\}.$ The first main…
The (weak) Nullstellensatz over finite fields says that if $P_1,\ldots,P_m$ are $n$-variate degree-$d$ polynomials with no common zero over a finite field $\mathbb{F}$ then there are polynomials $R_1,\ldots,R_m$ such that…
We give deterministic black-box polynomial identity testing algorithms for multilinear read-once oblivious algebraic branching programs (ROABPs), in n^(lg^2 n) time. Further, our algorithm is oblivious to the order of the variables. This is…
Deterministic black-box polynomial identity testing (PIT) for read-once oblivious algebraic branching programs (ROABPs) is a central open problem in algebraic complexity, particularly in the absence of variable ordering. Prior deterministic…
The (matricial) solution set of a Linear Matrix Inequality (LMI) is a convex basic non-commutative semi-algebraic set. The main theorem of this paper is a converse, a result which has implications for both semidefinite programming and…
We continue the study of graph classes in which the treewidth can only be large due to the presence of a large clique, and, more specifically, of graph classes with bounded tree-independence number. In [Dallard, Milani\v{c}, and…
In classical and real algebraic geometry there are several notions of the radical of an ideal I. There is the vanishing radical defined as the set of all real polynomials vanishing on the real zero set of I, and the real radical defined as…
Let $F$ be an infinite field and $UT(d_1,\dots, d_n)$ be the algebra of upper block-triangular matrices over $F$. In this paper we describe a basis for the $G$-graded polynomial identities of $UT(d_1,\dots, d_n)$, with an elementary grading…
We introduce a new algebraic proof system, which has tight connections to (algebraic) circuit complexity. In particular, we show that any super-polynomial lower bound on any Boolean tautology in our proof system implies that the permanent…
Conditional independence testing is a fundamental problem underlying causal discovery and a particularly challenging task in the presence of nonlinear and high-dimensional dependencies. Here a fully non-parametric test for continuous data…
We obtain a necessary and sufficient condition for the linear independence of solutions of differential equations for hyperlogarithms. The key fact is that the multiplier (i.e. the factor $M$ in the differential equation $dS=MS$) has only…
The free singularity locus of a noncommutative polynomial f is defined to be the sequence $Z_n(f)=\{X\in M_n^g : \det f(X)=0\}$ of hypersurfaces. The main theorem of this article shows that f is irreducible if and only if $Z_n(f)$ is…