Related papers: On Scottish Book Problem 157
We establish the average-case hardness of the algorithmic problem of exact computation of the partition function associated with the Sherrington-Kirkpatrick model of spin glasses with Gaussian couplings and random external field. In…
In the early 1930's, Erwin Schroedinger, motivated by his quest for a more classical formulation of quantum mechanics, posed a large deviation problem for a cloud of independent Brownian particles. He showed that the solution to the problem…
The Green functions were first introduced by Green to compute the character table of GLn(q) in 1955. They were later generalized by Deligne and Lusztig for an arbitrary finite group of Lie type G(q) using l-adic cohomological methods…
In the open problem session of the FPSAC'03, R.P.Stanley gave an open problem. The purpose of this paper is to give a proof of this open problem. At the end of this paper we present certain corollaries involving the Big Schur functions and…
In the 90's a collection of Plethystic operators were introduced in [3], [7] and [8] to solve some Representation Theoretical problems arising from the Theory of Macdonald polynomials. This collection was enriched in the research that led…
The first purpose of this paper is to point out a curious result announced by Macaulay on the Hilbert function of a differential module in his famous book The Algebraic Theory of Modular Systems published in 1916. Indeed, on page 78/79 of…
In the 1980s Matthias Kreck developed a modified surgery theory with obstructions in a hardly understood monoid $l_n(Z[\pi])$. This paper presents a couple of purely algebraic tools to find out whether an element in $l_{2q}(R)$ is…
This paper includes notes to accompany a reading of Thue's 1914 paper "Probleme uber Veranderungen von Zeichenreihen nach gegebenen Reglen", along with a translation of that paper. Thue's 1914 paper is mainly famous for proving an early…
We consider an initial value problem of type $$ \frac{\partial u}{\partial t}={\cal F}(t,x,u,\partial_j u), \quad u(0,x)=\phi(x), $$ where $t$ is the time, $x \in \mathbb{R}^n $ and $u_0$ is a Clifford type algebra-valued function…
The notion of two-way automata was introduced at the very beginning of automata theory. In 1959, Rabin and Scott and, independently, Shepherdson, proved that these models, both in the deterministic and in the nondeterministic versions, have…
The history of computability theory and and the history of analysis are surprisingly intertwined since the beginning of the twentieth century. For one, \'Emil Borel discussed his ideas on computable real number functions in his introduction…
The problem of finding a (continuous) utility function for a semiorder has been studied since in 1956 R.D. Luce introduced in \emph{Econometrica} the notion. There was almost no results on the continuity of the representation. A similar…
In this paper we study the effect of stochastic perturbations on a common type of moving boundary value PDE's which endorse Stefan boundary conditions, or Stefan problems, and show the existence and uniqueness of the solutions to a number…
In 1977 Anthony Wickstead raised the question of the conditions for all band preserving linear operators to be order bounded in a vector lattice. This article overviews the main ideas and results on the Wickstead problem and its variations,…
This work investigates a new approach to find closed form analytical approximate solution of linear initial value problems. Classical Bernoulli polynomials have been used to derive a finite set of orthonormal polynomials and a finite…
This paper contributes to the conjecture of R. Scott and R. Styer which asserts that for any fixed relatively prime positive integers $a,b$ and $c$ all greater than 1 there is at most one solution to the equation $a^x+b^y=c^z$ in positive…
In a variety of applications, the problem comes up of describing the principal part of the inverse of a holomorphic operator at an eigenvalue in terms of left and right root functions associated to the eigenvalue. Such a description was…
The firing squad synchronization problem (FSSP, for short) is a problem in automata theory introduced in 1957 by John Myhill. Its goal is to design a finite automaton A such that, if copies of A are placed in a line and connected and are…
Consider a variant of the usual story about the iterative conception of sets. As usual, at every stage, you find all the (bland) sets of objects which you found earlier. But you also find the result of tapping any earlier-found object with…
Let $f\in \mathbb{Q}(x)$ be a non-constant rational function. We consider "Waring's Problem for $f(x)$," i.e., whether every element of $\bbq$ can be written as a bounded sum of elements of $\{f(a)\mid a\in \mathbb{Q}\}$. For rational…