Related papers: The Asymptotic Normalized Linear Complexity of Mul…

We study the palindrome complexity of infinite sequences on finite alphabets, i.e., the number of palindromic factors (blocks) of given length occurring in a given sequence. We survey the known results and obtain new results for some…

We prove results about subshifts with linear (word) complexity, meaning that $\limsup \frac{p(n)}{n} < \infty$, where for every $n$, $p(n)$ is the number of $n$-letter words appearing in sequences in the subshift. Denoting this limsup by…

Let $v(F)$ denote the number of vertices in a fixed connected pattern graph $F$. We show an infinite family of patterns $F$ such that the existence of a subgraph isomorphic to $F$ is expressible by a first-order sentence of quantifier depth…

We derive bounds on the asymptotic density of parity-check matrices and the achievable rates of binary linear block codes transmitted over memoryless binary-input output-symmetric (MBIOS) channels. The lower bounds on the density of…

Given a finitely generated module $M$ over a local ring $A$ of characteristic $p$ with $\pd M < \infty$, we study the asymptotic intersection multiplicity $\chi_\infty(M, A/\underline{x})$, where $\underline{x} = (x_1, \ldots, x_r)$ is a…

Let $\{U_n\}_{n \geqslant 0}$ and $\{G_m\}_{m \geqslant 0}$ be two linear recurrence sequences defined over the integers. We establish an asymptotic formula for the number of integers $c$ in the range $[-x, x]$ which can be represented as…

Let $\{U_n\}_{n \geq 0}$ and $\{V_m\}_{m \geq 0}$ be two linear recurrence sequences. We establish an asymptotic formula for the number of integers $c$ in the range $[-x, x]$ which can be represented as differences $ U_n - V_m$. In…

We study pairs and m--tuples of compositions of a positive integer n with parts restricted to a subset P of positive integers. We obtain some exact enumeration results for the number of tuples of such compositions having the same number of…

This paper deals with the Landesman-Lazer type problem of elliptic equations associated with homogeneous Dirichlet boundary conditions. By using some dynamical arguments we derive some new results on bifurcation from infinity and…

We study the Constraint Satisfaction Problem CSP(A), where A is first-order definable in (Z;+,1) and contains +. We prove such problems are either in P or NP-complete.

In this note, we are concerned with the asymptotic approximation of a class of double integrals which can be represented as an angular spectrum superposition. These double integrals typically appear in electromagnetic scattering problems.…

This paper develops an asymptotic likelihood theory for triangular arrays of stationary Gaussian time series depending on a multidimensional unknown parameter. We give sufficient conditions for the associated sequence of statistical models…

In this paper, the maximum L$q$-likelihood estimator (ML$q$E), a new parameter estimator based on nonextensive entropy [Kibernetika 3 (1967) 30--35] is introduced. The properties of the ML$q$E are studied via asymptotic analysis and…

We consider the uniform asymptotic expansion for the Gauss hypergeometric function \[F(a+\epsilon\lambda,m;c+\lambda;x),\qquad \lambda\to+\infty\] for $x<1$ and positive integer $m$ when the parameter $\epsilon>1$ and the constants $a$ and…

We derive an asymptotic formula for the number of strongly connected digraphs with $n$ vertices and $m$ arcs (directed edges), valid for $m-n\to\infty$ as $n\to \infty$ provided $m=O(n\log n)$. This fills the gap between Wright's results…

A novel asymptotic representation of the analytic solutions to a family of singularly perturbed $q-$difference-differential equations in the complex domain is obtained. Such asymptotic relation shows two different levels associated to the…

Let $\mathscr{I}$ be an ideal sheaf on $P^n$ defining a subscheme $X$. Associated to $\mathscr{I}$ there are two elementary invariants: the invariant $s$ which measures the positivity of $\mathscr{I}$, and the minimal number $d$ such that…

Multisequences over finite fields play a pushing role in the applications that relate to parallelization, such as word-based stream ciphers and pseudorandom vector generation. It is interesting to study the complexity measures for…

In this paper we study a semilinear elliptic problem on a bounded domain in $\R^2$ with large exponent in the nonlinear term. We consider positive solutions obtained by minimizing suitable functionals. We prove some asymtotic estimates…

We rigorously quantify the improvement in the sample complexity of variational divergence estimations for group-invariant distributions. In the cases of the Wasserstein-1 metric and the Lipschitz-regularized $\alpha$-divergences, the…