Related papers: On the Forsythe conjecture
In a 1986 paper, Smyth proposed a conjecture about which integer-linear relations were possible among Galois-conjugate algebraic numbers. We prove this conjecture. The main tools (as Smyth already anticipated) are combinatorial rather than…
In 1995 Magnus posed a conjecture about the asymptotics of the recurrence coefficients of orthogonal polynomials with respect to the weights on [-1,1] of the form $$ (1-x)^\alpha (1+x)^\beta |x_0 - x|^\gamma \times a jump at x_0, $$ with…
The conjugate gradient method is a widely used algorithm for the numerical solution of a system of linear equations. It is particularly attractive because it allows one to take advantage of sparse matrices and produces (in case of infinite…
With the help of the recently introduced parametric geometry of numbers by W. M. Schmidt and L. Summerer, we prove a strong version of a conjecture of Schmidt concerning the successive minima of a lattice.
We give an analytic proof of the asymptotic behaviour of the moments of moments of the characteristic polynomials of random symplectic and orthogonal matrices. We therefore obtain alternate, integral expressions for the leading order…
We present a proof of determinant of special nonsymmetric Toeplitz matrices conjectured by An{\dj}eli\'c and Fonseca in \cite{andjelic2020some}. A proof is also demonstrated for a more general theorem. The two conjectures are therefore just…
In this paper, we investigate a general class of stochastic gradient descent (SGD) algorithms, called Conditioned SGD, based on a preconditioning of the gradient direction. Using a discrete-time approach with martingale tools, we establish…
For a matrix $A$ which satisfies Crouzeix's conjecture, we construct several classes of matrices from $A$ for which the conjecture will also hold. We discover a new link between cyclicity and Crouzeix's conjecture, which shows that…
In 2005 Janson, extending earlier work of Mahmoud, Smythe, and Szyma\'nski, established the joint asymptotic normality of the outdegrees of a random plane recursive tree. In particular, he gave an explicit description of the limiting…
Drinfeld in 2010 proved the companions conjecture for smooth varieties over a finite field, generalizing L. Lafforgue's result for smooth curves. We study the obstruction to prove the conjecture for arbitrary normal varieties. To do this,…
Composite optimization problems, where the sum of a smooth and a merely lower semicontinuous function has to be minimized, are often tackled numerically by means of proximal gradient methods as soon as the lower semicontinuous part of the…
We consider the composite minimization problem with the objective function being the sum of a continuously differentiable and a merely lower semicontinuous and extended-valued function. The proximal gradient method is probably the most…
Bayesian nonparametric mixture models provide a flexible framework for data analysis but are often hindered by the computational expense of traditional inference methods like MCMC. A fast, recursive algorithm proposed by Newton (2002)…
The standard perturbative weak-coupling expansions in lattice models are asymptotic. The reason for this is hidden in the incorrect interchange of the summation and integration. However, substituting the Gaussian initial approximation of…
Motivated by a recent result of Ciesielski and Jasinski we study periodic point free Cantor systems that are conjugate to systems with vanishing derivative everywhere, and more generally locally radially shrinking maps. Our study uncovers a…
First a few reformulations of Frankl's conjecture are given, in terms of reduced families or matrices, or analogously in terms of lattices. These lead naturally to a stronger conjecture with a neat formulation which might be easier to…
We propose new restarting strategies for accelerated gradient and accelerated coordinate descent methods. Our main contribution is to show that the restarted method has a geometric rate of convergence for any restarting frequency, and so it…
Conway and Coxeter introduced frieze patterns in 1973 and classified them via triangulated polygons. The determinant of the matrix associated to a frieze table was computed explicitly by Broline, Crowe and Isaacs in 1974, a result…
After surveying classical results, we introduce a generalized notion of inference system to support structural recursion on non-well-founded data types. Besides axioms and inference rules with the usual meaning, a generalized inference…
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…