Topologically transitive skew-products of backward shift operators and hypercyclicity

In this article we look at skew-products of multiples of the backward shift and examine conditions under which the skew-product is topologically transitive or hypercyclic in the second coordinate. We also give an application of the theory to iterated function systems of multiples of backward shift operators.

     

Enumerating Quartic Dihedral Extensions of ℚ

We give an explicit Dirichlet series for the generating function of the discriminants of quartic dihedral extensions of . From this series we deduce an asymptotic formula for the number of isomorphism classes of such quartic extensions with discriminant up to a given bound. On the other hand, by using essentially classical results of genus theory combined with elementary analytical methods such as the method of the hyperbola, we show how to compute exactly this number up to quite large bounds, and we give a table of selected values.     

The computable embedding problem

Calvert calculated the complexity of the computable isomorphism problem for a number of familiar classes of structures. Rosendal suggested that it might be interesting to do the same for the computable embedding problem. By the computable isomorphism problem and (computable embedding problem) we mean the difficulty of determining whether there exists an isomorphism (embedding) between two members of a class of computable structures. For some classes, such as the class of \mathbbQ \mathbb{Q} -vector spaces and the class of linear orderings, it turns out that the two problems have the same complexity. Moreover, calculations are essentially the same. For other classes, there are differences. We present examples in which the embedding problem is trivial (within the class) and the computable isomorphism problem is more complicated. We also give an example in which the embedding problem is more complicated than the isomorphism problem.     

POSITIVITY METHODS FOR DICHOTOMY OF LINEAR SKEW-PRODUCT FLOWS ON HILBERT SPACES

Abstract

In [Na-Rh] we developed a method based on positivity in order to characterize the stability of the evolution family corresponding to the nonautonomous Cauchy problem in Hilbert spaces. This method is extended to the study of hyperbolicity of linear skew-products. We also show that exponential dichotomy of a linear skew-product flow is equivalent to the existence of a Hermitian valued solution of some linear Riccati equation.     

Generalized symmetric planes

In this paper we relate the theory of stable planes to the theory of generalized symmetric spaces in the sense of differential geometry where the symmetries may be of arbitrary order. This leads to the notion of a generalized symmetric plane. We assign to every generalized symmetric plane an associated infinitesimal model and show that the associated infinitesimal model essentially determines a generalized symmetric plane up to global isomorphism. In particular, every generalized symmetric plane with an abelian group of transvections is a topological translation plane.     

Absolutely continuous invariant measures for random non-uniformly expanding maps

We prove existence of (at most denumerable many) absolutely continuous invariant probability measures for random one-dimensional dynamical systems with asymptotic expansion. If the rate of expansion (Lyapunov exponents) is bounded away from zero, we obtain finitely many ergodic absolutely continuous invariant probability measures, describing the asymptotics of almost every point. We also prove a similar result for higher-dimensional random non-uniformly expanding dynamical systems. The results are consequences of the construction of such measures for skew-products with essentially arbitrary base dynamics and asymptotic expansion along the fibers. In both cases our method deals with either critical o singular points for the random maps.     

Discrete and continuous Yang-Mills measure for non-trivial bundles over compact surfaces

In this paper, we construct one Yang-Mills measure on an orientable compact surface for each isomorphism class of principal bundles with compact connected structure group over this surface. For this, we refine the discretization procedure used in a previous construction [9] and define a discrete theory on a new configuration space which is essentially a covering of the usual one. We prove that the measures corresponding to different isomorphism classes of bundles or to different total areas of the base space are mutually singular. We give also a combinatorial computation of the partition functions which relies on the formalism of fat graphs.     

The connected partition lattice of a graph and the reconstruction conjecture

Previously we showed that many invariants of a graph can be computed from its abstract induced subgraph poset, which is the isomorphism class of the induced subgraph poset, suitably weighted by subgraph counting numbers. In this paper, we study the abstract bond lattice of a graph, which is the isomorphism class of the lattice of distinct unlabelled connected partitions of a graph, suitably weighted by subgraph counting numbers. We show that these two abstract posets can be constructed from each other except in a few trivial cases. The constructions rely on certain generalisations of a lemma of Kocay in graph reconstruction theory to abstract induced subgraph posets. As a corollary, trees are reconstructible from their abstract bond lattice. We show that the chromatic symmetric function and the symmetric Tutte polynomial of a graph can be computed from its abstract induced subgraph poset. Stanley has asked if every tree is determined up to isomorphism by its chromatic symmetric function. We prove a counting lemma, and indicate future directions for a study of Stanley's question.     

Applications of game theory to threshold logic

Recently,Owen demonstrated an isomorphism between characteristic function games and pseudo-Boolean functions. When a game is interpreted as a function on a lattice, then properties of pseudo-Boolean inequalities can be related to partitions of the lattice. The isomorphism also has important implications for threshold logic. In particular, by using a special reflection map, unate switching functions can be studied via monotone simple games. We can show that every unate switching function can be written as the join threshold functions. Also, using the ideas ofCharnes, Kortanek andKeene, we can give several ways to calculate approximate threshold inequalities for unate switching functions.     

L- and R-Cross-Sections in the Brauer Semigroup

We classify all cross-sections of Green's relations L and R in the Brauer semigroup. The regular behavior of such cross-sections starts from n = 7. We show that in the regular case there are essentially two different cross-sections and all others are S_n-conjugated to one of these two. We also classify all cross-sections up to isomorphism.     

Isomorphisms of Kac-Moody groups which preserve bounded subgroups

A subgroup of a Kac-Moody group is called bounded if it is contained in the intersection of two finite type parabolic subgroups of opposite signs. In this paper, we study the isomorphisms between Kac-Moody groups over arbitrary fields of cardinality at least 4, which preserve the set of bounded subgroups. We show that such an isomorphism between two such Kac-Moody groups induces an isomorphism between the respective twin root data of these groups. As a consequence, we obtain the solution of the isomorphism problem for Kac-Moody groups over finite fields of cardinality at least 4.     

Lowness for isomorphism,countable ideals,and computable traceability

We show that every countable ideal of degrees that are low for isomorphism is contained in a principal ideal of degrees that are low for isomorphism by adapting an exact pair construction. We further show that within the hyperimmune free degrees, lowness for isomorphism is entirely independent of computable traceability.     

Combinatorial invariance of Kazhdan-Lusztig polynomials on intervals starting from the identity

We show that for Bruhat intervals starting from the identity in Coxeter groups the conjecture of Lusztig and Dyer holds, that is, the R-polynomials and the Kazhdan-Lusztig polynomials defined on [e,u] only depend on the isomorphism type of [e,u]. To achieve this we use the purely poset-theoretic notion of special matching. Our approach is essentially a synthesis of the explicit formula for special matchings discovered by Brenti and the general special matching machinery developed by Du Cloux.     

Explicit Construction and Uniqueness for Universal Operator Algebras of Directed Graphs

Given a directed graph, there exist a universal operator algebraand universal C*-algebra associated to the directed graph. Inthis paper we give intrinsic constructions for these objects.We also provide an explicit construction for the maximal C*-algebraof an operator algebra. We discuss uniqueness of the universalalgebras for finite graphs, showing that for finite graphs thegraph is an isomorphism invariant for the universal operatoralgebra of a directed graph. We show that the underlying undirectedgraph is a Banach algebra isomorphism invariant for the universalC*-algebra of a directed graph.     

Lie isomorphisms of reflexive algebras

A Lie isomorphism ? between algebras is called trivial if ?=ψ+τ, where ψ is an (algebraic) isomorphism or a negative of an (algebraic) anti-isomorphism, and τ is a linear map with image in the center vanishing on each commutator. In this paper, we investigate the conditions for the triviality of Lie isomorphisms from reflexive algebras with completely distributive and commutative lattices (CDCSL). In particular, we prove that a Lie isomorphism between irreducible CDCSL algebras is trivial if and only if it preserves I-idempotent operators (the sum of an idempotent and a scalar multiple of the identity) in both directions. We also prove the triviality of each Lie isomorphism from a CDCSL algebra onto a CSL algebra which has a comparable invariant projection with rank and corank not one. Some examples of Lie isomorphisms are presented to show the sharpness of the conditions.     

A spatial voting model where proportional rule leads to two-party equilibria

In this paper we show that in a simple spatial model where the government is chosen under strict proportional rule, if the outcome function is a linear combination of parties’ positions, with coefficient equal to their shares of votes, essentially only a two-party equilibrium exists. The two parties taking a positive number of votes are the two extremist ones. Applications of this result include an extension of the well-known Alesina and Rosenthal model of divided government as well as a modified version of Besley and Coate’s model of representative democracy.      

Long-time limit for a class of quadratic infinite-dimensional dynamical systems inspired by models of viscoelastic fluids

We study a class of quadratic, infinite-dimensional dynamical systems, inspired by models for viscoelastic fluids. We prove that these equations define a semi-flow on the cone of positive, essentially bounded functions. As time tends to infinity, the solutions tend to an equilibrium manifold in the L²-norm. Convergence to a particular function on the equilibrium manifold is only proved under additional assumptions. We discuss several possible generalizations.     

Essentially doubly stochastic matrices

In this paper we extend the general theory of essentially doubly stochastic (e.d.s.) matrices begun in earlier papers in this series. We complete the investigation in one direction by characterizing all of the algebra isomorphisms between the algebra of e.d.s. matrices of order n over a field F,E_n(F), and the total algebra of matrices of order n - 1over F,M_n-1(F) We then develop some of the theory when Fis a field with an involution. We show that for any e,f§Fof norm 1,e≠f every e.d.s. matrix in E_n(F) is a unique e.d.s. sum of an e.d.s. e-hermitian matrix and an e.d.s. f-hermitian matrix in E_n(F) Next, we completely determine the cases for which there exists an above-mentioned matrix algebra isomorphism preserving adjoints. Finally, we consider cogredience in E_n(F) and show that when such an adjoint-preserving isomorphism exists and char M_n(F) two e.d.s. e-hermitian matrices which are cogredient in M_n(F) are also cogredient in E_n(F). Using this result, we obtain simple canonical forms for cogredience of e.d.s. e-hermitian matrices in E_n(F) when Fsatisfies special conditions. This ncludes the e.d.s. skew-symmetric matrices, where the involution is trivial and E = -1.     

Hilbert space representations of decoherence functionals and quantum measures

We show that any decoherence functional D can be represented by a spanning vector-valued measure on a complex Hilbert space. Moreover, this representation is unique up to an isomorphism when the system is finite. We consider the natural map U from the history Hilbert space K to the standard Hilbert space H of the usual quantum formulation. We show that U is an isomorphism from K onto a closed subspace of H and that U is an isomorphism from K onto H if and only if the representation is spanning. We then apply this work to show that a quantum measure has a Hilbert space representation if and only if it is strongly positive. We also discuss classical decoherence functionals, operator-valued measures and quantum operator measures.