关于正整数奇偶分拆数的计算问题

正整数n的分拆是指将正整数n表示成一个或多个正整数的无序和,设O(n,m)表示将正整数n分拆成m个奇数之和的分拆数;e(n,m)表示将正整数n分拆成m个偶数之和的分拆数.本文用初等方法给出了将O(n,m),e(n,m)分别化为有限个O(n,2),e(n,2)的和的计算公式,进而达到计算O(n,m),e(n,m)的值.同时,还讨论了将正整数n分拆成互不相同的奇数或偶数的分拆数的相应的递推计算方法.     

A note on the total number of cycles of even and odd permutations

We prove bijectively that the total number of cycles of all even permutations of [n]={1,2,…,n} and the total number of cycles of all odd permutations of [n] differ by (−1)ⁿ(n−2)!, which was stated as an open problem by Miklós Bóna. We also prove bijectively the following more general identity:

     

An extension to overpartitions of the Rogers-Ramanujan identities for even moduli

We study a class of well-poised basic hypergeometric series , interpreting these series as generating functions for overpartitions defined by multiplicity conditions on the number of parts. We also show how to interpret the as generating functions for overpartitions whose successive ranks are bounded, for overpartitions that are invariant under a certain class of conjugations, and for special restricted lattice paths. We highlight the cases (a,q)→(1/q,q), (1/q,q²), and (0,q), where some of the functions become infinite products. The latter case corresponds to Bressoud's family of Rogers-Ramanujan identities for even moduli.     

On the number of distinct prime factors of an odd perfect number

It is not known whether or not there exists an odd perfect number. We describe an algorithmic approach for showing that if there is an odd perfect number then it has t distinct prime factors, and we discuss its application towards showing that t9.     

On the total number of prime factors of an odd perfect number

We say is perfect if , where denotes the sum of the positive divisors of . No odd perfect numbers are known, but it is well known that if such a number exists, it must have prime factorization of the form , where , , ..., are distinct primes and . We prove that if or for all , , then . We also prove as our main result that , where . This improves a result of Sayers given in 1986.

     

Packing graphs with odd and even trees

The Gyárfás-Lehel tree-packing conjecture asserts that any sequence T₁, T₂, …, T_n^?1 of trees with 1, 2, …, n - 1 edges packs into the complete graph K_n on n vertices. The present paper examines two conjectures that jointly imply the Gyárfás-Lehel conjecture: 1. For n even, any T₁, T₃, …, T_n^?1 pack into the half-complete graph Hn on n vertices.2. For n odd, any T₂, T₄, …, T_n^?1 pack into the half-complete graph Hn on n vertices. The H_n are uniquely defined by their degree sequences: H_n and H_n+1 are complements in K_n+1. It is shown that H_n and T_n+1 pack into H_n+2 if T_n+1 is a double star, unimodal triple star, interior-3 caterpillar, or scorpion. Hence Conjectures 1 and 2 are true for these specialized types of trees. The conjectures are also valid for all trees when n ≤ 9, so that the Gyárfás-Lehel conjecture holds for n ≤ 9.     

Generalized even and odd totally positive matrices

A generalization of the definition of an oscillatory matrix based on the theory of cones is given in this paper. The positivity and simplicity of all the eigenvalues of a generalized oscillatory matrix are proved. Classes of generalized even and odd oscillatory matrices are introduced. Spectral properties of the obtained matrices are studied. Criteria of generalized even and odd oscillation are given. Examples of generalized even and odd oscillatory matrices are presented.     

On the number of partitions with distinct even parts

Let ped(n) be the number of partitions of n wherein even parts are distinct (and odd parts are unrestricted). We obtain many congruences for ped(n)mod2 and mod4 by the theory of Hecke eigenforms.     

On the largest prime divisor of an odd harmonic number

A positive integer is called a (Ore's) harmonic number if its positive divisors have integral harmonic mean. Ore conjectured that every harmonic number greater than is even. If Ore's conjecture is true, there exist no odd perfect numbers. In this paper, we prove that every odd harmonic number greater than must be divisible by a prime greater than .

     

On a convex body with odd hadwiger number

We construct a convex body K ⊃ ℝ³ such that the maximum number of mutually nonoverlapping translates of K which touch K is 15. The work is in part supported by grant no. T043556 of the Hungarian National Science Foundation (OTKA).     

On the linear classification of even and odd permutation matrices and the complexity of computing the permanent

The problem of linear classification of the parity of permutation matrices is studied. This problem is related to the analysis of complexity of a class of algorithms designed for computing the permanent of a matrix that generalizes the Kasteleyn algorithm. Exponential lower bounds on the magnitude of the coefficients of the functional that classifies the even and odd permutation matrices in the case of the field of real numbers and similar linear lower bounds on the rank of the classifying map for the case of the field of characteristic 2 are obtained.     

On periodic groups of odd period n ≥ 1003

In the paper, using the Adyan-Lysenok theorem claiming that, for any odd number n ≥ 1003, there is an infinite group each of whose proper subgroups is contained in a cyclic subgroup of order n, it is proved that the set of groups with this property has the cardinality of the continuum (for a given n). Further, it is proved that, for m ≥ k ≥ 2 and for any odd n ≥ 1003, the m-generated free n-periodic group is residually both a group of the above type and a k-generated free n-periodic group, and it does not satisfy the ascending and descending chain conditions for normal subgroups either.     

Parameterized complexity of even/odd subgraph problems

We study the parameterized complexity of the problems of determining whether a graph contains a k-edge subgraph (k-vertex induced subgraph) that is a Π-graph for Π-graphs being one of the following four classes of graphs: Eulerian graphs, even graphs, odd graphs, and connected odd graphs. We also consider the parameterized complexity of their parametric dual problems.For these sixteen problems, we show that eight of them are fixed parameter tractable and four are W[1]-hard. Our main techniques are the color-coding method of Alon, Yuster and Zwick, and the random separation method of Cai, Chan and Chan.     

On generalized fibonacci groups with an odd number of generators

The geometrical properties of cyclically presented groups of Fibonacci type F(r,m, k)and H(r,m,k)are discussed. It is shown that for even rand odd m some infinite family of generalized Fibonacci groups F(r, m, k)cannot be fundamental groups of hyperbolic 3-orbifolds of finite volume.     

On Minkowski type question mark functions associated with even or odd continued fractions

Monatshefte für Mathematik - We study analogues of Minkowski’s question mark function ?(x) related to continued fractions with even or with odd partial quotients. We prove that these...