Related papers: Explicit Commutative ROABPs from Partial Derivativ…
We introduce the decomposition rank, a notion of covering dimension for nuclear C^*-algebras. The decomposition rank generalizes ordinary covering dimension and has nice permanence properties; in particular, it behaves well with respect to…
Classical invariant theory of a complex reflection group $W$ highlights three beautiful structures: -- the $W$-invariant polynomials constitute a polynomial algebra, over which -- the $W$-invariant differential forms with polynomial…
Triangular decomposition is a classic, widely used and well-developed way to represent algebraic varieties with many applications. In particular, there exist sharp degree bounds for a single triangular set in terms of intrinsic data of the…
In this article, we study several probabilistic properties of polynomials defined over the ring of $p$-adic integers under the Haar measure. First, we calculate the probability that a monic polynomial is separable, generalizing a result of…
Diagonalization in the spirit of Cantor's diagonal arguments is a widely used tool in theoretical computer sciences to obtain structural results about computational problems and complexity classes by indirect proofs. The Uniform…
Let $X$ be a compact subset of the complex plane. It is shown that if a point $x_0$ admits a bounded point derivation on $R^p(X)$, the closure of rational function with poles off $X$ in the $L^p(dA)$ norm, for $p >2$ and if $X$ contains an…
We investigate the complexity of explicit construction problems, where the goal is to produce a particular object of size $n$ possessing some pseudorandom property in time polynomial in $n$. We give overwhelming evidence that $\bf{APEPP}$,…
We determine all restrictions on the dimension of the fixed locus of a diagonalizable group acting on a smooth projective variety that arise from the Chern numbers of the ambient variety. We reduce the problem to finding lower bounds for…
We introduce a new problem on the elementary symmetric polynomials $\sigma_k$, stemming from the constraint equations of some modified gravity theory. For which coefficients is a linear combination of $\sigma_k$ $1/p$-concave, with $0 \leq…
We study systems of polynomial equations in several classes of finitely generated rings and algebras. For each ring $R$ (or algebra) in one of these classes we obtain an interpretation by systems of equations of a ring of integers $O$ of a…
We introduce new polynomial invariants of a finite-dimensional semisimple and cosemisimple Hopf algebra A over a field by using the braiding structures of A. We investigate basic properties of the polynomial invariants including stability…
In 1975, Koornwinder gave a method to construct orthogonal polynomials in two variables using the classical Jacobi polynomials. In [5], the authors introduced some new examples of Koornwinder polynomials obtained from the Koornwinder…
Adversarially robust optimization (ARO) has emerged as the *de facto* standard for training models that hedge against adversarial attacks in the test stage. While these models are robust against adversarial attacks, they tend to suffer…
We study $A$-hypergeometric systems $H_A(\beta)$ in the sense of Gelfand, Kapranov and Zelevinsky under two aspects: the structure of their holonomically dual system, and reducibility of their rank module. We prove first that rank-jumping…
We explore several problems related to ruled polygons. Given a ruling of a polygon $P$, we consider the Reeb graph of $P$ induced by the ruling. We define the Reeb complexity of $P$, which roughly equates to the minimum number of points…
In this work, we propose a new bounded arithmetic theory, denoted $APX_1$, designed to formalize a broad class of probabilistic arguments commonly used in theoretical computer science. Under plausible assumptions, $APX_1$ is strictly weaker…
Unlike standard linear regression, quantile regression captures the relationship between covariates and the conditional response distribution as a whole, rather than only the relationship between covariates and the expected value of the…
We show how polynomial path orders can be employed efficiently in conjunction with weak innermost dependency pairs to automatically certify polynomial runtime complexity of term rewrite systems and the polytime computability of the…
We prove that counting the analytic Brouwer degree of rational coefficient polynomial maps in $\operatorname{Map}(\mathbb C^d, \mathbb C^d)$ -- presented in degree-coefficient form -- is hard for the complexity class $\operatorname{\sharp…
For an arbitrary partially ordered set $P$ its {\em dual} $P^*$ is built as the collection of all monotone mappings $P\to\2$ where $\2=\{0,1\}$ with $0<1$. The set of mappings $P^*$ is proved to be a complete lattice with respect to the…