Here we give a characterization of Arnoux–Rauzy sequences by the way of the lexicographic orderings of their alphabet.

Here we give a characterization of Arnoux–Rauzy sequences by the way of the lexicographic orderings of their alphabet.

We study the boundary value problem $-{\mathrm{d}iv\left(\right(\left|\nabla u\right|}^{p_1\left(x\right)-2}+{\left|\nabla u\right|}^{p_2\left(x\right)-2}\left)\nabla u\right)=f(x,u)$ in $\Omega$, $u=0$ on $\partial \Omega$, where $\Omega$ is a smooth bounded domain in ${ℝ}^N$. Our attention is focused on two cases when $f(x,u)=\pm (-\lambda |u{|}^{m\left(x\right)-2}u+\left|u{|}^{q\left(x\right)-2}u\right)$, where $m\left(x\right)=max\{p_1\left(x\right),p_2\left(x\right)\}$ for any $x\in \overline{\Omega }$ or $m\left(x\right)<q\left(x\right)<\frac{N·m\left(x\right)}{(N-m(x\left)\right)}$ for any $x\in \overline{\Omega }$. In the former case we show the existence of infinitely many weak solutions for any $\lambda >0$. In the latter we prove that if $\lambda$ is large enough then there exists a nontrivial weak solution. Our approach relies on the variable exponent theory of generalized Lebesgue-Sobolev spaces, combined with a ${\mathbb{Z}}_2$-symmetric version for even functionals...

It is known that the class of factorizing codes, i.e., codes satisfying the factorization conjecture formulated by Schützenberger, is closed under two operations: the classical composition of codes and substitution of codes. A natural question which arises is whether a finite set $𝒪$ of operations exists such that each factorizing code can be obtained by using the operations in $𝒪$ and starting with prefix or suffix codes. $𝒪$ is named here a complete set of operations (for factorizing codes). We show...

It is known that the class of factorizing codes, i.e., codes satisfying the factorization conjecture formulated by Schützenberger, is closed under two operations: the classical composition of codes and substitution of codes. A natural question which arises is whether a finite set O of operations exists such that each factorizing code can be obtained by using the operations in O and starting with prefix or suffix codes. O is named here a complete set of operations (for factorizing codes). We show...

The analysis of dynamic contacts/impacts of several deformable bodies belongs to both theoretically and computationally complicated problems, because of the presence of unpleasant nonlinearities and of the need of effective contact detection. This paper sketches how such difficulties can be overcome, at least for a model problem with several elastic bodies, using i) the explicit time-discretization scheme and ii) the finite element technique adopted to contact evaluations together with iii) the...

The joint spectral radius of a finite set of real $d\times d$ matrices is defined to be the maximum possible exponential rate of growth of products of matrices drawn from that set. In previous work with K. G. Hare and J. Theys we showed that for a certain one-parameter family of pairs of matrices, this maximum possible rate of growth is attained along Sturmian sequences with a certain characteristic ratio which depends continuously upon the parameter. In this note we answer some open questions from that paper...

In the paper an interface is proposed that combines flexible (fuzzy) querying and data mining functionality. The point of departure is the fuzzy querying interface designed and implemented previously by the present authors. It makes it possible to formulate and execute, against a traditional (crisp) database, queries containing imprecisely specified conditions. Here we discuss possibilities to extend it with some data mining features. More specifically, linguistic summarization of data (databases),...

The paper is concerned with the existence of non-negative or positive solutions to $Af=\beta$, where $A$ is the vertex-edge incidence matrix of an undirected graph. The paper gives necessary and sufficient conditions for the existence of such a solution.

Fine and Wilf's theorem has recently been extended to words having three periods. Following the method of the authors we extend it to an arbitrary number of periods and deduce from that a characterization of generalized Arnoux-Rauzy sequences or episturmian infinite words.

It was shown that there is a statistical learning problem – a version of the expectation maximization (EMX) problem – whose consistency in a domain of cardinality continuum under the family of purely atomic probability measures and with finite hypotheses is equivalent to a version of the continuum hypothesis, and thus independent of ZFC. K. P. Hart had subsequently proved that no solution to the EMX problem can be Borel measurable with regard to an uncountable standard Borel structure on $X$, and...