Classification of reflexible regular embeddings and self-Petrie dual regular embeddings of complete bipartite graphs

In this paper, we classify the reflexible regular orientable embeddings and the self-Petrie dual regular orientable embeddings of complete bipartite graphs. The classification shows that for any natural number n, say (p₁,p₂,…,p_k are distinct odd primes and a_i>0 for each i?1), there are t distinct reflexible regular embeddings of the complete bipartite graph K_n,n up to isomorphism, where t=1 if a=0, t=2^k if a=1, t=2^k+1 if a=2, and t=3·2^k+1 if a?3. And, there are s distinct self-Petrie dual regular embeddings of K_n,n up to isomorphism, where s=1 if a=0, s=2^k if a=1, s=2^k+1 if a=2, and s=2^k+2 if a?3.     

Small surface trades in triangular embeddings

We enumerate all possible trades which involve up to six faces of the face set of a triangular embedding of a simple connected graph. These are classified by the underlying combinatorial trade on the associated block design, and by the geometrical arrangement of the faces necessary to avoid creation of a pseudosurface in the trading operation. The relationship of each of these trades to surface orientability is also established.     

Compression of uniform embeddings into Hilbert space

If one tries to embed a metric space uniformly in Hilbert space, how close to quasi-isometric could the embedding be? We answer this question for finite dimensional CAT(0) cube complexes and for hyperbolic groups. In particular, we show that the Hilbert space compression of any hyperbolic group is 1.     

The smallest regular polytopes of given rank

An abstract polytope is called regular   if its automorphism group has a single orbit on flags (maximal chains). In this paper, the regular n$n$-polytopes with the smallest number of flags are found, for every rank n>1$n>1$. With a few small exceptions, the smallest regular n$n$-polytopes come from a family of ‘tight’ polytopes with 2⋅4ⁿ⁻¹$2\cdot 4^{n-1}$ flags, one for each n$n$, with Schläfli symbol {4∣4∣?∣4}$\{4\mid 4\mid ?\mid 4\}$. Also with few exceptions, these have both the smallest number of elements, and the smallest number of edges in their Hasse diagram.     

Factor maps and invariant distributional chaos

The main aim of this article is to show that maps with the specification property have invariant distributionally scrambled sets and that this kind of scrambled set can be transferred from factor to extension under finite-to-one factor maps. This solves some open questions in the literature of the topic.     

Finite digraphs with given regular automorphism groups

With five exceptions, every finite regular permutation group occurs as the automorphism group of a digraph.One of the corollaries: given a finite groupG of ordern, there is a commutative semigroupS of order 2n+2 such that AutSG. The problem whether a latticeL of order Cn with AutLG exists (for some constantC), remains open.     

Factorial regular representation of groups in complete graphs

A necessary and sufficient condition for the group of isomorphisms involved in a factorization of a complete graph into isomorphic factors is established.     

Wecken's theorem for periodic points in dimension at least 3

Boju Jiang introduced a homotopy invariant NFn(f), for a natural number n, which is a lower bound for the cardinality of periodic points, of period n, of a self-map of a compact polyhedron. In [J. Jezierski, Wecken theorem for periodic points, Topology 42 (5) (2003) 1101-1124] and [J. Jezierski, Wecken theorem for fixed and periodic points, in: Handbook of Topological Fixed Point Theory, Kluwer Academic, Dordrecht, 2005] we prove that any self-map of a compact PL-manifold (dimM?3) is homotopic to a map g satisfying #Fix(gn)=NFn(f) i.e. NFn(f) is the best such homotopy invariant. Here we give an alternative, simpler proof of these results.     

On infinite tournaments with regular automorphism groups

Atournament regular representation (TRR) of an abstract groupG is a tournamentT whose automorphism group is isomorphic toG and is a regular permutation group on the vertices ofT. L. Babai and W. Imrich have shown that every finite group of odd order exceptZ ₃ ×Z ₃ admits a TRR. In the present paper we give several sufficient conditions for an infinite groupG with no element of order 2 to admit a TRR. Among these are the following: (1)G is a cyclic extension byZ of a finitely generated group; (2)G is a cyclic extension byZ _2n+1 of any group admitting a TRR; (3)G is a finitely generated abelian group; (4)G is a countably generated abelian group whose torsion subgroup is finite.     

A topological obstruction to the geodesibility of a foliation of odd dimension

Let M be a compact Riemannian manifold of dimension n, and let be a smooth foliation on M. A topological obstruction is obtained, similar to results of R. Bott and J. Pasternack, to the existence of a metric on M for which is totally geodesic. In this case, necessarily that portion of the Pontryagin algebra of the subbundle must vanish in degree n if is odd-dimensional. Using the same methods simple proofs of the theorems of Bott and Pasternack are given.     

Topological entropy of maps on regular curves

In [G.T. Seidler, The topological entropy of homeomorphisms on one-dimensional continua, Proc. Amer. Math. Soc. 108 (1990) 1025-1030], G.T. Seidler proved that the topological entropy of every homeomorphism on a regular curve is zero. Also, in [H. Kato, Topological entropy of monotone maps and confluent maps on regular curves, Topology Proc. 28 (2) (2004) 587-593] the topological entropy of confluent maps on regular curves was investigated. In particular, it was proved that the topological entropy of every monotone map on any regular curve is zero. In this paper, furthermore we investigate the topological entropy of more general maps on regular curves. We evaluate the topological entropy of maps f on regular curves X in terms of the growth of the number of components of f−n(y) (y∈X).     

Radical embeddings and representation dimension

Given a representation-finite algebra B and a subalgebra A of B such that the Jacobson radicals of A and B coincide, we prove that the representation dimension of A is at most three. By a result of Igusa and Todorov, this implies that the finitistic dimension of A is finite.     

The kernel unipotent conjecture and the vanishing of Massey products for odd rigid fields

A major difficult problem in Galois theory is the characterization of profinite groups which are realizable as absolute Galois groups of fields. Recently the Kernel n-Unipotent Conjecture and the Vanishing n  -Massey Conjecture for n≥3$n\ge 3$ were formulated. These conjectures evolved in the last forty years as a byproduct of the application of topological methods to Galois cohomology. We show that both of these conjectures are true for odd rigid fields. This is the first case of a significant family of fields where both of the conjectures are verified besides fields whose Galois groups of p-maximal extensions are free pro-p-groups. We also prove the Kernel Unipotent Conjecture for Demushkin groups of rank 2, and establish various filtration results for free pro-p-groups, provide examples of pro-p-groups which do not have the kernel n-unipotent property, compare various Zassenhaus filtrations with the descending p-central series and establish new type of automatic Galois realization.     

Planar graphs and poset dimension

We view the incidence relation of a graph G=(V. E) as an order relation on its vertices and edges, i.e. a<_G b if and only of a is a vertex and b is an edge incident on a. This leads to the definition of the order-dimension of G as the minimum number of total orders on V E whose intersection is <_G. Our main result is the characterization of planar graphs as the graphs whose order-dimension does not exceed three. Strong versions of several known properties of planar graphs are implied by this characterization. These properties include: each planar graph has arboricity at most three and each planar graph has a plane embedding whose edges are straight line segments. A nice feature of this embedding is that the coordinates of the vertices have a purely combinatorial meaning.     

The mixed problem for the Lamé system in a class of Lipschitz domains

We consider the mixed problem for the Lamé system

     

Covering dimension and finite-to-one maps

Hurewicz characterized the dimension of separable metrizable spaces by means of finite-to-one maps. We investigate whether this characterization also holds in the class of compact F-spaces of weight c. Our main result is that, assuming the Continuum Hypothesis, an n-dimensional compact F-space of weight c is the continuous image of a zero-dimensional compact Hausdorff space by an at most n²-to-1 map.