Related papers: On the Forsythe conjecture

We derive and prove an explicit formula for the sum of the fractional parts of certain geometric series. Although the proof is straightforward, we have been unable to locate any reference to this result. This summation formula allows us to…

In this paper we prove that there exists an asymptotical diagonalization algorithm for a class of sparse Hermitian (or real symmetric) matrices if and only if the matrices become Hessenberg matrices after some permutation of rows and…

Rudin conjectured that there are never more than c N^(1/2) squares in an arithmetic progression of length N. Motivated by this surprisingly difficult problem we formulate more than twenty conjectures in harmonic analysis, analytic number…

In this paper we propose a variant of the random coordinate descent method for solving linearly constrained convex optimization problems with composite objective functions. If the smooth part of the objective function has Lipschitz…

We introduce the notion of joint torsion for several commuting operators satisfying a Fredholm condition. This new secondary invariant takes values in the group of invertibles of a field. It is constructed by comparing determinants…

The asymptotic behavior of the stochastic gradient algorithm with a biased gradient estimator is analyzed. Relying on arguments based on the dynamic system theory (chain-recurrence) and the differential geometry (Yomdin theorem and…

The convergence theory for the gradient sampling algorithm is extended to directionally Lipschitz functions. Although directionally Lipschitz functions are not necessarily locally Lipschitz, they are almost everywhere differentiable and…

We give asymptotic formulae for random matrix averages of derivatives of characteristic polynomials over the groups USp(2N), SO(2N) and O^-(2N). These averages are used to predict the asymptotic formulae for moments of derivatives of…

We prove Lusztig's conjectures ${\bf P1}$-${\bf P15}$ for the affine Weyl group of type $\tilde{C}_2$ for all choices of positive weight function. Our approach to computing Lusztig's $\mathbf{a}$-function is based on the notion of a…

A well-known conjecture states that the Whitney numbers of the second kind of a geometric lattice (simple matroid) are logarithmically concave. We show this conjecture to be equivalent to proving an upper bound on the number of new copoints…

Let $s(n)$ denote the number of ones in the binary expansion of a natural number $n\in\mathbb{N}$. For any $t\in\mathbb{N}$ and $d\in\mathbb{Z}$, let $\mu_t(d)$ denote the asymptotic density of the set of those natural numbers $n$ for which…

We revisit Eisenstein's geometric proof of quadratic reciprocity and make explicit the involutive symmetry underlying Eisenstein's lattice-point argument. Building on Gauss's lemma, we interpret the Legendre symbols as counts of lattice…

We provide a new projective condition for a stationary real random field indexed by the lattice $\Z^d$ to be well approximated by an orthomartingale in the sense of Cairoli (1969). Ourmain result can be viewed as a multidimensional version…

Kaltofen has proposed a new approach in [Kaltofen 1992] for computing matrix determinants. The algorithm is based on a baby steps/giant steps construction of Krylov subspaces, and computes the determinant as the constant term of a…

We introduce a flexible framework for making inferences about general linear forms of a large matrix based on noisy observations of a subset of its entries. In particular, under mild regularity conditions, we develop a universal procedure…

Recently Conrey, Farmer and Zirnbauer conjectured formulas for the averages over a family of ratios of products of shifted L-functions. Their L-functions Ratios Conjecture predicts both the main and lower order terms for many problems,…

We propose a conjugate logic that can capture the behavior of quantum and quantum-like systems. The proposal is similar to the more generic concept of epistemic logic: it encodes knowledge or perhaps more correctly, predictions about…

We propose new restarting strategies for the accelerated coordinate descent method. Our main contribution is to show that for a well chosen sequence of restarting times, the restarted method has a nearly geometric rate of convergence. A…

A universal and rigorous ensemble framework for nonequilibrium system remains lacking. Here, we provide a concise framework for the generalized ensemble theory of nonequilibrium discrete systems using matrix-based approach. By introducing…

This work builds on Varchenko et al's introduction of bilinear forms for hyperplane arrangements, where the determinant of the associated matrices factorizes into simple components. While one of the determinant formula developed by…