Related papers: The quadratic formula made hard: A less radical ap…
We develop a new tool, namely polynomial and linear algebraic methods, for studying systems of word equations. We illustrate its usefulness by giving essentially simpler proofs of several hard problems. At the same time we prove extensions…
The new method for obtaining a variety of extensions of Hermite polynomials is given. As a first example a family of orthogonal polynomial systems which includes the generalized Hermite polynomials is considered. Apparently, either these…
Casually introduced thirty years ago, a simple algebraic equation of degree 4, with coefficients in Fp[T], has a solution in the field of power series in 1/T, over the finite field Fp. For each prime p > 3, the continued fraction expansion…
One can hardly believe that there is still something to be said about cubic equations. To dodge this doubt, we will instead try and say something about Sylvester. He doubtless found a way of solving cubic equations. As mentioned by Rota, it…
We introduce a method for proving Sum-of-Squares (SoS)/ Lasserre hierarchy lower bounds when the initial problem formulation exhibits a high degree of symmetry. Our main technical theorem allows us to reduce the study of the positive…
The axiomatic formulation of quantum field theory (QFT) of the 1950's in terms of fields defined as operator valued Schwartz distributions is re-examined in the light of subsequent developments. These include, on the physical side, the…
An effective method for generating linear equations of maximal symmetry in their much general normal form is obtained. In the said normal form, the coefficients of the equation are differential functions of the coefficient of the term of…
We present a lattice algorithm specifically designed for some classical applications of lattice reduction. The applications are for lattice bases with a generalized knapsack-type structure, where the target vectors are boundably short. For…
Standard techniques for treating linear recurrences no longer apply for quadratic recurrences. It is not hard to determine asymptotics for a specific parametrized model over a wide domain of values (all $p \neq 1/2$ here). The gap between…
In this work, we describe our experience in learning the use of a computer proof assistant - specifically, Lean - from scratch, through proving formulae for the solutions of polynomial equations. Specifically, in this work we characterize…
According to the Abel-Ruffini theorem, equations of degree equal to or greater than 5 cannot, in most cases, be solved by radicals. Due of this theorem we will present a formula that solves specific cases of sixth degree equations using…
Recently, it has been shown how to perform the quantum hamiltonian reduction in the case of general $sl(2)$ embeddings into Lie (super)algebras, and in the case of general $osp(1|2)$ embeddings into Lie superalgebras. In another development…
We provide explicit formulas for quadratic Gauss sums over $\mathbb{Z}^n/c\mathbb{Z}^n$, which generalize some of the existing formulas, e.g., Skoruppa and Zagier's (for $n=2$), and Iwaniec and Kowalski's (for arbitrary $n$). We then give…
We present general reduction procedures for Courant, Dirac and generalized complex structures, in particular when a group of symmetries is acting. We do so by taking the graded symplectic viewpoint on Courant algebroids and carrying out…
Assuming a deep but standard conjecture in the Langlands programme, we prove Fermat's Last Theorem over $\mathbb Q(i)$. Under the same assumption, we also prove that, for all prime exponents $p \geq 5$, Fermat's equation $a^p+b^p+c^p=0$…
We present a quantum algorithmic routine that extends the realm of Grover-based heuristics for tackling combinatorial optimization problems with arbitrary efficiently computable objective and constraint functions. Building on previously…
We consider the fundamental problem of solving quadratic systems of equations in $n$ variables, where $y_i = |\langle \boldsymbol{a}_i, \boldsymbol{x} \rangle|^2$, $i = 1, \ldots, m$ and $\boldsymbol{x} \in \mathbb{R}^n$ is unknown. We…
We obtain asymptotic formulae with optimal error terms for the number of lattice points under and near a dilation of the standard parabola, the former improving upon an old result of Popov. These results can be regarded as achieving the…
In this paper, we present a new method for solving standard quaternion equations. Using this method we reobtain the known formulas for the solution of a quadratic quaternion equation, and provide an explicit solution for the cubic…
We parametrize quartic commutative algebras over any base ring or scheme (equivalently finite, flat degree four $S$-schemes), with their cubic resolvents, by pairs of ternary quadratic forms over the base. This generalizes Bhargava's…