Related papers: Almost periodic functions and an analytical method…

Let $G$ be an additive group of order $v$. A $k$-element subset $D$ of $G$ is called a $(v, k, \lambda, t)$-almost difference set if the expressions $gh^{-1}$, for $g$ and $h$ in $D$, represent $t$ of the non-identity elements in $G$…

The aim of this paper is to establish an abstract theory based on the so-called fractional-maximal distribution functions (FMDs). From the rough ideas introduced in~\cite{AM2007}, we develop and prove some abstract results related to the…

One of the most important recent developments in the complexity of approximate counting is the classification of the complexity of approximating the partition functions of antiferromagnetic 2-spin systems on bounded-degree graphs. This…

Let $X$ be a separable real Hilbert space. We show that for every Lipschitz function $f:X\rightarrow\mathbb{R}$, and for every $\epsilon>0$, there exists a Lipschitz, real analytic function $g:X\rightarrow\mathbb{R}$ such that…

Explicit expressions for restricted partition function $W(s,{\bf d}^m)$ and its quasiperiodic components $W_j(s,{\bf d}^m)$ (called {\em Sylvester waves}) for a set of positive integers ${\bf d}^m = \{d_1, d_2, ..., d_m\}$ are derived. The…

In many real world networks, there already exists a (not necessarily optimal) $k$-partitioning of the network. Oftentimes, one aims to find a $k$-partitioning with a smaller cut value for such networks by moving only a few nodes across…

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…

The Fast Multipole Method (FMM) obeys periodic boundary conditions "natively" if it uses a periodic Green function for computing the multipole expansion in the interaction zone of each FMM oct-tree node. One can define the "optimal" Green…

We study the exact learnability of real valued graph parameters $f$ which are known to be representable as partition functions which count the number of weighted homomorphisms into a graph $H$ with vertex weights $\alpha$ and edge weights…

We give a new framework for solving the fundamental problem of low-rank matrix completion, i.e., approximating a rank-$r$ matrix $\mathbf{M} \in \mathbb{R}^{m \times n}$ (where $m \ge n$) from random observations. First, we provide an…

We show that a problem on minimal periods of solutions of Lipschitz functional differential equations is closely related to the unique solvability of the periodic problem for linear functional differential equations. Sharp bounds for…

We consider summability methods generated by the class GM(2b). We generalize some related results of P. Pych-Taberska [Studia Math. XCVI (1990), 91-103] on strong approximation of almost periodic functions by their Fourier series and S. M.…

Given a compact basic semi-algebraic set $K\subset R^n\times R^m$, a simple set $B$ (box or ellipsoid), and some semi-algebraic function $f$, we consider sets defined with quantifiers, of the form $R_f:=\{x\in B: \mbox{$f(x,y)\leq 0$ for…

The probabilistic satisfiability of a logical expression is a fundamental concept known as the partition function in statistical physics and field theory, an evaluation of a related graph's Tutte polynomial in mathematics, and the…

Let p(n, k) denote the number of partitions of n into parts less than or equal to k. We show several properties of this function modulo 2. First, we prove that for fixed positive integers k and m, p(n,k) is periodic modulo m. Using this, we…

In this paper, we consider composition principles for generalized almost periodic functions. We prove several new composition principles for the classes of (asymptotically) Stepanov $p$-almost periodic functions and (asymptotically,…

The halting problem is undecidable --- but can it be solved for "most" inputs? This natural question was considered in a number of papers, in different settings. We revisit their results and show that most of them can be easily proven in a…

In this paper, we study the partition functions $\overline{R_\ell^\ast}(n)$, which count the number of overpartitions of $n$ where the non-overlined parts are $\ell$-regular for a given $\ell$. Using elementary techniques, as well as the…

Let $r,\,f$ be multiplicative functions with $r\geqslant 0$, $f$ is complex valued, $|f|\leqslant r$, and $r$ satisfies some standard growth hypotheses. Let $x$ be large, and assume that, for some real number $\tau$, the quantities…

We prove that star-like limit cycles of any planar polynomial system can also be seen either as solutions defined on a given interval of a new associated planar non-autonomous polynomial system or as heteroclinic solutions of a…