Related papers: A Direct Ultrametric Approach to Additive Complexi…

In these short notes, we will show the following. Let F_q be a finite field and let E/\F_q be an elliptic curve. Let S_r be the rth summation/Semaev polynomial for E. Under an assumption, we show that it is NP-complete to check if S_r…

We consider the zeros of the sum of independent random polynomials as their degrees tend to infinity. Namely, let $p$ and $q$ be two independent random polynomials of degree $n$, whose roots are chosen independently from the probability…

Quantization is an essential technique for making neural networks more efficient, yet our theoretical understanding of it remains limited. Previous works demonstrated that extremely low-precision networks, such as binary networks, can be…

For function germs $g:(\mathbb C^n,0)\to (\mathbb C,0)$ it is well known that $1\leq\frac{\mu(g)}{\tau(g)}$ and it has recently been proved by Liu that $\frac{\mu(g)}{\tau(g)}\leq n$. We give an upper bound for the codimension of map-germs…

We consider the problem of constructing an approximation of the Pareto curve associated with the multiobjective optimization problem $\min_{\mathbf{x} \in \mathbf{S}}\{ (f_1(\mathbf{x}), f_2(\mathbf{x})) \}$, where $f_1$ and $f_2$ are two…

Sarnak's Density Conjecture is an explicit bound on the multiplicities of non-tempered representations in a sequence of cocompact congruence arithmetic lattices in a semisimple Lie group, which is motivated by the work of Sarnak and Xue.…

For an odd prime $p$, we say $f(X) \in {\mathbb F}_p[X]$ computes square roots in $\mathbb F_p$ if, for all nonzero perfect squares $a \in \mathbb F_p$, we have $f(a)^2 = a$. When $p \equiv 3 \mod 4$, it is well known that $f(X) =…

Let f:=(f^1,\...,f^n) be a sparse random polynomial system. This means that each f^i has fixed support (list of possibly non-zero coefficients) and each coefficient has a Gaussian probability distribution of arbitrary variance. We express…

Given any polynomial system with fixed monomial term structure, we give explicit formulae for the generic number of roots with specified coordinate vanishing restrictions. For the case of affine space minus an arbitrary union of coordinate…

Despite much research, hard weighted problems still resist super-polynomial improvements over their textbook solution. On the other hand, the unweighted versions of these problems have recently witnessed the sought-after speedups.…

In this article, we consider a dominant rational self-map $f:X \dashrightarrow X$ of a normal projective variety defined over a number field. We study the arithmetic degree $\alpha_k(f)$ for $f$ and $\alpha_k(f,V)$ of a subvariety $V$,…

To a depth two extension A | B, we associate the dual bialgebroids S := \End {}_BA_B and T := (A \o_B A)^B over the centralizer R=C_A(B). In the set-up where R is a subalgebra of B, which is quite common, two nondegenerate pairings of S and…

We present a new algorithm for reconstructing an exact algebraic number from its approximate value using an improved parameterized integer relation construction method. Our result is consistent with the existence of error controlling on…

Zaremba's Conjecture concerns the formation of continued fractions with partial quotients restricted to a given alphabet. In order to answer the numerous questions that arrive from this conjecture, it is best to consider a semi-group, often…

We design fast deterministic algorithms for distance computation in the congested clique model. Our key contributions include: -- A $(2+\epsilon)$-approximation for all-pairs shortest paths in $O(\log^2{n} / \epsilon)$ rounds on unweighted…

We consider 2-dimensional random simplicial complexes $Y$ in the multi-parameter model. We establish the multi-parameter threshold for the property that every 2-dimensional simplicial complex $S$ admits a topological embedding into $Y$…

The famous Erdos-Heilbronn conjecture plays an important role in the development of additive combinatorics. In 2007 Z. W. Sun made the following further conjecture (which is the linear extension of the Erdos-Heilbronn conjecture): For any…

To directed graphs with unique sink and source we associate a noncommutative associative alsgebra and a polynomial over this algebra. Edges of the graph correspond to pseudo-roots of the polynomial. We give a sufficient condition when…

[Inserted by J. Maurice Rojas] We give a formula for the number of complex roots of a generic system of two polynomial equations in two unknowns. The formula is completely combinatorial, ultimately depending just on the convex hull of the…

This paper is concerned with certifying that a given point is near an exact root of an overdetermined or singular polynomial system with rational coefficients. The difficulty lies in the fact that consistency of overdetermined systems is…