Related papers: On the Forsythe conjecture
Association models for a pair of random elements $X$ and $Y$ (e.g., vectors) are considered which specify the odds ratio function up to an unknown parameter $\bolds\theta$. These models are shown to be semiparametric in the sense that they…
The \textit{Collatz's conjecture} is an unsolved problem in mathematics. It is named after Lothar Collatz in 1973. The conjecture also known as Syrucuse conjecture or problem. Take any positive integer $ n $. If $ n $ is even then divide it…
In 1969 Harold Widom published his seminal paper, which gave a complete description of orthogonal and Chebyshev polynomials on a system of smooth Jordan curves. When there were Jordan arcs present the theory of orthogonal polynomials turned…
We identify a relationship between a certain family of random walks on Euclidean lattices and difference matrices over cyclic groups. We then use the techniques of Fourier analysis to estimate the return probabilities of these random walks,…
The recently introduced Gradient Methods with Memory use a subset of the past oracle information to create an accurate model of the objective function that enables them to surpass the Gradient Method in practical performance. The model…
In this paper we adopt a geometric point of view regarding a famous conjecture due to Littlewood in diophantine approximation of real numbers. Following the spirit of the geometric theory of continued fractions, we give a sufficient…
It is well known that the following Collatz Conjecture is one of the unsolved problems in mathematics. Collatz Conjecture: For any positive integer $n>1$, the following recursive algorithm will convergent to 1 by a finite number of steps.…
In 1985 Kazuya Kato formulated a fascinating framework of conjectures which generalizes the Hasse principle for the Brauer group of a global field to the so-called cohomological Hasse principle for an arithmetic scheme. In this paper we…
The generalized conditional gradient method is a popular algorithm for solving composite problems whose objective function is the sum of a smooth function and a nonsmooth convex function. Many convergence analyses of the algorithm rely on…
We present an algorithm, called BiSC, that describes the patterns avoided by a given set of permutations. It automatically conjectures the statements of known theorems such as the descriptions of stack-sortable (Knuth 1975) and…
The classical matrix-tree theorem was discovered by G.~Kirchhoff in 1847. It relates the principal minor of the Laplace (nxn)-matrix to a particular sum of monomials indexed by the set of trees with n vertices. The aim of this paper is to…
Furstenberg's $\times 2 \times 3$ conjecture has remained a central open problem in ergodic theory for over $50$ years, and it serves as the basic test case for a broad class of rigidity phenomena which are believed to hold in…
T.I. Zelenyak's ideas and method of 1968 are shown to apply to N-dimensional second- and higher-order parabolic equtions and ensure a fast exponential convergence to degenerate equilibria. The methotology applies to autonomous and perturbed…
This survey was written for the Current Developments in Mathematics conference, 2012, and is an updating of my article "The Strominger-Yau-Zaslow conjecture: From torus fibrations to degenerations," in the Seattle 2005 proceedings. We trace…
Reynold's parametricity theory captures the property that parametrically polymorphic functions behave uniformly: they produce related results on related instantiations. In dependently-typed programming languages, such relations and…
Recently ,mathematicians have been interested in studying the theory of discrete dynamical system, specifically difference equation, such that considerable works about discussing the behavior properties of its solutions (boundedness and…
A central challenge in statistical inference is the presence of confounding variables that may distort observed associations between treatment and outcome. Conventional "causal" methods, grounded in assumptions such as ignorability, exclude…
In 1962 Dyson used a physically based, macroscopic argument to deduce the first two terms of the large spacing asymptotic expansion of the gap probability for the bulk state of random matrix ensembles with symmetry parameter \beta. In the…
In Lett. Math. Phys. 114, 54 (2024) and 115, 70 (2025), the author introduces what is presented as a novel method for determining whether a sequence of orthogonal polynomials is "classical", based solely on its initial recurrence…
Quantifying the uncertainty of predictions is a core problem in modern statistics. Methods for predictive inference have been developed under a variety of assumptions, often -- for instance, in standard conformal prediction -- relying on…