相关论文: Algebraic Independence and Blackbox Identity Testi…

Graph independence (also known as $\epsilon$-independence or $\lambda$-independence) is a mixture of classical independence and free independence corresponding to graph products or groups and operator algebras. Using conjugation by certain…

$ \newcommand{\inparen}[1]{\left( #1 \right)} \newcommand{\pfrac}[2]{\inparen{\frac{1}{2}}} \newcommand{\ilog}[1]{\log^{\circ #1}} \newcommand{\F}{\mathbb{F}} $The Polynomial Identity Lemma (also called the "Schwartz--Zippel lemma") states…

A graded-division algebra is an algebra graded by a group such that all nonzero homogeneous elements are invertible. This includes division algebras equipped with an arbitrary group grading (including the trivial grading). We show that a…

Over the past several decades, algebraic geometry has provided innovative approaches to biological experimental design that resolved theoretical questions and improved computational efficiency. However, guaranteeing uniqueness and perfect…

Testing independence among a number of (ultra) high-dimensional random samples is a fundamental and challenging problem. By arranging $n$ identically distributed $p$-dimensional random vectors into a $p \times n$ data matrix, we investigate…

We investigate the power of graph isomorphism algorithms based on algebraic reasoning techniques like Gr\"obner basis computation. The idea of these algorithms is to encode two graphs into a system of equations that are satisfiable if and…

We study the question of algebraic rank or transcendence degree preserving homomorphisms over finite fields. This concept was first introduced by Beecken, Mittmann and Saxena (2013), and exploited by them, and Agrawal, Saha, Saptharishi and…

A separating algebra is, roughly speaking, a subalgebra of the ring of invariants whose elements distinguish between any two orbits that can be distinguished using invariants. In this paper, we introduce a geometric notion of separating…

Let $r, \,m$ be positive integers. Let $x$ be a rational number with $0 \le x <1$. Consider $\Phi_s(x,z) =\displaystyle\sum_{k=0}^{\infty}\frac{z^{k+1}}{{(k+x+1)}^s}$ the $s$-th Lerch function with $s=1, 2, \cdots, r$. When $x=0$, this is a…

We consider the problem of identity testing and recovering (that is, interpolating) of a "hidden" monic polynomials $f$, given an oracle access to $f(x)^e$ for $x\in\mathbb F_q$, where $\mathbb F_q$ is the finite field of $q$ elements and…

This paper investigates the independence polynomials arising from iterated strong products of cycle graphs, examining their algebraic symmetries and combinatorial structures. Leveraging modular arithmetic and Galois theory, we establish…

Generalising the Heilman-Lieb Theorem from statistical physics, Chudnovsky and Seymour [J. Combin. Theory Ser. B, 97(3):350--357] showed that the univariate independence polynomial of any claw-free graph has all of its zeros on the negative…

We study relatively free associative algebras $F^{(n)}_r$ of ranks $r=2,3$ with the identity $[x_1,\dots, x_n]=0$ of Lie nilpotency of step $n\geqslant 3$ over a field $K$ of characteristic $\neq 2,3$. First we prove a Theorem on the…

We call shifted power a polynomial of the form $(x-a)^e$. The main goal of this paper is to obtain broadly applicable criteria ensuring that the elements of a finite family $F$ of shifted powers are linearly independent or, failing that, to…

An independent set in a graph is a set of pairwise non-adjacent vertices, and a(G) is the size of a maximum independent set in the graph G. If s_{k} is the number of independent sets of cardinality k in G, then…

We give the first algorithm that is both query-efficient and time-efficient for testing whether an unknown function $f: \{0,1\}^n \to \{0,1\}$ is an $s$-sparse GF(2) polynomial versus $\eps$-far from every such polynomial. Our algorithm…

We review our algebraic framework for linear boundary problems (concentrating on ordinary differential equations). Its starting point is an appropriate algebraization of the domain of functions, which we have named integro-differential…

Stable basis algebras were introduced by Fountain and Gould and developed in a series of articles. They form a class of universal algebras, extending that of independence algebras. If a stable basis algebra $\mathbb{B}$ of finite rank…

In this paper we prove a new zero-free region for the partition function of the hard-core model, that is, the independence polynomials of graphs with largest degree $\Delta$. This new domain contains the half disk $$D=\left\{ \lambda \in…

Let $D$ be a commutative domain with field of fractions $K$, let $A$ be a torsion-free $D$-algebra, and let $B$ be the extension of $A$ to a $K$-algebra. The set of integer-valued polynomials on $A$ is ${\rm Int}(A) = \{f \in B[X] \mid f(A)…