We construct and study a new near octagon of order (2, 10) which has its full automorphism group isomorphic to the group G2(4) : 2 and which contains 416 copies of the Hall-Janko near octagon as full subgeometries. Using this near octagon and its substructures we give geometric constructions of the G2(4)-graph and the Suzuki graph, both of which are strongly regular graphs contained in the Suzu...

We consider a generalized version of the proximal point algorithm for solving the perturbed inclusion y ∈ T (x), where y is a perturbation element near 0 and T is a set-valued mapping acting from a Banach space X to a Banach space Y which is metrically regular around some point point (x̄, 0) in its graph. We study the behavior of the convergent iterates generated by the algorithm and we prove th...

We investigate if every quasi-minimal group is abelian, and give a positive answer for a quasi-minimal pure group having a ∅-definable partial order with uncountable chains. We also relate two properties of a complete theory in a countable language: the existence of a quasi-minimal model and the existence of a strongly regular type. As a consequence we derive the equivalence of conjectures on c...

We develop a theory of representations in Rm for directed strongly regular graphs, which gives a new proof of a nonexistence condition of Jørgensen [8]. We also describe some new constructions.

In this paper, we give a construction of strongly regular Cayley graphs and a construction of skew Hadamard difference sets. Both constructions are based on choosing cyclotomic classes in finite fields, and they generalize the constructions given by Feng and Xiang [10, 12]. Three infinite families of strongly regular graphs with new parameters are obtained. The main tools that we employed are i...

The existence of relational products in categories of relations is strongly connected with the representability of that category. In this paper we propose a canonical weakening of the notion of a relational product. Unlike the strong version any (small) category of relations can be embedded into a suitable category providing all weak relational products. Furthermore, we investigate the categori...

One approach to supply chain coordination is early order commitment, whereby a retailer commits to purchase a fixedorder quantity at a fixed delivery time before demand uncertainty is resolved. In this paper, we develop an analytical model to quantify the cost savings of an early order commitment in a two-level supply chain where demand is serially correlated. A decision rule is derived to dete...

Relations between Laplacian eigenvectors and eigenvalues and the existence of almost equitable partitions (which are generalizations of equitable partitions) are presented. Furthermore, on the basis of some properties of the adjacency eigenvectors of a graph, a necessary and sufficient condition for the graph to be primitive strongly regular is introduced. c © 2006 Elsevier Ltd. All rights rese...

Wepropose a class of discrete-time dynamic average consensus algorithms that allow a group of agents to track the average of their reference inputs. The convergence results rely on the input-to-output stability properties of static average consensus algorithms and require that the union of communication graphs over a bounded period of time be strongly connected. The only requirement on the set ...