Related papers: Balanced rectangles over Sturmian words and minima…
Balancing square and rectangular tables by rotation has been a interesting way to illustrate the intermediate value theorem. The aim of this note is to show that the balancing act but with non-rectangular tables can be a nice application of…
Over an alphabet of size 3 we construct an infinite balanced word with critical exponent 2+sqrt(2)/2. Over an alphabet of size 4 we construct an infinite balanced word with critical exponent (5+sqrt(5))/4. Over larger alphabets, we give…
Certain inequalities between the values of the modular and the norm in the Orlicz spaces are established. These inequalities are applied then to the theory of solvability of nonlinear integral equations of Hammerstein type.
We consider the twin problems of estimating the effective rank and the Schatten norms $\|{\bf A}\|_{s}$ of a rectangular $p\times q$ matrix ${\bf A}$ from noisy observations. When $s$ is an even integer, we introduce a polynomial-time…
In this paper we use the relation of the index of an infinite aperiodic word and its recurrence function to give another characterization of Sturmian words. As a byproduct, we give a new proof of theorem describing the index of a Sturmian…
Meaningful comparison between sets of observations often necessitates alignment or registration between them, and the resulting optimization problems range in complexity from those admitting simple closed-form solutions to those requiring…
Given a finite group with a generating subset there is a well-established notion of length for a group element given in terms of its minimal length expression as a product of elements from the generating set. Recently, certain quantities…
Let n be an even positive integer and F be the field \GF(2). A word in F^n is called balanced if its Hamming weight is n/2. A subset C \subseteq F^n$ is called a balancing set if for every word y \in F^n there is a word x \in C such that y…
We introduce a property of compact complex manifolds under which the existence of balanced metric is stable by small deformations of the complex structure. This property, which is weaker than the $\partial\overline\partial$-Lemma, is…
Despite being fairly powerful, finite non-deterministic matrices are unable to characterize some logics of formal inconsistency, such as those found between $\textbf{mbCcl}$ and $\textbf{Cila}$. In order to overcome this limitation, we…
We study the asymptotic behavior of piecewise constant least squares regression estimates, when the number of partitions of the estimate is penalized. We show that the estimator is consistent in the relevant metric if the signal is in…
We consider binary rotation words generated by partitions of the unit circle to two intervals and give a precise formula for the number of such words of length n. We also give the precise asymptotics for it, which happens to be O(n^4). The…
In recent years several classical results in extremal graph theory have been improved in a uniform way and their proofs have been simplified and streamlined. These results include a new Erd\H{o}s-Stone-Bollob\'as theorem, several stability…
For an infinite word $x$, Bugeaud and Kim introduced a quantity $\mathrm{rep}(x)$ called the exponent of repetition of $x$. We prove that $\mathrm{rep}(x) = \mathrm{rep}(y)$ holds for a Sturmian word $x$ and every suffix $y$ of $x$. Let $c$…
We derive a discrete version of the stochastic Gronwall Lemma found in [Scheutzow, IDAQP, 2013]. The proof is based on a corresponding deterministic version of the discrete Gronwall Lemma and an inequality bounding the supremum in terms of…
The doorways problem considers adjacent parallel hallways of unit width each with a single doorway (aligned with integer lattice points) of unit width. It then asks, what are the properties of lines that pass through each doorway?…
Sturmian sequences are well-known as the ones having minimal complexity over a 2-letter alphabet. They are also the balanced sequences over a 2-letter alphabet and the sequences describing discrete lines. They are famous and have been…
We study approximability of regular constraint satisfaction problems, i.e., CSPs where each variable in an instance has the same number of occurrences. In particular, we show that for any CSP $\Lambda$, existence of an $\alpha$…
In this paper we obtain some weighted generalizations of Ostrowski type inequalities on time scales involving combination of weighted {\Delta}-integral means, i.e., a weighted Ostrowski type inequality on time scales involving combination…
We study orthogonal and symplectic matrix models with polynomial potentials and multi interval supports of the equilibrium measure. For these models we find the bounds (similar to the case of hermitian matrix models) for the rate of…