English
Related papers

Related papers: On Scottish Book Problem 157

200 papers

Using the ontological interpretation of quantum mechanics in a particular sense, we obtain the classical behaviour of the scale factor and two scalar fields, derived from a string effective action for the FRW time dependent model. Besides,…

High Energy Physics - Theory · Physics 2016-08-16 C. Martínez-Prieto , O. Obregón , J. Socorro

This paper is dedicated to studying the matrix solutions to the cubic Szeg\H{o} equation, introduced in G\'erard--Grellier (2009) arXiv:0906.4540, leading to the cubic matrix Szeg\H{o} equation on the torus, \begin{equation*} i \partial_t U…

Analysis of PDEs · Mathematics 2023-09-22 Ruoci Sun

In his 1987 paper entitled "Generalized String Matching", Abrahamson introduced {\em pattern matching with character classes} and provided the first efficient algorithm to solve it. The best known solution to date is due to Linhart and…

Data Structures and Algorithms · Computer Science 2021-01-01 Alberto Apostolico , Péter L. Erdős , István Miklós , Johannes Siemons

We extend the results of a work by L. H\"ormander in 1990 concerning the resolution of the characteristic Cauchy problem for second order wave equations with regular first order potentials. The geometrical background of this work was a…

Analysis of PDEs · Mathematics 2007-05-23 Jean-Philippe Nicolas

For almost 75 years, the general solution for the Schr\"odinger equation was assumed to be generated by an exponential or a time-ordered exponential known as the Dyson series. We study the unitarity of a solution in the case of a singular…

Quantum Physics · Physics 2024-12-24 Yair Mulian

We present an oracle problem, which we call the Repeated Randomness problem, that a quantum algorithm can solve in one query, while any classical algorithm requires $\Omega(\log n)$ queries, where the oracle function has $2^n$ inputs. This…

Quantum Physics · Physics 2015-03-17 Shelby Kimmel

Here we present a new approach to deal with first order ordinary differential equations (1ODEs), presenting functions. This method is an alternative to the one we have presented in [1]. In [2], we have establish the theoretical background…

Classical Analysis and ODEs · Mathematics 2023-01-06 L. G. S. Duarte , L. A. C. P. da Mota , A. B. M. M. Queiroz

In a 1976 landmark paper, Gordon James defined the regularisation maps on integer partition, yielding certain decomposition numbers for modular representations of $\mathfrak{S}_n$. We describe a generalisation of James's regularisation map…

Combinatorics · Mathematics 2021-05-13 Diego Millan Berdasco

We develop the Scott model of the programming language PCF in univalent type theory. Moreover, we work constructively and predicatively. To account for the non-termination in PCF, we use the lifting monad (also known as the partial map…

Logic · Mathematics 2021-06-24 Tom de Jong

In this note we derive a solution to the Schr\"odinger-type backward equation which satisfies a necessary boundary condition used in hitting-time problems [as described in Hern\'andez-del-Valle (2010a)]. We do so by using an idea introduced…

Probability · Mathematics 2010-09-06 Gerardo Hernández-del-Valle

We find an explicit sequence of univariate polynomials of arbitrary degree with optimal condition number. This solves a problem posed by Michael Shub and Stephen Smale in 1993.

Complex Variables · Mathematics 2021-06-29 Carlos Beltrán , Ujué Etayo , Jordi Marzo , Joaquim Ortega-Cerdà

Bibliometric indexes are customary used in evaluating the impact of scientific research, even though it is very well known that in different research areas they may range in very different intervals. Sometimes, this is evident even within a…

Digital Libraries · Computer Science 2014-03-18 Pierluigi Amodio , Luigi Brugnano

We consider a variant of the NP-hard problem of assigning jobs to machines to minimize the completion time of the last job. Usually, precedence constraints are given by a partial order on the set of jobs, and each job requires all its…

Discrete Mathematics · Computer Science 2020-03-09 Felix Happach

Functoriality conjecture is one of the central subjects of the present-day mathematics. Functoriality is the profound problem formulated by Robert Langlands in the late 1960s in order to establish nonabelian class field theory. In this…

Number Theory · Mathematics 2010-01-09 Jae-Hyun Yang

We construct an automaton group with a PSPACE-complete word problem, proving a conjecture due to Steinberg. Additionally, the constructed group has a provably more difficult, namely EXPSPACE-complete, compressed word problem and acts over a…

Formal Languages and Automata Theory · Computer Science 2021-07-20 Jan Philipp Wächter , Armin Weiß

Let the formal power series f in d variables with coefficients in an arbitrary field be a symmetric function decomposed as a series of Schur functions, and let f be a rational function whose denominator is a product of binomials of the form…

Rings and Algebras · Mathematics 2012-01-24 Francesca Benanti , Silvia Boumova , Vesselin Drensky , Georgi K. Genov , Plamen Koev

In his book entitled ''A System of Logic, Ratiocinative and Inductive'' (1843), John Stuart Mill proposed principles of inductive reasoning in the form of five canons. To date, these canons are classic methods for causal reasoning: they are…

Theoretical Economics · Economics 2025-05-16 Takahiro Suzuki , Michele Aleandri , Stefano Moretti

We generalize the results of Villarroel, Fokas and Ioannidou, Dai, Terng and Uhlenbeck to study the inverse scattering problem of the Ward equation with non-small data and solve the Cauchy problem of the Ward equation with a non-small…

Analysis of PDEs · Mathematics 2008-06-03 Derchyi Wu

Factorial series played a major role in Stirling's classic book "Methodus Differentialis" (1730), but now only a few specialists still use them. This article wants to show that this neglect is unjustified, and that factorial series are…

Numerical Analysis · Mathematics 2010-05-05 Ernst Joachim Weniger

A classic question in analytic number theory is to find asymptotics for $\sigma_{k}(x)$ and $\pi_{k}(x)$, the number of integers $n\leq x$ with exactly $k$ prime factors, where $\pi_{k}(x)$ has the added constraint that all the factors are…

Number Theory · Mathematics 2023-03-13 Eric Naslund
‹ Prev 1 3 4 5 6 7 10 Next ›