Displaying similar documents to “Modular circle quotients and PL limit sets.”

Universal tessellations.

David Singerman (1988)

Revista Matemática de la Universidad Complutense de Madrid

Similarity:

All maps of type (m,n) are covered by a universal map M(m,n) which lies on one of the three simply connected Riemann surfaces; in fact M(m,n) covers all maps of type (r,s) where r|m and s|n. In this paper we construct a tessellation M which is universal for all maps on all surfaces. We also consider the tessellation M(8,3) which covers all triangular maps. This coincides with the well-known Farey tessellation and we find many connections between M(8,3) and M.

The modular characters of the twisted Chevalley group 2D4(2) over GF2.

Ibrahim A. I. Suleiman (1995)

Revista Matemática de la Universidad Complutense de Madrid

Similarity:

In this paper we calculate the 2-modular character table of the twisted Chevalley group 2D4(2) using computer techniques available in an algebra package called Meat-Axe. This package is now available in Mu'tah University as well as other universities such as Birmingham University in the UK and Aachen University in Germany. The determination of this character table will be a contribution to modular calculations of various simple groups.

Ordered vertex partitioning.

McConnell, Ross M., Spinrad, Jeremy P. (2000)

Discrete Mathematics and Theoretical Computer Science. DMTCS [electronic only]

Similarity:

Nowhere-zero modular edge-graceful graphs

Ryan Jones, Ping Zhang (2012)

Discussiones Mathematicae Graph Theory

Similarity:

For a connected graph G of order n ≥ 3, let f: E(G) → ℤₙ be an edge labeling of G. The vertex labeling f’: V(G) → ℤₙ induced by f is defined as f ' ( u ) = ∑ v ∈ N ( u ) f ( u v ) , where the sum is computed in ℤₙ. If f’ is one-to-one, then f is called a modular edge-graceful labeling and G is a modular edge-graceful graph. A modular edge-graceful labeling f of G is nowhere-zero if f(e) ≠ 0 for all e ∈ E(G) and in this case, G is a nowhere-zero modular edge-graceful graph. It is shown that a connected graph G of order...

Modular equations for some η-products

(2013)

Acta Arithmetica

Similarity:

The classical modular equations involve bivariate polynomials that can be seen to be univariate in the modular invariant j with integer coefficients. Kiepert found modular equations relating some η-quotients and the Weber functions γ₂ and γ₃. In the present work, we extend this idea to double η-quotients and characterize all the parameters leading to this kind of equation. We give some properties of these equations, explain how to compute them and give numerical examples.