Arithmetic properties for (s,t)-regular bipartition functions
نویسندگان
چکیده
منابع مشابه
Arithmetic Properties of a Restricted Bipartition Function
A bipartition of n is an ordered pair of partitions (λ, μ) such that the sum of all of the parts equals n. In this article, we concentrate on the function c5(n), which counts the number of bipartitions (λ, μ) of n subject to the restriction that each part of μ is divisible by 5. We explicitly establish four Ramanujan type congruences and several infinite families of congruences for c5(n) modulo 3.
متن کاملProperties of rational arithmetic functions
Rational arithmetic functions are arithmetic functions of the form g1 ∗···∗ gr ∗ h−1 1 ∗ ···∗h−1 s , where gi, hj are completely multiplicative functions and ∗ denotes the Dirichlet convolution. Four aspects of these functions are studied. First, some characterizations of such functions are established; second, possible Busche-Ramanujan-type identities are investigated; third, binomial-type ide...
متن کاملArithmetic completely regular codes
In this paper, we explore completely regular codes in the Hamming graphs and related graphs. Experimental evidence suggests that many completely regular codes have the property that the eigenvalues of the code are in arithmetic progression. In order to better understand these “arithmetic completely regular codes”, we focus on cartesian products of completely regular codes and products of their ...
متن کاملIdentity Testing for +-Regular Noncommutative Arithmetic Circuits
An efficient randomized polynomial identity test for noncommutative polynomials given by noncommutative arithmetic circuits remains an open problem. The main bottleneck to applying known techniques is that a noncommutative circuit of size s can compute a polynomial of degree exponential in s with a double-exponential number of nonzero monomials. In this paper, which is a follow-up on our earlie...
متن کاملBipartition of Graphs into Subgraphs with Prescribed Hereditary Properties
A hereditary class P is called finitely generated if the set of all minimal forbidden induced subgraphs for P is finite. For a pair of hereditary classes P and Q, we define a hereditary class P ∗ Q of all graphs G which have a partition A ∪ B = V (G) such that G(A) ∈ P and G(B) ∈ Q, where G(X) denotes the subgraph of G induced by X ⊆ V (G). We investigate the problem of recognizing finitely gen...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Number Theory
سال: 2017
ISSN: 0022-314X
DOI: 10.1016/j.jnt.2016.06.017