Related papers: Squares in Piatetski--Shapiro Sequences
This paper provides a survey of spherical designs and their applications, with a particular emphasis on the perspective of ``numerical analysis''. A set \(X_N\) of \(N\) points on the unit sphere \(\mathbb{S}^d\) is called a…
Consider the number of permutations in the symmetric group on n letters that contain c copies of a given pattern. As c varies (with n held fixed) these numbers form a sequence whose properties we study for the monotone patterns and the…
Rudin conjectured that there are never more than c N^(1/2) squares in an arithmetic progression of length N. Motivated by this surprisingly difficult problem we formulate more than twenty conjectures in harmonic analysis, analytic number…
We derive a general recurrence relation for squares of Fibonacci-like numbers. Various properties are developed, including double binomial summation identites.
We obtain best possible results for the number of coprime positive integer solutions of the equation in the title when $a$ is a positive integer, $b=p^{m}$, $2p^{m}$ or $4p^{m}$, where $m$ is a non-negative integer, $p$ is prime, $\gcd…
We introduce a complex-plane generalization of the consecutive level-spacing distribution, used to distinguish regular from chaotic quantum spectra. Our approach features the distribution of complex-valued ratios between nearest- and…
In this paper we study the solutions of different forms of fractional equations on the unit sphere $\mathbb{S}_{1}^{2}$ $\subset \mathbb{R}^{3}$ possessing the structure of time-dependent random fields. We study the correlation functions of…
For every pattern $P$, consisting of a finite set of points in the plane, $S_{P}(n,m)$ is defined as the largest number of similar copies of $P$ among sets of $n$ points in the plane without $m$ points on a line. A general construction,…
We count the number of walks of length n on a k-node circular digraph that cover all k nodes in two ways. The first way illustrates the transfer-matrix method. The second involves counting various classes of height-restricted lattice paths.…
We find the general solution to Polchinski's classical scattering equations for $1+1$ dimensional string theory. This allows efficient computation of scattering amplitudes in the standard Liouville $\times$ $c=1$ background. Moreover, the…
With the help of numerical simulations we study N-soliton scattering (N=3,4) in the (2+1)-dimensional CP^1 model with periodic boundary conditions. When the solitons are scattered from symmetrical configurations the scattering angles…
The algebraic area probability distribution of closed planar random walks of length N on a square lattice is considered. The generating function for the distribution satisfies a recurrence relation in which the combinatorics is encoded. A…
The exact computation of the nearest-neighbor spacing distribution P(s) is performed for a rectangular billiard with point-like scatterer inside for periodic and Dirichlet boundary conditions and it is demonstrated that for large s this…
In this paper, we study the Dvoretzky covering problem with non-uniformly distributed centers. When the probability law of the centers admits an absolutely continuous density which satisfies a regular condition on the set of essential…
We study how the order of N independent random walks in one dimension evolves with time. Our focus is statistical properties of the inversion number m, defined as the number of pairs that are out of sort with respect to the initial…
We use the fact that certain cosets of the stabilizer of points are pairwise conjugate in a symmetric group $S_n$ in order to construct recurrence relations for enumerating certain subsets of $S_n$. Occasionally one can find `closed form'…
Large-time patterns of general higher-order lump solutions in the KP-I equation are investigated. It is shown that when the index vector of the general lump solution is a sequence of consecutive odd integers starting from one, the…
Let $f(\mathbf x)$ be a non-singular quadratic form with sufficiently many mixed terms and $t$ an integer. For a sequence of weights $\mathcal A$ we study the number of weighted solutions to $f(\mathbf x) = t$. In particular, we give…
In this paper we analyze computational properties of the Diophantine problem (and its search variant) for spherical equations $\prod_{i=1}^m z_i^{-1} c_i z_i = 1$ (and its variants) over the class of finite metabelian groups…
We have studied several generalizations of Fibonacci sequences as the sequences with arbitrary initial values, the addition of two and more Fibonacci subsequences and Fibonacci polynomials with arbitrary bases. For Fibonacci numbers with…