A state space isomorphism theorem for minimal dynamical systems

Consider a discrete time dynamical systemx _k+1=f(x _k ) on a compact metric spaceM, wheref:MM is a continuous map. Leth:MB ^k be a continuous output function. Suppose that all of the positive orbits off are dense and that the system is observable. We prove that any output trajectory of the system determinesf andh andM up to a homeomorphism. IfM is a compact Abelian topological group andf is an ergodic translation, then any output trajectory determines the system up to a translation and a group isomorphism of the group.     

A generalization of Kolmogorov’s theorem to biorthogonal systems

The fundamental Kolmogorov’s theorem about divergent trigonometric Fourier series is generalized to bounded biorthonormal systems defined on a separable metric space with Borel regular outer measure. Sharp lower bounds at points and on sets of positive measure are obtained for the arithmetic means of the symmetrized Lebesgue functions of biorthonormal systems defined on an arbitrary measure space. Earlier, similar results were obtained by the author for orthogonal systems on an interval.     

A generalization of Plantholt's theorem

Let K denote the complete graph K_2n+1 with each edge replicated r times and let χ′(G) denote the chromatic index of a multigraph G. A multigraph G is critical if χ′(G) > χ′(G/e) for each edge e of G. Let S be a set of sn – 1 edges of K. We show that, for 0 < s ≦ r, G/S is critical and that χ′ (G/(S ∪{e})) = 2rn + r – s for all e ∈ E(G/S). Plantholt [M. Plantholt, The chromatic index of graphs with a spanning star. J. Graph Theory 5 (1981) 5–13] proved this result in the case when r = 1.     

A generalization of Jung's theorem

Jung's theorem establishes a relation between circumradius and diameter of a convex body. Half of the diameter can be interpreted as the maximum of circumradii of all 1-dimensional sections or 1-dimensional orthogonal projections of a convex body. This point of view leads to two series of j-dimensional circumradii, defined via sections or projections. In this paper we study some relations between these circumradii and by this we find a natural generalization of Jung's theorem.I would like to thank Prof. Dr J. M. Wills, who called my attention to these generalized circumradii.     

A generalization of Barbashin-Krasovski theorem

The classical criterion of asymptotic stability of the zero solution of equations x^′=f(t,x) is that there exists a function V(t,x), a(‖x‖)?V(t,x)?b(‖x‖) for some a,b∈K, such that for some c∈K. In this paper we prove that if f(t,x) is bounded, is uniformly continuous and bounded, then the condition that can be weakened and replaced by and contains no complete trajectory of , t∈[−T,T], where , uniformly for (t,x)∈[−T,T]×BH.     

Massera's theorem for monotone dynamical systems in three dimensions

In this paper we give a variant of the classical second Massera's theorem for three-dimensional periodic systems, that satisfy different types of monotonicity assumptions.     

Nilsequences and a structure theorem for topological dynamical systems

We characterize inverse limits of nilsystems in topological dynamics, via a structure theorem for topological dynamical systems that is an analog of the structure theorem for measure preserving systems. We provide two applications of the structure. The first is to nilsequences, which have played an important role in recent developments in ergodic theory and additive combinatorics; we give a characterization that detects if a given sequence is a nilsequence by only testing properties locally, meaning on finite intervals. The second application is the construction of the maximal nilfactor of any order in a distal minimal topological dynamical system. We show that this factor can be defined via a certain generalization of the regionally proximal relation that is used to produce the maximal equicontinuous factor and corresponds to the case of order 1.     

A generalization of Norton's theorem for queueing networks

A general framework for aggregation and decomposition of product form queueing networks with state dependent routing and servicing is presented. By analogy with electrical circuit theory, the stations are grouped into clusters of subnetworks such that the process decomposes into a global process and a local process. Moreover, the local process factorizes into the subnetworks. The global process and the local processes can be analyzed separately as if they were independent. The global process describes the behaviour of the queuing network in which each cluster is aggregated into a single station, whereas the local process describes the behaviour of the subnetworks as if they are not part of the queueing network. The decomposition and aggregation method formalized in this paper allows us to first analyze the global behaviour of the queueing network and subsequently analyze the local behaviour of the subnetworks of interest or to aggregate clusters into single stations without affecting the behaviour of the rest of the queueing network. Conditions are provided such that:

- the global equilibrium distribution for aggregated clusters has a product form;

- this form can be obtained by merely monitoring the global behaviour;

- the computation of a detailed distribution, including its normalizing constant, can be decomposed into the computation of a global and a local distribution;

- the marginal distribution for the number of jobs at the stations of a cluster can be obtained by merely solving local behaviour.

As a special application, Norton's theorem for queueing networks is extended to queueing networks with state dependent routing such as due to capacity constraints at stations or at clusters of stations and state dependent servicing such as due to service delays for clusters of stations.     

A generalization of the Erdös-Ko-Rado theorem on finite set systems

A family $\text{T}$ of k-subsets of an n-set such that no more than r have pairwise fewer than s elements in common is maximum (for sufficiently large n) only if $\text{T}$ consists of all the k-sets containing at least one of r fixed disjoint s-subsets.     

A generalization of the remainder theorem and factor theorem

We propose a generalization of the classical Remainder Theorem for polynomials over commutative coefficient rings that allows calculating the remainder without using the long division method. As a consequence we obtain an extension of the classical Factor Theorem that provides a general divisibility criterion for polynomials. The arguments can be used in basic algebra courses and are suitable for building classroom/homework activities for college and high school students.     

A generalization of the Riesz-Fischer theorem

An analog is established, in a certain sense, of the Riesz-Fischer theorem for the space L^P, p1, and a corollary derived.Translated from Matematicheskie Zametki, Vol. 12, No. 4, pp. 365–372, October, 1972.