English
Related papers

Related papers: Almost periodic functions and an analytical method…

200 papers

Given an $n$-ary $k-$valued function $f$, $gap(f)$ denotes the minimal number of essential variables in $f$ which become fictive when identifying any two distinct essential variables in $f$. We particularly solve a problem concerning the…

Discrete Mathematics · Computer Science 2010-03-05 Slavcho Shtrakov , Joerg Koppitz

For fixed natural numbers $r$ and $s$, where $2\leq s \leq r$, we consider a representation of numbers from the interval $[0;\frac{r}{s-1}]$ obtained by encoding numbers by means of the alphabet $A=\{0,1,...,r\}$ via the expansion…

Number Theory · Mathematics 2026-01-27 M. V. Pratsiovytyi , S. P. Ratushniak , Yu. Yu. Vovk , Ya. V. Goncharenko

In this article we introduce a class of discontinuous almost automorphic functions which appears naturally in the study of almost automorphic solutions of differential equations with piecewise constant argument. Their fundamental properties…

Classical Analysis and ODEs · Mathematics 2013-06-06 A. Chavez , S. Castillo , M. Pinto

We investigate solutions to the functional equation $f(f(x)) = e^x$, which can be interpreted as the problem of finding a half iterate of the exponential map. While no elementary solution exists, we construct and analyze non-elementary…

Numerical Analysis · Mathematics 2025-09-30 Sanay Nesargi , Gregory Roudenko

This paper deals with the set of the real projections of the zeros of an arbitrary almost periodic function defined in a vertical strip $U$. It provides practical results in order to determine whether a real number belongs to the closure of…

Complex Variables · Mathematics 2018-05-08 J. M. Sepulcre , T. Vidal

We investigate finite sets of rational functions $\{ f_{1},f_{2}, \dots, f_{r} \}$ defined over some number field $K$ satisfying that any $t_{0} \in K$ is a $K_{p}$-value of one of the functions $f_{i}$ for almost all primes $p$ of $K$. We…

Number Theory · Mathematics 2024-08-19 Benjamin Klahn , Joachim König

We study the recursion-theoretic complexity of Positive Almost-Sure Termination ($\mathsf{PAST}$) in an imperative programming language with rational variables, bounded nondeterministic choice, and discrete probabilistic choice. A program…

Programming Languages · Computer Science 2023-10-30 Rupak Majumdar , V. R. Sathiyanarayana

We study the growth rate of the inclusion length of an almost periodic function. For a given a. p. function such growth rate depends on the algebraic structure of Fourier exponents, i. e. on how good they can be approximated by rational…

Dynamical Systems · Mathematics 2017-10-10 Mikhail Anikushin

In this paper, we analyze multi-dimensional $({\mathrm R}_{X},{\mathcal B})$-almost periodic type functions and multi-dimensional Bohr ${\mathcal B}$-almost periodic type functions. The main structural characterizations and composition…

Functional Analysis · Mathematics 2020-12-02 A. Chávez , K. Khalil , M. Kostić , M. Pinto

In 2014, Juul, Kurlberg, Madhu and Tucker asked the following: given $K$ a number field and $f$ a rational function with coefficients in $K$, if $f_\mathfrak{p}$ denotes the reduction of $f$ modulo a prime ideal $\mathfrak{p}$ in the ring…

Number Theory · Mathematics 2026-03-24 Santiago Radi

We provide evidence that it is computationally difficult to approximate the partition function of the ferromagnetic q-state Potts model when q>2. Specifically we show that the partition function is hard for the complexity class #RHPi_1…

Computational Complexity · Computer Science 2012-11-13 Leslie Ann Goldberg , Mark Jerrum

Szemer\'edi's regularity lemma and its variants are some of the most powerful tools in combinatorics. In this paper, we establish several results around the regularity lemma. First, we prove that whether or not we include the condition that…

Combinatorics · Mathematics 2019-04-12 Jacob Fox , László Miklós Lovász , Yufei Zhao

We consider a refinement of the partition function of graph homomorphisms and present a quasi-polynomial algorithm to compute it in a certain domain. As a corollary, we obtain quasi-polynomial algorithms for computing partition functions…

Combinatorics · Mathematics 2015-08-04 Alexander Barvinok , Pablo Soberón

If a function $f:\mathbb{R}\to\mathbb{R}$ can be represented as the sum of $n$ periodic functions as $f=f_1+\dots+f_n$ with $f(x+\alpha_j)=f(x)$ ($j=1,\dots,n$), then it also satisfies a corresponding $n$-order difference equation…

Classical Analysis and ODEs · Mathematics 2013-12-16 Bálint Farkas , Szilárd Révész

A remarkable connection has been established for antiferromagnetic 2-spin systems, including the Ising and hard-core models, showing that the computational complexity of approximating the partition function for graphs with maximum degree D…

Computational Complexity · Computer Science 2014-11-05 Andreas Galanis , Daniel Stefankovic , Eric Vigoda

The rook numbers are fairly well-studied in the literature. In this paper, we study the max-rook number of the Ferrers boards associated to integer partitions. We show its connections with the Durfee triangle of the partitions. The max-rook…

Combinatorics · Mathematics 2025-07-29 N. Guru Sharan

We prove an almost splitting theorem for the warped product space with warped function $f(r)=\cosh\left(r\sqrt{\frac{\lambda}{n-2}}\right)$.

Differential Geometry · Mathematics 2018-04-03 Paul Woon Yin Lee

This paper is devoted to the study of quasi-periodic properties of fractional order integrals and derivatives of periodic functions. Considering Riemann-Liouville and Caputo definitions, we discuss when the fractional derivative and when…

Classical Analysis and ODEs · Mathematics 2015-07-21 Iván Area , Jorge Losada , Juan J. Nieto

Let $\mu$ be a positive measure on the real line with locally finite support $\Lambda$ and integer masses such that its Fourier transform in the sense of distributions is a purely point measure. An explicit form is found for an entire…

Functional Analysis · Mathematics 2023-08-16 Sergii Favorov

Given a sequence of $N$ positive real numbers $\{a_1,a_2,..., a_N \}$, the number partitioning problem consists of partitioning them into two sets such that the absolute value of the difference of the sums of $a_j$ over the two sets is…

adap-org · Physics 2009-10-30 F F Ferreira , J F Fontanari