Moduli spaces for fundamental groups and link invariants derived from the lower central series

We consider an algebraic parametrization for the set of (Mal'cev completed) fundamental groups of the spaces with fixed first two Betti numbers, having in mind applications in low-dimensional topology and especially in link theory. The factor set of (restricted) isomorphism types of these groups acquires the structure of a ‘moduli space’, giving rise to invariants which, in the case of links, detect the isotopy type. We indicate two methods of computation for these invariants. We also prove a rigidity result for the associated graded Lie algebra of the fundamental group. A lot of examples are given.     

Generic adjoints in comtrans algebras of bilinear spaces

As a first step towards a general structure theory for comtrans algebras (modeled loosely on the Cartan theory for Lie algebras), this paper investigates comtrans algebras of bilinear spaces. Attention focuses on invariants associated with comtrans algebras, and the extent to which these invariants may serve to specify the algebras up to isomorphism within certain classes. Over fields whose characteristic differs from two, comtrans algebras of symmetric forms are determined up to isomorphism by the eigenvalues of generic adjoints, while comtrans algebras of symplectic forms are determined by the dimensions of maximal abelian subalgebras. Examples show that the multiplicity of zero as a root of the characteristic polynomial is generally independent of the dimension of a maximal abelian subalgebra.     

Finite-order invariants of ornaments

Anornament is a collection of oriented closed curves in a plane, no three of which intersect at the same point. We consider homotopy invariants of ornaments. Thefinite-order invariants of ornaments are a natural analog of the Vassiliev invariants of links. The calculation of them is based on the homological study of the corresponding space of singular objects. We perform the “local” part of these calculations and a part of the “global” one, which allows us to estimate the dimensions of the spaces of invariants of any order. We also construct explicity two large series of such invariants and establish some new algebraic structures in the space of invariants. Translated from Itogi Nauki i Tekhniki, Seriya Sovremennaya Matematika i Ee Prilozheniya. Tematicheskie Obzory. Vol. 35, Algebraicheskaya Geometriya-6, 1996.     

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.     

Antidesigns and regularity of partial spreads in dual polar graphs

We give several examples of designs and antidesigns in classical finite polar spaces. These types of subsets of maximal totally isotropic subspaces generalize the dualization of the concepts of m ‐ovoids and tight sets of points in generalized quadrangles. We also consider regularity of partial spreads and spreads. The techniques that we apply were developed by Delsarte. In some polar spaces of small rank, some of these subsets turn out to be completely regular codes. © 2010 Wiley Periodicals, Inc. J Combin Designs 19: 202‐216, 2011     

Conditional pressure and coding

We use pressure to obtain invariants for bounded-to-one block homomorphisms between Markov shifts. These invariants enable us to show that if there is a bounded-to-one block homomorphism between Bernoulli shifts given by probability vectorsp andq thenq may be obtained fromp by a permutation. The invariants may be viewed as conditional pressures; a convergence theorem for eigenmeasures of Ruelle operators motivates the definition of conditional pressure and helps establish our invariants for regular isomorphism of Markov shifts. It follows that Bernoulli shifts given by probability vectorsp andq are regularly isomorphic iffq is a permutation ofp. We employ our invariants also in the context of a finite equivalence. Finally we indicate that ratio variational principles yield further invariants.     

Some p-Ranks Related to Orthogonal Spaces

We determine the p-rank of the incidence matrix of hyperplanes of PG(n, p ^e) and points of a nondegenerate quadric. This yields new bounds for ovoids and the size of caps in finite orthogonal spaces. In particular, we show the nonexistence of ovoids in and . We also give slightly weaker bounds for more general finite classical polar spaces. Another application is the determination of certain explicit bases for the code of PG(2, p) using secants, or tangents and passants, of a nondegenerate conic.     

Auslander–Bridger Modules

Classically, the Auslander–Bridger transpose finds its best applications in the well-known setting of finitely presented modules over a semiperfect ring. We introduce a class of modules over an arbitrary ring R, which we call Auslander–Bridger modules, with the property that the Auslander–Bridger transpose induces a well-behaved bijection between isomorphism classes of Auslander–Bridger right R-modules and isomorphism classes of Auslander–Bridger left R-modules. Thus we generalize what happens for finitely presented modules over a semiperfect ring. Auslander–Bridger modules are characterized by two invariants (epi-isomorphism class and lower-isomorphism class), which are interchanged by the transpose. Via a suitable duality, we find that kernels of morphisms between injective modules of finite Goldie dimension are also characterized by two invariants (mono-isomorphism class and upper-isomorphism class).     

Hyperbolic structure preserving isomorphisms of Markov shifts

In this paper we consider metric isomorphisms of Markov shifts which are also isomorphisms of the hyperbolic structures of the shift spaces. We prove that such isomorphisms need not be finitary, and that finitary isomorphisms need not preserve the hyperbolic structures unless they have finite expected code lengths. In particular we show that certain explicity computable invariants previously associated with finitary isomorphisms with finite expected code lengths are, in fact, invariants of the hyperbolic structure of the Markov shifts.     

Even infinite-dimensional real Banach spaces

This article is a continuation of a paper of the first author [V. Ferenczi, Uniqueness of complex structure and real hereditarily indecomposable Banach spaces, Adv. Math. 213 (1) (2007) 462–488] about complex structures on real Banach spaces. We define a notion of even infinite-dimensional real Banach space, and prove that there exist even spaces, including HI or unconditional examples from [V. Ferenczi, Uniqueness of complex structure and real hereditarily indecomposable Banach spaces, Adv. Math. 213 (1) (2007) 462–488] and C(K) examples due to Plebanek [G. Plebanek, A construction of a Banach space C(K) with few operators, Topology Appl. 143 (2004) 217–239]. We extend results of [V. Ferenczi, Uniqueness of complex structure and real hereditarily indecomposable Banach spaces, Adv. Math. 213 (1) (2007) 462–488] relating the set of complex structures up to isomorphism on a real space to a group associated to inessential operators on that space, and give characterizations of even spaces in terms of this group. We also generalize results of [V. Ferenczi, Uniqueness of complex structure and real hereditarily indecomposable Banach spaces, Adv. Math. 213 (1) (2007) 462–488] about totally incomparable complex structures to essentially incomparable complex structures, while showing that the complex version of a space defined by S. Argyros and A. Manoussakis [S. Argyros, A. Manoussakis, An indecomposable and unconditionally saturated Banach space, Studia Math. 159 (1) (2003) 1–32] provides examples of essentially incomparable complex structures which are not totally incomparable.     

The completeness of the isomorphism relation for countable Boolean algebras

We show that the isomorphism relation for countable Boolean algebras is Borel complete, i.e., the isomorphism relation for arbitrary countable structures is Borel reducible to that for countable Boolean algebras. This implies that Ketonen's classification of countable Boolean algebras is optimal in the sense that the kind of objects used for the complete invariants cannot be improved in an essential way. We also give a stronger form of the Vaught conjecture for Boolean algebras which states that, for any complete first-order theory of Boolean algebras that has more than one countable model up to isomorphism, the class of countable models for the theory is Borel complete. The results are applied to settle many other classification problems related to countable Boolean algebras and separable Boolean spaces. In particular, we will show that the following equivalence relations are Borel complete: the translation equivalence between closed subsets of the Cantor space, the isomorphism relation between ideals of the countable atomless Boolean algebra, the conjugacy equivalence of the autohomeomorphisms of the Cantor space, etc. Another corollary of our results is the Borel completeness of the commutative AF -algebras, which in turn gives rise to similar results for Bratteli diagrams and dimension groups.

     

Constructing finitary isomorphisms with finite expected coding times

This paper is motivated by the question of whether the invariants β, Δ,cΔ completely characterize isomorphism of Markov chains by finitary isomorphisms that have finite expected coding times (fect). We construct a finitary isomorphism with fect under an additional condition. Whether coincidence of β, Δ,cΔ implies the required condition remains open.     

Eigenvalues of the difference and product of projections

There is an isomorphism between the matrices over the Boolean algebra of subsets of a k-element set and the k-tuples of Boolean binary (i.e. zero-one) matrices. This isomorphism allows many problems concerning nonbinary Boolean matrices to the referred to the binary ease. However, there are some features of the general (i.e. nonbinary) case that have not been mentioned, although they differ somewhat from the binary case. We exhibit characterizations of the linear operators that preserve several invariants of matrices over finite Boolean algebras to illustrate the differences and similarities of the general vs. the binary cases. We employ a canonical form that is useful in applying the isomorphism.     

Almost topological dynamical systems

For the notion of finitary isomorphism, which arises in many examples in ergodic theory, we prove some basic theorems about invariants, representations and the central limit theorem in shift spaces.     

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.     

b-Functions associated with quivers of type A

We study the b-functions of relative invariants of the prehomogeneous vector spaces associated with quivers of type A. By applying the decomposition formula for b-functions, we determine explicitly the b-functions of one variable for each irreducible relative invariant. Moreover, we give a graphical algorithm to determine the b-functions of several variables.     

The moduli space of stable vector bundles over a real algebraic curve

We study the spaces of stable real and quaternionic vector bundles on a real algebraic curve. The basic relationship is established with unitary representations of an extension of \mathbbZ/2{\mathbb{Z}/2} by the fundamental group. By comparison with the space of real or quaternionic connections, some of the basic topological invariants of these spaces are calculated.     

Rankin-Cohen Brackets and Invariant Theory

Using maps due to Ozeki and Broué-Enguehard between graded spaces of invariants for certain finite groups and the algebra of modular forms of even weight we equip these invariants spaces with a differential operator which gives them the structure of a Rankin-Cohen algebra. A direct interpretation of the Rankin-Cohen bracket in terms of transvectant for the group SL(2, C) is given.     

Complexity of a knot invariant

The algebraic structures called quandles constitute a complete invariant for tame knots. However, determining when two quandles are isomorphic is an empirically hard problem, so there is some dissatisfaction with quandles as knot invariants. We have confirmed this apparent difficulty, showing within the framework of Borel reducibility that the general isomorphism problem for quandles is as complex as possible. (© 2016 Wiley-VCH Verlag GmbH & Co. KGaA, Weinheim)     

Partial ovoids and partial spreads in hermitian polar spaces

We present improved lower bounds on the sizes of small maximal partial ovoids in the classical hermitian polar spaces, and improved upper bounds on the sizes of large maximal partial spreads in the classical hermitian polar spaces. Of particular importance is the presented upper bound on the size of a maximal partial spread of H(3,q ²). For q = 2,3, the presented upper bound is sharp. For q = 3, our results confirm via theoretical arguments properties, deduced by computer searches performed by Ebert and Hirschfeld, for the largest partial spreads of H(3,9). An overview of the status regarding these results is given in two summarizing tables. The similar results for the classical symplectic and orthogonal polar spaces are presented in De Beule et al. [8].