Related papers: On the Forsythe conjecture
In 1999 Merino and Welsh conjectured that evaluations of the Tutte polynomial of a graph satisfy an inequality. In this short article we show that the conjecture generalized to matroids holds for the large class of all split matroids by…
Nonconvex optimization is central to modern machine learning, but the general framework of nonconvex optimization yields weak convergence guarantees that are too pessimistic compared to practice. On the other hand, while convexity enables…
The Golub-Welsch algorithm [ Math. Comp., 23: 221-230 (1969)] has long been assumed symmetric for estimating quadratic forms. Recent research indicates that asymmetric quadrature nodes may be more often and the existence of a practical…
We show that Caratheodory's conjecture, on umbilical points of closed convex surfaces, may be reformulated in terms of the existence of at least one umbilic in the graphs of functions f: R^2-->R whose gradient decays uniformly faster than…
Theorems relating permutations with objects in other fields of mathematics are often stated in terms of avoided patterns. Examples include various classes of Schubert varieties from algebraic geometry (Billey and Abe 2013), commuting…
We solve several open problems concerning integer points of polytopes arising in symplectic and algebraic geometry. In this direction we give the first proof of a broad case of Ewald's Conjecture (1988) concerning symmetric integral points…
Conjecturing formulas and other symbolic relations occurs frequently in number theory and combinatorics. If we could automate conjecturing, we could benefit not only from speeding up, but also from finding conjectures previously out of our…
The asymptotic behaviour of a family of gradient algorithms (including the methods of steepest descent and minimum residues) for the optimisation of bounded quadratic operators in R^d and Hilbert spaces is analyzed. The results obtained…
In 1971, McMullen and Walkup posed the following conjecture, which is called the generalized lower bound conjecture: If $P$ is a simplicial $d$-polytope then its $h$-vector $(h_0,h_1,...,h_d)$ satisfies $h_0 \leq h_1 \leq ... \leq…
We study the first and second orders of the asymptotic expansion, as the dimension goes to infinity, of the moments of the Hilbert-Schmidt norm of a uniformly distributed matrix in the p-Schatten unit ball. We consider the case of matrices…
Motivated by the search for a counterexample to the Poincar\'e conjecture in three and four dimensions, the Andrews-Curtis conjecture was proposed in 1965. It is now generally suspected that the Andrews-Curtis conjecture is false, but small…
Yoshida's Conjecture formulated by H. Yoshida in 1989 states that in $\mathbb{C}^{2N}$ equipped with the canonical symplectic form $\mathrm{d}\mathbf{p} \wedge \mathrm{d} \mathbf{q},$ the Hamiltonian flow corresponding to the Hamiltonian…
R. Thom's gradient conjecture states that if a gradient flow of an analytic function converges to a limit, it does so along a unique limiting direction. In this paper, we extend and settle this conjecture in the context of infinite…
We survey Vojta's higher-dimensional generalizations of the $abc$ conjecture and Szpiro's conjecture as well as recent developments that apply them to various problems in arithmetic dynamics. In particular, the "$abcd$ conjecture" implies a…
Many statistical problems include model parameters that are defined as the solutions to optimization sub-problems. These include classical approaches such as profile likelihood as well as modern applications involving flow networks or…
The Cartesian reverse derivative is a categorical generalization of reverse-mode automatic differentiation. We use this operator to generalize several optimization algorithms, including a straightforward generalization of gradient descent…
The convolution of indicators of two conjugacy classes on the symmetric group S_q is usually a complicated linear combination of indicators of many conjugacy classes. Similarly, a product of the moments of the Jucys--Murphy element involves…
Doubly intractable problems occur when both the likelihood and the posterior are available only in unnormalised form, with computationally intractable normalisation constants. Bayesian inference then typically requires direct approximation…
In 2021, J.~Agler and J.~E. McCarthy proposed a two-step programme toward the celebrated Krzy\.z conjecture. The first step is to prove an entropy conjecture for polynomials whose zeros all lie on the unit circle; the second is to establish…
Connections of the conjugate gradient (CG) method with other methods in computational mathematics are surveyed, including the connections with the conjugate direction method, the subspace optimization method and the quasi-Newton method BFGS…