Related papers: The Pascal automorphism has a purely continuous sp…

We interpret the Pascal-adic transformation as a generalized induced automorphism (over odometer) and formulate the $\sigma$-finite analog of odometer which is also known as "Hajian-Kakutani transformation" (former "Ohio state example"). We…

We study the dynamics of a transformation that acts on infinite paths in the graph associated with Pascal's triangle. For each ergodic invariant measure the asymptotic law of the return time to cylinders is given by a step function. We…

We study the dynamics of the metrics generated by measure preserving transformations. We consider a sequence of average metrics and define the corresponding sequence of $\epsilon$-entropies ({\it scaling sequence}) of the measure with…

We prove that the so-called uniadic graph and its adic automorphism are Borel universal, i.e., every aperiodic Borel automorphism is isomorphic to the restriction of this automorphism to a subset invariant under the adic transformation, the…

We introduce and study dynamical systems and measures on stationary generalized Bratteli diagrams $B$ that are represented as the union of countably many classical Pascal-Bratteli diagrams. We describe all ergodic tail invariant measures on…

We suggest a combinatorial classification of metric filtrations in measure spaces; a complete invariant of such a filtration is its combinatorial scheme, a measure on the space of hierarchies of the group~$\mathbb Z$. In turn, the notion of…

Let T be the Pascal-adic transformation. For any measurable function g, we consider the corrections to the ergodic theorem sum_{k=0}^{j-1} g(T^k x) - j/l sum_{k=0}^{l-1} g(T^k x). When seen as graphs of functions defined on {0,...,l-1}, we…

The Laplacian matrix of a simple graph is the difference of the diagonal matrix of vertex degree and the (0,1) adjacency matrix. In the past decades, the Laplacian spectrum has received much more and more attention, since it has been…

We prove that every finite arc-transitive graph of valency twice a prime admits a nontrivial semiregular automorphism, that is, a non-identity automorphism whose cycles all have the same length. This is a special case of the Polycirculant…

The Euler graph has vertices labelled (n,k) for n=0,1,2,... and k=0,1,...,n, with k+1 edges from (n,k) to (n+1,k) and n-k+1 edges from (n,k) to (n+1,k+1). The number of paths from (0,0) to (n,k) is the Eulerian number A(n,k), the number of…

Irregularly sampling a spatially stationary random field does not yield a graph stationary signal in general. Based on this observation, we build a definition of graph stationarity based on intrinsic stationarity, a less restrictive…

We prove a new automorphy lifting theorem for l-adic representations where we impose a new condition at l, which we call `potential diagonalizability'. This result allows for `change of weight' and seems to be substantially more flexible…

We consider the (symmetric) Pascal matrix, in its finite and infinite versions, and prove the existence of symmetric tridiagonal matrices commuting with it by giving explicit expressions for these commuting matrices. This is achieved by…

We define the Pascal triangle of a discrete (gray scale) image as a pyramidal arrangement of complex-valued moments and we explore its geometric significance. In particular, we show that the entries of row k of this triangle correspond to…

The polycirculant conjecture asserts that every vertex-transitive digraph has a semiregular automorphism, that is, a nontrivial automorphism whose cycles all have the same length. In this paper we investigate the existence of semiregular…

The present state of mathematical diffraction theory for systems with continuous spectral components is reviewed and extended. We begin with a discussion of various characteristic examples with singular or absolutely continuous diffraction,…

We compare three transitivity properties of finite graphs, namely, for a positive integer $s$, $s$-distance transitivity, $s$-geodesic transitivity and $s$-arc transitivity. It is known that if a finite graph is $s$-arc transitive but not…

Isoradial graphs are a natural generalization of regular graphs which give, for many models of statistical mechanics, the right framework for studying models at criticality. In this survey paper, we first explain how isoradial graphs…

Let $A_1$ be the (first) Weyl algebra, and let $G$ be its automorphism group. We study the natural action of $G$ on the space of isomorphism classes of right ideals of $A_1$ (equivalently, of finitely generated rank 1 torsion-free right…

Consider the empirical autocovariance matrix at a given non-zero time lag based on observations from a multivariate complex Gaussian stationary time series. The spectral analysis of these autocovariance matrices can be useful in certain…