Related papers: Algebraic Independence and Blackbox Identity Testi…

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…

We study several questions in the reliable agnostic learning framework of Kalai et al. (2009), which captures learning tasks in which one type of error is costlier than others. A positive reliable classifier is one that makes no false…

Let $(P,\cdot,d)$ be a differential perm algebra over a field of characteristic $0$, i.e. an associative algebra satisfying $(ab)c=(ba)c$ equipped with a derivation $d$. We investigate polynomial identities in the algebras obtained from $d$…

Rings of integer-valued polynomials are known to be atomic, non-factorial rings furnishing examples for both irreducible elements for which all powers factor uniquely (\emph{absolutely irreducibles}) and irreducible elements where some…

Two objects are independent if they do not affect each other. Independence is well-understood in classical information theory, but less in algorithmic information theory. Working in the framework of algorithmic information theory, the paper…

Let G be a graph. The independence-domination number is the maximum over all independent sets I in G of the minimal number of vertices needed to dominate I. In this paper we investigate the computational complexity of independence…

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}}$).…

In recent years, various notions of algebraic independence have emerged as a central and unifying theme in a number of areas of applied mathematics, including algebraic statistics and the rigidity theory of bar-and-joint frameworks. In each…

The central objective of this article is to provide an elementary proof of the following theorem, of which we are unaware of any trace in the existing literature. If $B$ is a net finite free algebra over a commutative ring $A$, then it is…

Motivated by the quantum algorithm in \cite{MN05} for testing commutativity of black-box groups, we study the following problem: Given a black-box finite ring $R=\angle{r_1,...,r_k}$ where $\{r_1,r_2,...,r_k\}$ is an additive generating set…

Representations of probability measures in reproducing kernel Hilbert spaces provide a flexible framework for fully nonparametric hypothesis tests of independence, which can capture any type of departure from independence, including…

We introduce the concepts of dependence and independence in a very general framework. We use a concept of rank to study dependence and independence. By means of the rank we identify (total) dependence with inability to create more…

This note presents an analytic technique for proving the linear independence of certain small subsets of real numbers over the rational numbers. The applications of this test produce simple linear independence proofs for the subsets of…

We consider a generalization of polynomial programs: algebraic programs, which are optimization or feasibility problems with algebraic objectives or constraints. Algebraic functions are defined as zeros of multivariate polynomials. They are…

The set of associative and commutative hypercomplex numbers, called the perfect hypercomplex algebra (PHA) is investigated. Necessary and sufficient conditions for an algebra to be a PHA via semi-tensor product(STP) of matrices are…

Let $A$ be an $(m \times n)$ integral matrix, and let $P=\{ x : A x \leq b\}$ be an $n$-dimensional polytope. The width of $P$ is defined as $ w(P)=min\{ x\in \mathbb{Z}^n\setminus\{0\} :\: max_{x \in P} x^\top u - min_{x \in P} x^\top v…

Consider a semi-algebraic set A in R^d constructed from the sets which are determined by inequalities p_i(x)>0, p_i(x)\ge 0, or p_i(x)=0 for a given list of polynomials p_1,...,p_m. We prove several statements that fit into the following…

The lack of evidence in favor of any new physics models means that the search for new physics beyond the Standard Model (BSM) is wide open, with no direction clearly more promising than any other. This marks a turn towards what can be…

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…

In this paper, we address various aspects of divisibility by irreducibles in rings consisting of integer-valued polynomials. An integral domain is called atomic if every nonzero nonunit factors into irreducibles. Atomic domains that do not…