Displaying 301 – 320 of 659

Showing per page

Some new infinite families of congruences modulo 3 for overpartitions into odd parts

Ernest X. W. Xia (2016)

Colloquium Mathematicae

Let p ̅ o ( n ) denote the number of overpartitions of n in which only odd parts are used. Some congruences modulo 3 and powers of 2 for the function p ̅ o ( n ) have been derived by Hirschhorn and Sellers, and Lovejoy and Osburn. In this paper, employing 2-dissections of certain quotients of theta functions due to Ramanujan, we prove some new infinite families of Ramanujan-type congruences for p ̅ o ( n ) modulo 3. For example, we prove that for n, α ≥ 0, p ̅ o ( 4 α ( 24 n + 17 ) ) p ̅ o ( 4 α ( 24 n + 23 ) ) 0 ( m o d 3 ) .

Some new transformations for Bailey pairs and WP-Bailey pairs

James Mc Laughlin (2010)

Open Mathematics

We derive several new transformations relating WP-Bailey pairs. We also consider the corresponding transformations relating standard Bailey pairs, and as a consequence, derive some quite general expansions for products of theta functions which can also be expressed as certain types of Lambert series.

Some news about oblique graphs

Andrey A. Dobrynin, Leonid S. Melnikov, Jens Schreyer, Hansjoachim Walther (2002)

Discussiones Mathematicae Graph Theory

A k-gon α of a polyhedral graph G(V,E,F) is of type ⟨b₁,b₂,...,bₖ⟩ if the vertices incident with α in cyclic order have degrees b₁,b₂,...,bₖ and ⟨b₁,b₂,...,bₖ⟩ is the lexicographic minimum of all such sequences available for α. A polyhedral graph G is oblique if it has no two faces of the same type. Among others it is shown that an oblique graph contains vertices of degree 3.

Some news about the independence number of a graph

Jochen Harant (2000)

Discussiones Mathematicae Graph Theory

For a finite undirected graph G on n vertices some continuous optimization problems taken over the n-dimensional cube are presented and it is proved that their optimum values equal the independence number of G.

Some observations on the constructions of chemical balance weighing designs

Ratnakaram Nava Mohan, Bronisław Ceranka, Sanpei Kageyama (2001)

Discussiones Mathematicae Probability and Statistics

The construction of some optimum chemical balance weighing designs from affine μ-resolvable balanced incomplete block (BIB) designs are discussed in the light of a characterization theorem on the parameters of affine μ-resolvable BIB designs as given by Mohan and Kageyama (1982), for the sake of practical use of researchers who need some selective designs for the construction of chemical balance weighing designs.

Some Parity Statistics in Integer Partitions

Aubrey Blecher, Toufik Mansour, Augustine O. Munagi (2015)

Bulletin of the Polish Academy of Sciences. Mathematics

We study integer partitions with respect to the classical word statistics of levels and descents subject to prescribed parity conditions. For instance, a partition with summands λ λ k may be enumerated according to descents λ i > λ i + 1 while tracking the individual parities of λ i and λ i + 1 . There are two types of parity levels, E = E and O = O, and four types of parity-descents, E > E, E > O, O > E and O > O, where E and O represent arbitrary even and odd summands. We obtain functional equations and explicit...

Currently displaying 301 – 320 of 659