Reflecting a triangle in the plane

We prove that if the three angles of a triangleT in the plane are different from (60°, 60°, 60°), (30°, 30°, 120°), (45°,45°,90°),(30°,60°,90°), then the set of vertices of those triangles which are obtained fromT by repeating ‘edge-reflection’ is everywhere dense in the plane.     

Hamiltonian cycles in cubic Cayley graphs: the 〈2,4k,3〉 case

It was proved by Glover and Maru?i? (J. Eur. Math. Soc. 9:775–787, 2007), that cubic Cayley graphs arising from groups G=〈a,x∣a ²=x ^s =(ax)³=1,…〉 having a (2,s,3)-presentation, that is, from groups generated by an involution a and an element x of order s such that their product ax has order 3, have a Hamiltonian cycle when |G| (and thus also s) is congruent to 2 modulo 4, and have a Hamiltonian path when |G| is congruent to 0 modulo 4. In this article the existence of a Hamiltonian cycle is proved when apart from |G| also s is congruent to 0 modulo 4, thus leaving |G| congruent to 0 modulo 4 with s either odd or congruent to 2 modulo 4 as the only remaining cases to be dealt with in order to establish existence of Hamiltonian cycles for this particular class of cubic Cayley graphs.     

Elastoplastic stress analysis of thick laminated metal-matrix composite plates by the finite-element method

The elastoplastic stress state of a laminated stainless-steel-fiber-reinforced aluminum-matrix plates, with or without a hole, subjected to a pressure on their top is examined by using the finite-element method. The analysis is carried out for three layouts: (0/90/0/90)_s, (45/-45/45/-45)_s, and (30/60/30/60)_s. The Newton-Raphson method is used to solve the nonlinear problem. The distributions of equivalent stresses and the plastic zones of the plates without a hole and with a hole of various diameters are determined. Russian translation published in Mekhanika Kompozitnykh Materialov, Vol. 42, No. 4, pp. 531–544, July–August, 2006.     

A note on the girth‐doubling construction for polygonal graphs

A near‐polygonal graph is a graph Γ which has a set ?? of m‐cycles for some positive integer m such that each 2‐path of Γ is contained in exactly one cycle in ??. If m is the girth of Γ then the graph is called polygonal. Given a polygonal graph Γ of valency r and girth m, Archdeacon and Perkel proved the existence of a polygonal graph Γ₂ of valency r and girth 2m. We will show that this construction can be extended to one that yields a polygonal graph Γ₃ of valency r and girth 3m, but that making the cycles any longer with this construction does not yield a polygonal graph. We also show that if Aut(Γ) is 2‐arc transitive, so is Aut(Γ_k) for k = 2, 3. © 2010 Wiley Periodicals, Inc. J Graph Theory 68: 246‐254, 2011     

Covering n-Segment Unit Arcs Is Not Sufficient

In 1974 Gerriets and Poole conjectured for n = 3 that a convex set in the plane which contains a congruent copy of every n-segment polygonal arc of unit length must be a cover for the family of all unit arcs. We disprove this general conjecture by describing for each positive integer n a convex region R_n that contains a ongruent copy of every n-segment unit arc but not a congruent copy of every unit arc.     

Mixed sums of squares and triangular numbers (III)

In this paper we confirm a conjecture of Sun which states that each positive integer is a sum of a square, an odd square and a triangular number. Given any positive integer m, we show that p=2m+1 is a prime congruent to 3 modulo 4 if and only if Tm=m(m+1)/2 cannot be expressed as a sum of two odd squares and a triangular number, i.e., p²=x²+8(y²+z²) for no odd integers x,y,z. We also show that a positive integer cannot be written as a sum of an odd square and two triangular numbers if and only if it is of the form 2Tm(m>0) with 2m+1 having no prime divisor congruent to 3 modulo 4.     

Quasi-symmetric 2-(31, 7, 7) designs and a revision of Hamada's conjecture

It is proved by use of the classification of the doubly even (32, 16) codes, that in addition to the design formed by the planes in PG(4, 2), there are exactly four other nonisomorphic quasi-symmetric 2-(31, 7, 7) designs, and they all have 2-rank 16. This shows that the “only if” part of the following conjecture due to Hamada, is not true in general: “If N(D) is an incidence matrix of a design D with the parameters of a design G defined by the flats of a given dimension in PG(t, q) or AG(t, q), then rank_q N(D) ⩾ rank_q N(G), with equality if and only if D is isomorphic with G.” The five quasi-symmetric 2-(31, 7, 7) designs are extendable to nonisomorphic 3-(32, 8, 7) designs having 2-rank 16, one of which is formed by the 3-flats in AG(5, 2), thus the designs arising from a finite affine geometry also are not characterized by their ranks in general. A quasi-symmetric 2-(45, 9, 8) design yielding a pseudo-geometric strongly regular graph with parameters (r, k, t) = (15, 10, 6) is also constructed on the base of the known extremal doubly even (48, 24) code.     

Stabilization of flows through porous media

In this article, we study the motion of an incompressible homogeneous Newtonian fluid in a rigid porous medium of infinite extent. The fluid is bounded below by a fixed layer having an external source (with an injection rate b), and above by a free surface moving under the influence of gravity. The flow is governed by Darcy’s law. If b(c) = 0 for some c > 0 then the system admits (u, f) ≡ (c, c) as an equilibrium solution. We shall prove that the stability properties of this equilibrium are determined by the slope of b in c : The equilibrium is unstable if b′(c) < 0, whereas b′(c) > 0 implies exponential stability. Zhaoyong Feng: He is grateful to the DFG for financial support through the Graduiertenkolleg 615 “Interaction of Modeling, Computation Methods and Software Concepts for Scientific-Technological Problems”.     

Tilings of Convex Polygons with Congruent Triangles

By the spectrum of a polygon A we mean the set of triples (??,??,??) such that A can be dissected into congruent triangles of angles ??,??,??. We propose a technique for finding the spectrum of every convex polygon. Our method is based on the following classification. A tiling is called regular if there are two angles of the triangles, ?? and ?? such that at every vertex of the tiling the number of triangles having angle ?? equals the number of triangles having angle ??. Otherwise the tiling is irregular. We list all pairs (A,T) such that A is a convex polygon and T is a triangle that tiles A regularly. The list of triangles tiling A irregularly is always finite, and can be obtained, at least in principle, by considering the system of equations satisfied by the angles, examining the conjugate tilings, and comparing the sides and the area of the triangles to those of A. Using this method we characterize the convex polygons with infinite spectrum, and determine the spectrum of the regular triangle, the square, all rectangles, and the regular N-gons with N large enough.     

Primitive permutation groups with a regular subgroup

This paper starts the classification of the primitive permutation groups (G,Ω) such that G contains a regular subgroup X. We determine all the triples (G,Ω,X) with soc(G) an alternating, or a sporadic or an exceptional group of Lie type. Further, we construct all the examples (G,Ω,X) with G a classical group which are known to us. Our particular interest is in the 8-dimensional orthogonal groups of Witt index 4. We determine all the triples (G,Ω,X) with . In order to obtain all these triples, we also study the almost simple groups G with GPΩ_2n+1(q). The case GU_n(q) is started in this paper and finished in [B. Baumeister, Primitive permutation groups of unitary type with a regular subgroup, Bull. Belg. Math. Soc. 112 (5) (2006) 657–673]. A group X is called a Burnside-group (or short a B-group) if each primitive permutation group which contains a regular subgroup isomorphic to X is necessarily 2-transitive. In the end of the paper we discuss B-groups.     

Congruence Restricted Modular Forms

Given f(z), a modular form on a congruence subgroup (of the full modular group), we construct the function f(z;r,t) by summing over the terms of the Fourier expansion of f(z) with index congruent to r modulo t. In this paper, we determine a condition on the multiplier system of f(z) which guarantees that f(z;r,t) is itself a modular form on a (smaller) congruence subgroup.2000 Mathematics Subject Classification: Primary—11F11; Secondary—11F30     

Morse and Hedlund’s Skew Sturmian Words Revisited

For any infinite word r over A = {a, b} we associate two infinite words min(r), max(r) such that any prefix of min(r) (max(r), respectively) is the lexicographically smallest (greatest, respectively) among the factors of r of the same length. We prove that (min(r); max(r)) = (as, bs) for some infinite word s if and only if r is a proper Sturmian word or an ultimately periodic word of a particular form. This result is based on a lemma concerning sequences of infinite words. Received July 11, 2005     

Farthest-polygon Voronoi diagrams

Given a family of k disjoint connected polygonal sites in general position and of total complexity n, we consider the farthest-site Voronoi diagram of these sites, where the distance to a site is the distance to a closest point on it. We show that the complexity of this diagram is O(n), and give an O(nlog³n) time algorithm to compute it. We also prove a number of structural properties of this diagram. In particular, a Voronoi region may consist of k−1 connected components, but if one component is bounded, then it is equal to the entire region.     

On trees and tree dimension of ordered sets

We call an ordered set (X, ) a tree if no pair of incomparable elements ofX has an upper bound. It is shown that there is a natural way to associate a tree (T, ) with any ordered set (X, ), and (T, ) can be characterized by a universal property. We define the tree dimensiontd(X, ) of an ordered set as the minimal number of extensions of (X, ) which are trees such that the given order is the intersection of those tree orders. We give characterizations of the tree dimension, relations between dimension and tree dimension, and removal theorems.     

Infima of quasi-uniform anti-atoms

Let (q(X),⊆) denote the lattice consisting of the set q(X) of all quasi-uniformities on a set X, ordered by set-theoretic inclusion ⊆. We observe that a quasi-uniformity on X is the supremum of atoms of (q(X),⊆) if and only if it is totally bounded and transitive. Each quasi-uniformity on X that is totally bounded or has a linearly ordered base is shown to be the infimum of anti-atoms of (q(X),⊆). Furthermore, each quasi-uniformity U on X such that the topology of the associated supremum uniformity Us is resolvable has the latter property.     

Gray code enumeration of families of integer partitions

In this paper we show that the elements of certain families of integer partitions can be listed in a minimal change, or Gray code, order. In particular, we construct Gray code listings for the classes P_δ(n, k) and D(n, k) of partitions of n into parts of size at most k in which, for P_δ(n, k), the parts are congruent to one modulo δ and, for D(n, k), the parts are distinct. It is shown that the elements of these classes can be listed so that the only change between successive partitions is the increase of one part by δ (or the addition of δ ones) and the decrease of one part by δ (or the removal of δ ones), where, in the case of D(n, k), δ = 1.     

On Narrow Hexagonal Graphs with a 3-Homogeneous Suborbit

A connected graph of girth m 3 is called a polygonal graph if it contains a set of m-gons such that every path of length two is contained in a unique element of the set. In this paper we investigate polygonal graphs of girth 6 or more having automorphism groups which are transitive on the vertices and such that the vertex stabilizers are 3-homogeneous on adjacent vertices. We previously showed that the study of such graphs divides naturally into a number of substantial subcases. Here we analyze one of these cases and characterize the k-valent polygonal graphs of girth 6 which have automorphism groups transitive on vertices, which preserve the set of special hexagons, and which have a suborbit of size k – 1 at distance three from a given vertex.     

On polygonal measures with vanishing harmonic moments

A polygonal measure is the sum of finitely many real constant density measures supported on triangles in ?. Given a finite set S ? ?, we study the existence of polygonal measures spanned by triangles with vertices in S, all of whose harmonic moments vanish. We show that for generic S, the dimension of the linear space of such measures is \(\left( {_2^{|S| - 3} } \right)\) . We also investigate the situation in which the density for such measure takes on only values 0 or ±1. This corresponds to pairs of polygons of unit density having the same logarithmic potential at ∞. We show that such (signed) measures do not exist for |S| ≤ 5, but that for each n ≥ 6 one can construct an S, with |S| = n, giving rise to such a measure.     

On the density of sequences of integers the sum of no two of which is a square. I. Arithmetic progressions

The maximal density attainable by a sequence S of positive integers having the property that the sum of any two elements of S is never a square is studied. J. P. Massias exhibited such a sequence with density $\text{11}\text{32}$; it consists of 11 residue classes (mod 32) such that the sum of any two such residue classes is not congruent to a square (mod 32). It is shown that for any positive integer n, one cannot find more than $\text{11}\text{32}\text{n}$ residue classes (mod n) such that the sum of any two is never congruent to a square (mod n). Thus Massias' example has maximal density among those sequences S made up of a finite set of (infinite) arithmetic progressions. A companion paper will bound the maximal density of an arbitrary such sequence S.     

Large sets of pure directed triple systems with index λ

A directed triple system of order v with index λ, briefly by DTS（v,λ）, is a pair （X, B） where X is a v-set and B is a collection of transitive triples （blocks） on X such that every ordered pair of X belongs to λ blocks of B. A simple DTS（v, λ） is a DTS（v, λ） without repeated blocks. A simple DTS（v, ）,） is called pure and denoted by PDTS（v, λ） if （x, y, z） ∈ B implies （z, y, x）, （z, x, y）, （y, x, z）, （y, z, x）, （x, z, y） B. A large set of disjoint PDTS（v, λ）, denoted by LPDTS（v, λ）, is a collection of 3（v - 2）/λ disjoint pure directed triple systems on X. In this paper, some results about the existence for LPDTS（v, λ） are presented. Especially, we determine the spectrum of LPDTS（v, 2）.