Scheduling CCRR tournaments

In this paper, we construct CCRRS, complete coupling round robin schedules, for n teams each consisting of two pairs. The motivation for these schedules is a problem in scheduling bridge tournaments. We construct CCRRS(n) for n a positive integer, n?3, with the possible exceptions of n∈{54,62}. For n odd, we show that a CCRRS(n) can be constructed using a house with a special property. For n even, a CCRRS(n) can be constructed from a Howell design, H(2n-2,2n), with a special property called Property P. We use a combination of direct and recursive constructions to construct H(2n-2,2n) with Property P. In order to apply our main recursive construction, we need group divisible designs with odd group sizes and odd block sizes. One of our main results is the existence of these group divisible designs.     

Asymptotic existence theorems for frames and group divisible designs

In this paper, we establish an asymptotic existence theorem for group divisible designs of type mn with block sizes in any given set K of integers greater than 1. As consequences, we will prove an asymptotic existence theorem for frames and derive a partial asymptotic existence theorem for resolvable group divisible designs.     

Orchards in elliptic curves over finite fields

Consider a set of n points on a plane. A line containing exactly 3 out of the n points is called a 3-rich line. The classical orchard problem asks for a configuration of the n points on the plane that maximizes the number of 3-rich lines. In this note, using the group law in elliptic curves over finite fields, we exhibit several (infinitely many) group models for orchards wherein the number of 3-rich lines agrees with the expected number given by Green-Tao (or, Burr, Grünbaum and Sloane) formula for the maximum number of lines. We also show, using elliptic curves over finite fields, that there exist infinitely many point-line configurations with the number of 3-rich lines exceeding the expected number given by Green-Tao formula by two, and this is the only other optimal possibility besides the case when the number of 3-rich lines agrees with the Green-Tao formula.     

Distinguishing labeling of group actions

Suppose Γ is a group acting on a set X. An r-labeling f:X→{1,2,…,r} of X is distinguishing (with respect to Γ) if the only label preserving permutation of X in Γ is the identity. The distinguishing number, D_Γ(X), of the action of Γ on X is the minimum r for which there is an r-labeling which is distinguishing. This paper investigates the relation between the cardinality of a set X and the distinguishing numbers of group actions on X. For a positive integer n, let D(n) be the set of distinguishing numbers of transitive group actions on a set X of cardinality n, i.e., D(n)={D_Γ(X):|X|=n and Γ acts transitively on X}. We prove that . Then we consider the problem of an arbitrary fixed group Γ acting on a large set. We prove that if for any action of Γ on a set Y, for each proper normal subgroup H of Γ, D_H(Y)≤2, then there is an integer n such that for any set X with |X|≥n, for any action of Γ on X with no fixed points, D_Γ(X)≤2.     

Generating facets for finite master cyclic group polyhedra using n-step mixed integer rounding functions

The n-step mixed integer rounding (MIR) functions generate n-step MIR inequalities for MIP problems and are facets for the infinite group problems. We show that the n-step MIR functions also directly generate facets for the finite master cyclic group polyhedra especially in many cases where the breakpoints of the n-step MIR function are not necessarily at the elements of the group (hence the linear interpolation of the facet coefficients obtained has more than two slopes).     

Possible spectra of totally positive matrices

For any given set S of n distinct positive numbers, we construct a symmetric n-by-n (strictly) totally positive matrix whose spectrum is S. Thus, in order to be the spectrum of an n-by-n totally positive matrix, it is necessary and sufficient that n numbers be positive and distinct.     

Group divisible designs with block size four and two groups

We give some constructions of new infinite families of group divisible designs, GDD(n,2,4;λ₁,λ₂), including one which uses the existence of Bhaskar Rao designs. We show the necessary conditions are sufficient for 3?n?8. For n=10 there is one missing critical design. If λ₁>λ₂, then the necessary conditions are sufficient for . For each of n=10,15,16,17,18,19, and 20 we indicate a small minimal set of critical designs which, if they exist, would allow construction of all possible designs for that n. The indices of each of these designs are also among those critical indices for every n in the same congruence class mod 12.     

Testing integer knapsacks for feasibility

We present a new approach for determining whether there exist nonnegative integers x₁, x₂, …, x_n satisfying a₁x₁ + a₂x₂ + ? + a_nx_n = b, where a₁ < a₂ < ? < a_n and b are nonnegative integers. case time complexity is analyzed and compared with dynamic programming techniques. Computational results are given.     

Evaluation of rankings with regard to the possible number of agreements and conflicts

An interesting problem in group decision analysis is how many different agreements can occur, or conversely disagreements may exist, between two or more different rankings of a set of alternatives. In this paper it is assumed that a reference ranking has been established for the set of alternatives. This reference ranking may represent the ranking of a high authority decision maker or be just a virtual ranking to be used in determining the discrepancy between pairs of rankings. Then, the problem examined here is to evaluate the number of possible rankings when the ranking method is the number of agreements with some reference ranking. The analysis presented here illustrates that this problem is not trivial and moreover, its simple context conceals complexity in its depth. The purpose of this paper is to provide an evaluation of the number of possible agreements in rankings given to a set of concepts, alternatives or ideas, by two or more decision makers. The number of possible agreements takes on the values 0, 1, 2,…, n − 2, or n when n concepts are compared. This paper develops a recursive closed form formula for calculating the frequencies for the various numbers of agreements.     

Rank-based selection strategies for the random walk process

In many decision situations such as hiring a secretary, selling an asset, or seeking a job, the value of each offer, applicant, or choice is assumed to be an independent, identically distributed random variable. In this paper, we consider a special case where the observations are auto-correlated as in the random walk model for stock prices. For a given random walk process of n observations, we explicitly compute the probability that the j-th observation in the sequence is the maximum or minimum among all n observations. Based on the probability distribution of the rank, we derive several distribution-free selection strategies under which the decision maker's expected utility of selecting the best choice is maximized. We show that, unlike in the classical secretary problem, evaluating more choices in the random walk process does not increase the likelihood of successfully selecting the best.     

On error-tolerant DNA screening

Given n clones with some positive ones, the problem of DNA screening is to identify all positive clones with a set of tests each on a subset of clones, called a pool and the outcome is either the pool contains a positive clone or not. In this paper, we show that for a class of designs, if we apply those for samples with d positive clones to samples with at most d-1 positive clones, the error-tolerant property will have an interesting improvement. We also make a remark on decoding method for k-error-correcting d-disjunct matrix.     

Some constructions of linearly optimal group codes

We continue here the research on (quasi)group codes over (quasi)group rings. We give some constructions of [n,n-3,3]_q-codes over F_q for n=2q and n=3q. These codes are linearly optimal, i.e. have maximal dimension among linear codes having a given length and distance. Although codes with such parameters are known, our main results state that we can construct such codes as (left) group codes. In the paper we use a construction of Reed-Solomon codes as ideals of the group ring F_qG where G is an elementary abelian group of order q.     

Linear relations of theta series of genera of quadratic forms

In this paper we study linear relations among theta series of genera of positive definite n-ary quadratic forms with given level D,2D,4D and 8D for square free D. We obtain a basis for the space generated by genus theta series. This forms a basis of Eisenstein space.     

On linear preservers of normal maps

We study group induced cone (GIC) orderings generating normal maps. Examples of normal maps cover, among others, the eigenvalue map on the space of n × n Hermitian matrices as well as the singular value map on n × n complex matrices. In this paper, given two linear spaces equipped with GIC orderings induced by groups of orthogonal operators, we investigate linear operators preserving normal maps of the orderings. A characterization of the preservers is obtained in terms of the groups. The result is applied to show that the normal structure of the spaces is preserved under the action of the operators. In addition, examples are given.     

Combinatorial properties of strength groups in round robin tournaments

A single round robin tournament (RRT) consists of a set T of n teams (n even) and a set P of n − 1 periods. The teams have to be scheduled such that each team plays exactly once against each other team and such that each team plays exactly once per period. In order to establish fairness among teams we consider a partition of teams into strength groups. Then, the goal is to avoid a team playing against extremely weak or extremely strong teams in consecutive periods. We propose two concepts ensuring different degrees of fairness. One question arising here is whether a single RRT exists for a given number of teams n and a given partition of the set of teams into strength groups or not. In this paper we examine this question. Furthermore, we analyse the computational complexity of cost minimization problems in the presence of strength group requirements.     

Some Decidability Results for ℤ[G]-Modules when G is Cyclic of Squarefree Order

We extend the analysis of the decision problem for modules over a group ring ?[G] to the case when G is a cyclic group of squarefree order. We show that separated ?[G]-modules have a decidable theory, and we discuss the model theoretic role of these modules within the class of all ?[G]-modules. The paper includes a short analysis of the decision problem for the theories of (finitely generated) modules over ?[ζ_m], where m is a positive integer and ζ_m is a primitive mth root of 1. Mathematics Subject Classification: 03C60, 03B25.     

Symmetry analysis and exact solutions of semilinear heat flow in multi-dimensions

A symmetry group method is used to obtain exact solutions for a semilinear radial heat equation in n>1 dimensions with a general power nonlinearity. The method involves an ansatz technique to solve an equivalent first-order PDE system of similarity variables given by group foliations of this heat equation, using its admitted group of scaling symmetries. This technique yields explicit similarity solutions as well as other explicit solutions of a more general (non-similarity) form having interesting analytical behavior connected with blow up and dispersion. In contrast, standard similarity reduction of this heat equation gives a semilinear ODE that cannot be explicitly solved by familiar integration techniques such as point symmetry reduction or integrating factors.     

Lattice-Ordered Matrix Rings Over Totally Ordered Rings

For an n ×n matrix algebra over a totally ordered integral domain, necessary and sufficient conditions are derived such that the entrywise lattice order on it is the only lattice order (up to an isomorphism) to make it into a lattice-ordered algebra in which the identity matrix is positive. The conditions are then applied to particular integral domains. In the second part of the paper we consider n ×n matrix rings containing a positive n-cycle over totally ordered rings. Finally a characterization of lattice-ordered matrix ring with the entrywise lattice order is given.     

On the Isomorphism Conjecture in algebraic K-theory

The Isomorphism Conjecture is a conceptional approach towards a calculation of the algebraic K-theory of a group ring RΓ, where Γ is an infinite group. In this paper we prove the conjecture in dimensions n<2 for fundamental groups of closed Riemannian manifolds with strictly negative sectional curvature and arbitrary coefficient rings R. If R is regular this leads to a concrete calculation of low dimensional K-theory groups of RΓ in terms of the K-theory of R and the homology of the group.     

On the posterior distribution of a dirichlet process given randomly right censored observations

The purpose of this note is to show that the conditional distribution of a Dirichlet process P given n independent observations X₁… X_n from P and belonging to measurable sets A₁,… A_n with A₁ ? A₁₊₁ for i=1,… n=1 is a mixture of Dirichlet processes as introduced by Antoniak. It is also shown that this result is applicable in Bayesin decision problems concerning a random survival distribution under Dirichlet process priors.