Displaying 1661 – 1680 of 2016

Showing per page

Spectral properties of a certain class of Carleman operators

S. M. Bahri (2007)

Archivum Mathematicum

The object of the present work is to construct all the generalized spectral functions of a certain class of Carleman operators in the Hilbert space L 2 X , μ and establish the corresponding expansion theorems, when the deficiency indices are (1,1). This is done by constructing the generalized resolvents of A and then using the Stieltjes inversion formula.

Stirling pairs

L. Carlitz (1978)

Rendiconti del Seminario Matematico della Università di Padova

Strong sequences and the weight of regular spaces

Marian Turzański (1992)

Commentationes Mathematicae Universitatis Carolinae

It will be shown that if in a family of sets there exists a strong sequence of the length ( κ λ ) + then this family contains a subfamily consisting of λ + pairwise disjoint sets. The method of strong sequences will be used for estimating the weight of regular spaces.

Strong sequences, binary families and Esenin-Volpin's theorem

Marian Turzański (1992)

Commentationes Mathematicae Universitatis Carolinae

One of the most important and well known theorem in the class of dyadic spaces is Esenin-Volpin's theorem of weight of dyadic spaces. The aim of this paper is to prove Esenin-Volpin's theorem in general form in class of thick spaces which possesses special subbases.

*-sturmian words and complexity

Izumi Nakashima, Jun-Ichi Tamura, Shin-Ichi Yasutomi (2003)

Journal de théorie des nombres de Bordeaux

We give analogs of the complexity p ( n ) and of Sturmian words which are called respectively the * -complexity p * ( n ) and * -Sturmian words. We show that the class of * -Sturmian words coincides with the class of words satisfying p * ( n ) n + 1 , and we determine the structure of * -Sturmian words. For a class of words satisfying p * ( n ) = n + 1 , we give a general formula and an upper bound for p ( n ) . Using this general formula, we give explicit formulae for p ( n ) for some words belonging to this class. In general, p ( n ) can take large values, namely,...

Substitutions, abstract number systems and the space filling property

Clemens Fuchs, Robert Tijdeman (2006)

Annales de l’institut Fourier

In this paper we study multi-dimensional words generated by fixed points of substitutions by projecting the integer points on the corresponding broken halfline. We show for a large class of substitutions that the resulting word is the restriction of a linear function modulo 1 and that it can be decided whether the resulting word is space filling or not. The proof uses lattices and the abstract number system associated with the substitution.

Substitutions on two letters, cutting segments and their projections

Sierk W. Rosema (2007)

Journal de Théorie des Nombres de Bordeaux

In this paper we study the structure of the projections of the finite cutting segments corresponding to unimodular substitutions over a two-letter alphabet. We show that such a projection is a block of letters if and only if the substitution is Sturmian. Applying the procedure of projecting the cutting segments corresponding to a Christoffel substitution twice results in the original substitution. This induces a duality on the set of Christoffel substitutions.

Succession rules and Deco polyominoes

Elena Barcucci, Sara Brunetti, Francesco Del Ristoro (2010)

RAIRO - Theoretical Informatics and Applications

In this paper, we examine the class of "deco" polyominoes and the succession rule describing their construction. These polyominoes are enumerated according to their directed height by factorial numbers. By changing some aspects of the "factorial" rule, we obtain some succession rules that describe various "deco" polyomino subclasses. By enumerating the subclasses according to their height and width, we find the following well-known numbers: Stirling numbers of the first and second kind,...

Currently displaying 1661 – 1680 of 2016