相关论文: Uniform, Integral and Feasible Proofs for the Dete…

Consider an irreducible bilinear form $f(x_1,x_2;y_1,y_2)$ with integer coefficients. We derive an upper bound for the number of integer points $(\mathbf{x},\mathbf{y})\in\mathbb{P}^1\times\mathbb{P}^1$ inside a box satisfying the equation…

We introduce higher order variants of the Yang-Mills functional that involve $(n-2)$th order derivatives of the curvature. We prove coercivity and smoothness of critical points in Uhlenbeck gauge in dimensions $\mathrm{dim}M\le 2n$. These…

Reider's Theorem on the very ampleness of adjoint linear series on a complex projective algebraic surface is extended in two new directions. First, Reider-type inequalities are shown to imply nefness of linear series of the form dH - E on…

Assuming the polynomial hierarchy is infinite, we prove a sufficient condition for determining if uniform and polynomial size quantum circuits over a non-universal gate set are not efficiently classically simulable in the weak…

The modified Macdonald functions $\widetilde{H}_{\mu}$ are fundamental objects in modern algebraic combinatorics. Haiman showed that there is a correspondence between the $(\mathbb{C}^{*})^2$-fixed points $I_{\mu}$ of the Hilbert schemes…

Let $W$ be a $G$-graded algebra over a field of characteristic zero, where $G$ is a finite group. We develope a theory of generalized $G$-graded polynomial identities satisfied by any finite-dimensional $W$-algebra $A$, by mean of the…

In this note, we use the concept of a polynomial ring to give an elementary proof to Cayley-Hamilton Theorem. We also give an elementary proof to Birkhoff theorem on Bi-stochastic matrices.

We present some new and recent algorithmic results concerning polynomial system solving over various rings. In particular, we present some of the best recent bounds on: (a) the complexity of calculating the complex dimension of an algebraic…

This is the second in a series of papers extending Martin-L\"{o}f's meaning explanation of dependent type theory to account for higher-dimensional types. We build on the cubical realizability framework for simple types developed in Part I,…

The first-order theory of addition over the natural numbers, known as Presburger arithmetic, is decidable in double exponential time. Adding an uninterpreted unary predicate to the language leads to an undecidable theory. We sharpen the…

We prove a quantitative Roth-type theorem for polynomial corners in $\mathbb{R}^2$. Let $P_1$ and $P_2$ be two linearly independent polynomials with zero constant term. We show that any measurable subset of $[0,1]^2$ with positive measure…

Let $A$ be a semisimple Banach algebra with non-trivial, and possibly infinite-dimensional socle. Addressing a problem raised by Harte and Hernandez, we first define a characteristic polynomial for elements belonging to the socle, and we…

We prove a negative solution to the analogue of Hilbert's tenth problem for rings of one variable non-Archimedean entire functions in any characteristic. In the positive characteristic case we prove more: the ring of rational integers is…

Let $k,\ell\geq 2$ be two multiplicatively independent integers. Cobham's famous theorem states that a set $X\subseteq \mathbb{N}$ is both $k$-recognizable and $\ell$-recognizable if and only if it is definable in Presburger arithmetic.…

We prove, by simple manipulation of commutators, two noncommutative generalizations of the Cauchy-Binet formula for the determinant of a product. As special cases we obtain elementary proofs of the Capelli identity from classical invariant…

Classical existence theorems and solution methods for quadratic programming traditionally rely on the analytical properties of real numbers, specifically compactness and completeness. These tools are unavailable in general linearly ordered…

We characterize group representations that factor through monomial representations, respectively, block-triangular representations with monomial diagonal blocks, by arithmetic properties. Similar results are obtained for semigroup…

Suppose that h in F[x,y,z], char F=2, defines a nodal cubic. In earlier papers we made a precise conjecture as to the Hilbert-Kunz functions attached to the powers of h. Assuming this conjecture we showed that a class of characteristic 2…

We establish uniform bounds on the multiplicities of irreducible admissible representations appearing in spaces of functions on symmetric spaces over $p$-adic fields. These multiplicities can exceed one and depend intricately on the group,…

We design the first efficient polynomial identity testing algorithms over the nonassociative polynomial algebra. In particular, multiplication among the formal variables is commutative but it is not associative. This complements the strong…