We reconstruct glass equations of state for polydisperse hard spheres with the help computer simulations. To perform reconstructions, we assume that hard-sphere have form Zg(?, ?J) = Zg(?J/?), where Zg, ?, and ?J are reduced pressure (PV/NkBT), sphere volume fraction (packing density), jamming density current basin attraction, respectively. Specifically, use X ?iciYi, (?J/?) ? 1 Y 1/(Zg 1). Our...

We prove that if G and H are primitive strongly regular graphs with the same parameters and φ is a homomorphism from G to H, then φ is either an isomorphism or a coloring (homomorphism to a complete subgraph). Moreover, any such coloring is optimal for G and its image is a maximum clique of H. Therefore, the only endomorphisms of a primitive strongly regular graph are automorphisms or colorings...

A spread of a strongly regular graph is a partition of the vertex set into cliques that meet Delsarte's bound (also called Hoffman's bound). Such spreads give rise to colorings meeting Hoffman's lower bound for the chromatic number and to certain imprimitive three-class association schemes. These correspondences lead to conditions for existence. Most examples come from spreads and fans in (part...

Let K(α), 0≤α< 1, denote the class of functions g(z)= z+∑∞n=2anzn which are regular and univalently convex of order α in the unit disc U . Pursuing the problem initiated by Robinson in the present paper, among other things, we prove that if f is regular in U , f(0) = 0, and f(z)+zf ′(z) < g(z)+zg′(z) in U , then (i) f(z) < g(z) at least in |z| < r0, r0 = √ 5/3 = 0.745 . . . if f ∈ K; and (ii) f...

We consider strongly regular graphs defined on a finite field by taking the union of some cyclotomic classes as difference set. Several new examples are found.

In this paper, we examine the structure of vertexand edge-transitive strongly regular graphs, using normal quotient reduction. We show that the irreducible graphs in this family have quasiprimitive automorphism groups, and prove (using the Classification of Finite Simple Groups) that no graph in this family has a holomorphic simple automorphism group. We also find some constraints on the parame...

Using results on Hadamard difference sets, we construct regular graphical Hadamard matrices of negative type of order 4m for every positive integer m. If m > 1, such a Hadamard matrix is equivalent to a strongly regular graph with parameters (4m, 2m +m, m +m, m +m). Strongly regular graphs with these parameters have been called max energy graphs, because they have maximal energy (as defined by ...