Proof of a conjecture on a congruence modulo 243 for overpartitions

Periodica Mathematica Hungarica - Let $$\bar{p}(n)$$ denote the number of overpartitions of n. Recently, numerous congruences modulo powers of 2, 3 and 5 were established regarding $$\bar{p}(n)$$ ....     

Partitions weighted by the parity of the crank

The ‘crank’ is a partition statistic which originally arose to give combinatorial interpretations for Ramanujan's famous partition congruences. In this paper, we establish an asymptotic formula and a family of Ramanujan type congruences satisfied by the number of partitions of n with even crank Me(n) minus the number of partitions of n with odd crank Mo(n). We also discuss the combinatorial implications of q-series identities involving Me(n)−Mo(n). Finally, we determine the exact values of Me(n)−Mo(n) in the case of partitions into distinct parts. These values are at most two, and zero for infinitely many n.     

Disjoint congruence classes and a timetabling application

We consider a combinatorial problem motivated by a special simplified timetabling problem for subway networks. Mathematically the problem is to find (pairwise) disjoint congruence classes modulo certain given integers; each such class corresponds to the arrival times of a subway line of a given frequency. For a large class of instances we characterize when such disjoint congruence classes exist and how they may be determined. We also study a generalization involving a minimum distance requirement between congruence classes, and a comparison of different frequency families in terms of their “efficiency”. Finally, a general method based on integer programming is also discussed.     

A generalization of a curious congruence on harmonic sums

Zhao established a curious harmonic congruence for prime :

In this note the authors extend it to the following congruence for any prime and positive integer :

Other improvements on congruences of harmonic sums are also obtained.

     

On a congruence conjecture of Swisher

A congruence on a conjecture of van Hamme is established. This result confirms a particular case of a congruence conjecture of Swisher.     

On the Andrews-Stanley refinement of Ramanujan's partition congruence modulo and generalizations

In a recent study of sign-balanced, labelled posets, Stanley introduced a new integral partition statistic

where denotes the number of odd parts of the partition and is the conjugate of . In a forthcoming paper, Andrews proved the following refinement of Ramanujan's partition congruence mod :

where () denotes the number of partitions of with and is the number of unrestricted partitions of . Andrews asked for a partition statistic that would divide the partitions enumerated by () into five equinumerous classes.

In this paper we discuss three such statistics: the ST-crank, the -quotient-rank and the -core-crank. The first one, while new, is intimately related to the Andrews-Garvan (1988) crank. The second one is in terms of the -quotient of a partition. The third one was introduced by Garvan, Kim and Stanton in 1990. We use it in our combinatorial proof of the Andrews refinement. Remarkably, the Andrews result is a simple consequence of a stronger refinement of Ramanujan's congruence mod . This more general refinement uses a new partition statistic which we term the BG-rank. We employ the BG-rank to prove new partition congruences modulo . Finally, we discuss some new formulas for partitions that are -cores and discuss an intriguing relation between -cores and the Andrews-Garvan crank.

     

Proof of a conjecture on game domination

Let G(V, E) be a simple, undirected graph where V is the set of vertices and E is the set of edges. A b‐dimensional cube is a Cartesian product I₁×I₂×···×I_b, where each I_i is a closed interval of unit length on the real line. The cubicity of G, denoted by cub(G), is the minimum positive integer b such that the vertices in G can be mapped to axis parallel b‐dimensional cubes in such a way that two vertices are adjacent in G if and only if their assigned cubes intersect. An interval graph is a graph that can be represented as the intersection of intervals on the real line—i.e. the vertices of an interval graph can be mapped to intervals on the real line such that two vertices are adjacent if and only if their corresponding intervals overlap. Suppose S(m) denotes a star graph on m+1 nodes. We define claw number ψ(G) of the graph to be the largest positive integer m such that S(m) is an induced subgraph of G. It can be easily shown that the cubicity of any graph is at least ?log₂ψ(G)?. In this article, we show that for an interval graph G ?log₂ψ(G)??cub(G)??log₂ψ(G)?+2. It is not clear whether the upper bound of ?log₂ψ(G)?+2 is tight: till now we are unable to find any interval graph with cub(G)>?log₂ψ(G)?. We also show that for an interval graph G, cub(G)??log₂α?, where α is the independence number of G. Therefore, in the special case of ψ(G)=α, cub(G) is exactly ?log₂α₂?. The concept of cubicity can be generalized by considering boxes instead of cubes. A b‐dimensional box is a Cartesian product I₁×I₂×···×I_b, where each I_i is a closed interval on the real line. The boxicity of a graph, denoted box(G), is the minimum k such that G is the intersection graph of k‐dimensional boxes. It is clear that box(G)?cub(G). From the above result, it follows that for any graph G, cub(G)?box(G)?log₂α?. © 2010 Wiley Periodicals, Inc. J Graph Theory 65: 323–333, 2010     

Proof of a conjecture on monomial graphs

Let e be a positive integer, p be an odd prime, $q=p^e$, and ${\mathbb{F}}_q$ be the finite field of q elements. Let $f,g\in {\mathbb{F}}_q[X,Y]$. The graph $G_q(f,g)$ is a bipartite graph with vertex partitions $P={\mathbb{F}}_q^3$ and $L={\mathbb{F}}_q^3$, and edges defined as follows: a vertex $(p)=(p_1,p_2,p_3)\in P$ is adjacent to a vertex $[l]=[l_1,l_2,l_3]\in L$ if and only if $p_2+l_2=f(p_1,l_1)$ and $p_3+l_3=g(p_1,l_1)$. If $f=XY$ and $g=X{Y}^2$, the graph $G_q(XY,X{Y}^2)$ contains no cycles of length less than eight and is edge-transitive. Motivated by certain questions in extremal graph theory and finite geometry, people search for examples of graphs $G_q(f,g)$ containing no cycles of length less than eight and not isomorphic to the graph $G_q(XY,X{Y}^2)$, even without requiring them to be edge-transitive. So far, no such graphs $G_q(f,g)$ have been found. It was conjectured that if both f and g are monomials, then no such graphs exist. In this paper we prove the conjecture.     

Proof of a conjecture of Metsch

In this paper we prove a conjecture of Metsch about the maximum number of lines intersecting a pointset in PG(2,q), presented at the conference “Combinatorics 2002”. As a consequence, we give a short proof of the famous Jamison, Brouwer and Schrijver bound on the size of the smallest affine blocking set in AG(2,q).     

On the subsemilattices of first-order definable and openly first-order definable congruences of the congruence lattice of a universal algebra

We prove some representation theorems for lattices and their lower subsemilattices as the lattices of congruences and subsemilattices of first-order definable congruences of universal algebras.     

Proof of a conjecture on fractional Ramsey numbers

Jacobson, Levin, and Scheinerman introduced the fractional Ramsey function r_f (a₁, a₂, …, a_k) as an extension of the classical definition for Ramsey numbers. They determined an exact formula for the fractional Ramsey function for the case k=2. In this article, we answer an open problem by determining an explicit formula for the general case k>2 by constructing an infinite family of circulant graphs for which the independence numbers can be computed explicitly. This construction gives us two further results: a new (infinite) family of star extremal graphs which are a superset of many of the families currently known in the literature, and a broad generalization of known results on the chromatic number of integer distance graphs. © 2009 Wiley Periodicals, Inc. J Graph Theory 63: 164–178, 2010     

Proof of a conjecture on irredundance perfect graphs

Let ir(G) and γ(G) be the irredundance number and the domination number of a graph G, respectively. A graph G is called irredundance perfect if ir(H)=γ(H), for every induced subgraph H of G. In this article we present a result which immediately implies three known conjectures on irredundance perfect graphs. © 2002 Wiley Periodicals, Inc. J Graph Theory 41: 292–306, 2002     

Arithmetic properties of overpartition triples

Let p_3(n) be the number of overpartition triples of n. By elementary series manipulations,we establish some congruences for p_3(n) modulo small powers of 2, such as p_3(16 n + 14) ≡ 0(mod 32), p_3(8 n + 7) ≡ 0(mod 64).We also find many arithmetic properties for p_3(n) modulo 7, 9 and 11, involving the following infinite families of Ramanujan-type congruences: for any integers α≥ 1 and n ≥ 0, we have p_3 (3~(2α+1)(3n + 2))≡ 0(mod 9 · 2~4), p_3(4~(α-1)(56 n + 49)) ≡ 0(mod 7),p_3 (7~(2α+1)(7 n + 3))≡ p_3 (7~(2α+1)(7 n + 5))≡ p_3 (7~(2α+1)(7 n + 6))≡ 0(mod 7),and for r ∈ {1, 2, 3, 4, 5, 6},p_3(11 · 7~(4α-1)(7 n + r)≡ 0(mod 11).     

Proof of three conjectures on congruences

This paper proves three conjectures on congruences involving central binomial coefficients or Lucas sequences.Let p be an odd prime and let a be a positive integer.It is shown that if p=1(mod 4)or a1then where(—)denotes the Jacobi symbol.This confirms a conjecture of the second author.A conjecture of Tauraso is also confirmed by showing that where the Lucas numbers Lo,L_1,L_2,...are defined by L_0=2,L_1=1 and L_n+1=L_n+L_n-l(n=1,2,3,...).The third theorem states that if p=5 then F_p~a-(p~a/5)mod p~3 can be determined in the following way:which appeared as a conjecture in a paper of Sun and Tauraso in 2010.     

Proof of a conjecture of Alan Hartman

A tree T is said to be bad, if it is the vertex‐disjoint union of two stars plus an edge joining the center of the first star to an end‐vertex of the second star. A tree T is good, if it is not bad. In this article, we prove a conjecture of Alan Hartman that, for any spanning tree T of K_2m, where m ≥ 4, there exists a (2m − 1)‐edge‐coloring of K_2m such that all the edges of T receive distinct colors if and only if T is good. © 1999 John Wiley & Sons, Inc. J Graph Theory 30: 7–17, 1999     

Proof of a conjecture on multisets of hook numbers

A conjecture of Regev and Vishik on the equality of two multisets of hook numbers is proved. Supported in part by N.S.F. Grant No. DMS-94-01197. Supported in part by N.S.F. Grant No. DMS-95-00646.