22 citations · 80 across the 24 of their papers we have counts for
4 papers · 1 filter
On the spectrum and linear programming bound for hypergraphs
Sebastian M. Cioabă, Jack H. Koolen, Masato Mimura +2
The spectrum of a graph is closely related to many graph parameters. In particular, the spectral gap of a regular graph which is the difference between its valency and second eigen…
Avoiding a shape, and the slice rank method for a system of equations
Masato Mimura, Norihide Tokushige
Fix a vector space over a finite field and a system of linear equations. We provide estimates, in terms of the dimension of the vector space, of the maximum of the sizes of subsets…
Avoiding a star of three-term arthmetic progressions
Masato Mimura, Norihide Tokushige
We provide an upper bound of the size of a subset A of F_p^n that does not admit a k-star of 3-APs (three-term arithmetic progressions). Namely, the subset A is assumed to contain…
Multi-way expanders and imprimitive group actions on graphs
Masato Mimura
For n at least 2, the concept of n-way expanders was defined by various researchers. Bigger n gives a weaker notion in general, and 2-way expanders coincide with expanders in usual…