Newman's identities, lucas sequences and congruences for certain partition functions

Let r be an integer with 2 ≤ r ≤ 24 and let pr(n) be defined by $\sum _{n=0}^\infty p_r(n) q^n = \prod _{k=1}^\infty (1-q^k)^r$. In this paper, we provide uniform methods for discovering infinite families of congruences and strange congruences for pr(n) by using some identities on pr(n) due to Newman. As applications, we establish many infinite families of congruences and strange congruences for certain partition functions, such as Andrews's smallest parts function, the coefficients of Ramanujan's ϕ function and p-regular partition functions. For example, we prove that for n ≥ 0, \[ \textrm{spt}\bigg( \frac{1991n(3n+1) }{2} +83\bigg) \equiv \textrm{spt}\bigg(\frac{1991n(3n+5)}{2} +2074\bigg) \equiv 0\ (\textrm{mod} \ 11), \] and for k ≥ 0, \[ \textrm{spt}\bigg( \frac{143\times 5^{6k} +1 }{24}\bigg)\equiv 2^{k+2} \ (\textrm{mod}\ 11), \] where spt(n) denotes Andrews's smallest parts function.

A general method to obtain the spectrum and local spectra of a graph from its regular partitions

It is well known that, in general, part of the spectrum of a graph can be obtained from the adjacency matrix of its quotient graph given by a regular partition. In this paper, a method that gives all the spectrum, and also the local spectra, of a graph from the quotient matrices of some of its regular partitions, is proposed. Moreover, from such partitions, the $C$-local multiplicities of any class of vertices $C$ is also determined, and some applications of these parameters in the characterization of completely regular codes and their inner distributions are described. As examples, it is shown how to find the eigenvalues and (local) multiplicities of walk-regular, distance-regular, and distance-biregular graphs.

Cell Mapping Modeling for Complex Systems Based on ISODATA Algorithm

This paper presents a new type of modeling framework for complex dynamical systems based on cell mapping. The systems considered are difficult in modeling by physical principle due to complex mechanism. By the method of data driven, the cell mapping model is constructed and the modeling objective is describing statistical dynamic trajectory for this kind of complex system, which overcome the difficulties found in mechanism modeling. Firstly, the clustering of operation modes is achieved by Self-Organizing Data Analysis Techniques Algorithm (ISODATA). Then, a cell division measure is obtained by the clustering result, which is different from the regular partition in other measures. Meanwhile, each class bound is treated as a cell bound, and hence the dynamic trajectory of complex systems is described by the cell mapping. Finally, a simulated experience illustrates the feasibility of the proposed approach.

On Regularity Lemmas and their Algorithmic Applications

Szemerédi's regularity lemma and its variants are some of the most powerful tools in combinatorics. In this paper, we establish several results around the regularity lemma. First, we prove that whether or not we include the condition that the desired vertex partition in the regularity lemma is equitable has a minimal effect on the number of parts of the partition. Second, we use an algorithmic version of the (weak) Frieze–Kannan regularity lemma to give a substantially faster deterministic approximation algorithm for counting subgraphs in a graph. Previously, only an exponential dependence for the running time on the error parameter was known, and we improve it to a polynomial dependence. Third, we revisit the problem of finding an algorithmic regularity lemma, giving approximation algorithms for several co-NP-complete problems. We show how to use the weak Frieze–Kannan regularity lemma to approximate the regularity of a pair of vertex subsets. We also show how to quickly find, for each ε′>ε, an ε′-regular partition withkparts if there exists an ε-regular partition withkparts. Finally, we give a simple proof of the permutation regularity lemma which improves the tower-type bound on the number of parts in the previous proofs to a single exponential bound.

Arithmetic completely regular codes

International audience 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 corresponding coset graphs in the additive case. Employing earlier results, we are then able to prove a theorem which nearly classifies these codes in the case where the graph admits a completely regular partition into such codes (e.g, the cosets of some additive completely regular code). Connections to the theory of distance-regular graphs are explored and several open questions are posed.