Related papers: On Scottish Book Problem 157
We introduce an algebraic methodology for designing exactly-solvable Lie model Hamiltonians. The idea consists in looking at the algebra generated by bond operators. We illustrate how this method can be applied to solve numerous problems of…
Transcription into modern notations of the derivation by Stirling and De Moivre of an asymptotic series for $\log(n!)$, usually called Stirling's series. The previous discovery by Wallis of an infinite product for $\pi$, and later results…
Let $s$ be West's stack-sorting map, and let $s_{T}$ be the generalized stack-sorting map, where instead of being required to increase, the stack avoids subpermutations that are order-isomorphic to any permutation in the set $T$. In 2020,…
This paper gives insight into intriguing connections between two apparently unrelated theories: the theory of skein modules of 3-manifolds and the theory of representations of groups into special linear groups of 2 by 2 matrices. Let R be a…
Quantum computers are able to outperform classical algorithms. This was long recognized by the visionary Richard Feynman who pointed out in the 1980s that quantum mechanical problems were better solved with quantum machines. It was only in…
The accurate solution of some of the main problems in numerical linear algebra (linear system solving, eigenvalue computation, singular value computation and the least squares problem) for a totally positive Bernstein-Vandermonde matrix is…
In this survey we discuss some of the classical and modern methods in studying the (Riemann-)Schottky problem, the problem of characterizing Jacobians of curves among principally polarized abelian varieties. We present many of the recent…
We survey recent work, published since 2015, on equivariant Oka theory. The main results described in the survey are as follows. Homotopy principles for equivariant isomorphisms of Stein manifolds on which a reductive complex Lie group $G$…
We look for spectral type differential equations for the generalized Jacobi polynomials found by T.H. Koornwinder in 1984 and for the Sobolev-Laguerre polynomials. We introduce a method which makes use of computeralgebra packages like Maple…
This book develops the conjecture that all kinds of information processing in computers and in brains may usefully be understood as "information compression by multiple alignment, unification and search". This "SP theory", which has been…
Arthur's conjectures predict the existence of some very interesting unitary representations occurring in spaces of automorphic forms. We prove the unitarity of the "Langlands element" (i.e., the one specified by Arthur) of all unipotent…
In this paper, authors prove that if $X$ is a weak Asplund space, then the space $X\times R$ is a weak Asplund space. Thus the author definitely answered an open problem raised by D.G. Larman and R.R. Phelps for 45 years ago (J. London.…
We are describing relations between Schr\"odinger's variational problem and Onsager's approach to nonequilibrium statistical mechanics. Although the second work on reciprocal relations and detailed balance has been published in the same…
We propose a new algorithm for computing validated bounds for the solutions to the first order variational equations associated to ODEs. These validated solutions are the kernel of numerics computer-assisted proofs in dynamical systems…
The basic mathematical properties of Green's functions used in statistical mechanics as well as the equations defining these functions and the techniques of solving these equations are reviewed. An approach is presented called the…
The dynamic programming solution to the traveling salesman problem due to Bellman, and independently Held and Karp, runs in time $O(2^n n^2)$, with no improvement in the last sixty years. We break this barrier for the first time by…
Let $P(k,n)$ be the set of products of $k$ factors from the set $\{1,\ldots , n\}.$ In 1955, Erd\H{o}s posed the problem of determining the order of magnitude of $|P (2, n)|$ and proved that $|P (2, n)| = o(n^2 )$ for $n \to\infty$. In…
Let ${\cal{D}}$ = $\{d_1, d_2, d_3, ..., d_D\}$ be a given set of $D$ (string) documents of total length $n$. The top-$k$ document retrieval problem is to index $\cal{D}$ such that when a pattern $P$ of length $p$, and a parameter $k$ come…
We consider the problem of sorting elements on a series of stacks, introduced by Tarjan and Knuth. We improve the asymptotic lower bound for the number of stacks necessary to sort $n$ elements to $0.561 \log_2 n + O(1)$. This is the first…
In 1952, Michael posed a question about the functional continuity of commutative Frechet algebras in his memoir, known as Michael problem in the literature. We settle this in the affirmative along with its various equivalent forms, even for…