Related papers: On the RLWE/PLWE equivalence for cyclotomic number…

It has been known for almost three decades that many $\mathrm{NP}$-hard optimization problems can be solved in polynomial time when restricted to structures of constant treewidth. In this work we provide the first extension of such results…

We prove a Roth type theorem for polynomial corners in the finite field setting. Let $\phi_1$ and $\phi_2$ be two polynomials of distinct degree. For sufficiently large primes $p$, any subset $ A \subset \mathbb F_p \times \mathbb F_p$ with…

We introduce different notions of polynomial convexity with bounds on degrees of polynomials in $\mathbb C^n$. We provide some examples in higher dimensions and show necessary and sufficient conditions for polynomial convexity with degree…

We reexamine the external field problem for $N\times N$ hermitian one-matrix models. We prove an equivalence of the models with the potentials $\tr{({1/over2N}X^2 + \log X - \Lambda X)}$ and $\sum_{k=1}^\infty t_k\tr{X^k}$ providing the…

For k a field of arbitrary characteristic, and R a k-algebra, we show that the PI degree of an iterated skew polynomial ring R[x_1;\tau_1,\delta_1]...b[x_n;\tau_n,\delta_n] agrees with the PI degree of R[x_1;\tau_1]...b[x_n;\tau_n] when…

Training accurate deep neural networks (DNNs) in the presence of noisy labels is an important and challenging task. Though a number of approaches have been proposed for learning with noisy labels, many open issues remain. In this paper, we…

Let $R$ be a local principal ideal ring of length two, for example, the ring $R=\Z/p^2\Z$ with $p$ prime. In this paper we develop a theory of normal forms for similarity classes in the matrix rings $M_n(R)$ by interpreting them in terms of…

We give an improved polynomial bound on the complexity of the equation solvability problem, or more generally, of finding the value sets of polynomials over finite nilpotent rings. Our proof depends on a result in additive combinatorics,…

We show that submultiplicative norms on section rings of polarised projective manifolds are asymptotically equivalent to sup-norms associated with metrics on the polarisation. We then discuss some applications to the spectral theory of…

The computational complexity of the circuit evaluation problem for finite semirings is considered, where semirings are not assumed to have an additive or multiplicative identity. The following dichotomy is shown: If a finite semiring is…

We present an alternative account of the problem of classifying and finding normal forms for arbitrary bilinear forms. Beginning from basic results developed by Riehm, our solution to this problem hinges on the classification of…

We study local equivalence of bounded complexes over a polynomial ring $R[w]$, where $R$ is a noetherian ring. We provide a homological algebra approach to the results, the variants of which have been proved in many places in the…

In this paper, we study convolutional codes with a specific cyclic structure. By definition, these codes are left ideals in a certain skew polynomial ring. Using that the skew polynomial ring is isomorphic to a matrix ring we can describe…

A general result on the explicit form of the general error locator polynomial for all cyclic codes is given, along with several results for infinite classes of cyclic codes with $t=2$ and $t=3$. From these, a theoretically justification of…

A general method of obtaining linear differential equations having polynomial solutions is proposed. The method is based on an equivalence of the spectral problem for an element of the universal enveloping algebra of some Lie algebra in the…

Consider a system of polynomials in many variables over the ring of integers of a number field $K$. We prove an asymptotic formula for the number of integral zeros of this system in homogeneously expanding boxes. As a consequence, any…

We prove the hardness of weakly learning halfspaces in the presence of adversarial noise using polynomial threshold functions (PTFs). In particular, we prove that for any constants $d \in \mathbb{Z}^+$ and $\varepsilon > 0$, it is NP-hard…

Arora & Ge introduced a noise-free polynomial system to compute the secret of a Learning With Errors (LWE) instance via linearization. Albrecht et al. later utilized the Arora-Ge polynomial model to study the complexity of Gr\"obner basis…

A Boolean constraint satisfaction instance is a conjunction of constraint applications, where the allowed constraints are drawn from a fixed set B of Boolean functions. We consider the problem of determining whether two given constraint…

Let $K$ be an imaginary quadratic field, and fix a prime $p > 3$ that does not divide the class number of $K$. In this paper we prove that Iwasawa's $\lambda$-invariant for the cyclotomic $\mathbb{Z}_p$-extension of $K$ is greater than $1$…