Related papers: Iterative method of construction of good rhythms
Let $n$ and $k$ be positive integers, and let $F$ be an alphabet of size $n$. A sequence over $F$ of length $m$ is a \emph{$k$-radius sequence} if any two distinct elements of $F$ occur within distance $k$ of each other somewhere in the…
Consider a mixing dynamical systems $([0,1], T, \mu)$, for instance a piecewise expanding interval map with a Gibbs measure $\mu$. Given a non-summable sequence $(m_k)$ of non-negative numbers, one may define $r_k (x)$ such that $\mu (B(x,…
Let $K$ be the graph on vertices $\{1, 2, 3, 4, 5\}$, and having all edges except $(4, 5)$. A continuous map $f:K\to \R^2$ is called an \emph{almost embedding} if $f$-images of non-adjacent edges are disjoint. Take the winding numbers of…
A continuous map $f$ from a compact interval $I$ into itself is densely (resp. generically) chaotic if the set of points $(x,y)$ such that $\limsup_{n\to+\infty}|f^n(x)-f^n(y)|>0$ and $\liminf_{n\to+\infty} |f^n(x)-f^n(y)|=0$ is dense…
We consider the Kirchhoff equation on tori of any dimension and we construct solutions whose Sobolev norms oscillates in a chaotic way on certain long time scales. The chaoticity is encoded in the time between oscillations of the norm,…
We construct, for every \(0<k<1\), a bounded globally univalent harmonic mapping \[ f=h+\overline g \colon \D\to\C \] such that \[ |g'(z)|\le k|h'(z)|,\qquad z\in\D, \] while the analytic part \(h\) is unbounded. The construction is based…
We consider odd symmetric (1+1)-scalar field models with one internal mode. Under natural and robust assumptions, including the Fermi golden rule, we prove the asymptotic stability of the kink by odd perturbations in the energy space. For…
A method is presented for the rhythmic parsing problem: Given a sequence of observed musical note onset times, we estimate the corresponding notated rhythm and tempo process. A graphical model is developed that represents the simultaneous…
The aim of this paper is fourfold. Firstly, we introduce and study the f-ultra-harmonic maps. Secondly, we recall the geometric dynamics generated by a first order normal PDE system and we give original results regarding the geometric…
For any order of growth $f(n)=o(\log n)$ we construct a finitely-generated group $G$ and a set of generators $S$ such that the Cayley graph of $G$ with respect to $S$ supports a harmonic function with growth $f$ but does not support any…
In this paper, we investigate properties of harmonic entire mappings. Firstly, we give the characterizations of the order and the type for a harmonic entire mapping $f=h+\overline{g}$, respectively, and also consider the relationship…
We derive a sufficient condition for stability in probability of an equilibrium of a randomly perturbed map in ${\mathbb R}^d$. This condition can be used to stabilize weakly unstable equilibria by random forcing. Analytical results on…
It is known that greedy methods perform well for maximizing monotone submodular functions. At the same time, such methods perform poorly in the face of non-monotonicity. In this paper, we show - arguably, surprisingly - that invoking the…
Consider a string of $n$ positions, i.e. a discrete string of length $n$. Units of length $k$ are placed at random on this string in such a way that they do not overlap, and as often as possible, i.e. until all spacings between neighboring…
Optimal linear-time algorithms for testing the planarity of a graph are well-known for over 35 years. However, these algorithms are quite involved and recent publications still try to give simpler linear-time tests. We give a simple…
We show that the number of isolated zeros of a harmonic map $h:\mathbb{R}^2\to \mathbb{R}^2$ inside the ball of radius $r$ can grow arbitrarily fast with $r$, while its maximal modulus grows in a controlled manner. This result is an…
We present a general scheme for the construction of new eficient generalized Schultz iterative methods for computing the inverse matrix. These methods have the form $$ X_{k+1} = X_k(a_0^{(k)}I+a_1^{(k)}AX_k),\quad k\in\mathbb{N}, $$ where…
A comprehensive overview of lattice rules and polynomial lattice rules is given for function spaces based on $\ell_p$ semi-norms. Good lattice rules and polynomial lattice rules are defined as those obtaining worst-case errors bounded by…
Kaprekar's Routine is an iteration process that, with each iteration, sorts the digits of a number in descending and ascending orders and uses their difference for the next iteration. In this paper, we successfully address the structure of…
Let $\mathrm{rex}(n, F)$ denote the maximum number of edges in an $n$-vertex graph that is regular and does not contain $F$ as a subgraph. We give lower bounds on $\mathrm{rex}(n, F)$, that are best possible up to a constant factor, when…