Meiotic recombination in mammals has been shown to largely cluster into hotspots, which are targeted by the chromatin modifier PRDM9. The canid family, including wolves and dogs, has undergone a series of disrupting mutations in this gene, rendering PRDM9 inactive. Given the importance of PRDM9 it is of great interest to learn how its absence in the dog genome affects patterns of recombination ...

HE relation between crossing-over and disjunction in the Drosophila female Thas been studied for many years. ANDERSON (1929), DOBZHANSKY (1932, 1933), BROWN (1940), PIPKIN ( 1940) and others clearly demonstrated that crossing-over has a strong influence on disjunction in translocation heterozygotes. The reciprocal products of an exchange tend to pass to opposite poles of the first meiotic divis...

Inheritance of embryo thyroid function was measured in lines of turkeys. Two lines that had been selected for either increased egg production (E) or increased 16-wk BW (F) and their respective randombred controls (i.e., RBC1 and RBC2) were examined. Reciprocal crosses of dams and sires from each selected line and its randombred control were made to estimate sire line and dam line effects. Ortho...

Using the Stickelberger-Swan theorem, the parity of the number of irreducible factors of a self-reciprocal even-degree polynomial over a finite field will be hereby characterized. It will be shown that in the case of binary fields such a characterization can be presented in terms of the exponents of the monomials of the self-reciprocal polynomial.

Let Hm(z) be a sequence of polynomials whose generating function ∑∞ m=0 Hm(z)t m is the reciprocal of a bivariate polynomial D(t, z). We show that in the three cases D(t, z) = 1 + B(z)t + A(z)t, D(t, z) = 1 + B(z)t + A(z)t and D(t, z) = 1 + B(z)t + A(z)t, where A(z) and B(z) are any polynomials in z with complex coefficients, the roots of Hm(z) lie on a portion of a real algebraic curve whose e...

Many applications give rise to structured, in particular T-palindromic, matrix polynomials. In order to solve a polynomial eigenvalue problem P (λ)x = 0, where P (λ) is a T-palindromic matrix polynomial, it is convenient to use palindromic linearizations to ensure that the symmetries in the eigenvalues, elementary divisors, and minimal indices of P (λ) due to the palindromicity are preserved. I...

Many applications give rise to structured, in particular T-palindromic, matrix polynomials. In order to solve a polynomial eigenvalue problem P (λ)x = 0, where P (λ) is a T-palindromic matrix polynomial, it is convenient to use palindromic linearizations to ensure that the symmetries in the eigenvalues, elementary divisors, and minimal indices of P (λ) due to the palindromicity are preserved. I...

In this paper, the exact formulae for the generalized degree distance, degree distance and reciprocal degree distance of strong product of a connected and the complete multipartite graph with partite sets of sizes m0, m1, . . . , mr&minus1 are obtained. Using the results obtained here, the formulae for the degree distance and reciprocal degree distance of the closed and open fence graphs are co...

The aircraft conflict detection and resolution problem has been addressed with a wide range of centralised methods in the past few decades, e.g. constraint programming, mathematical programming or metaheuristics. In context autonomous, decentralized collision avoidance without explicit coordination, geometric provide an elegant, cost-effective approach to avoid collisions between mobile agents,...