[HTML][HTML] Commutative association schemes
Association schemes were originally introduced by Bose and his co-workers in the design of
statistical experiments. Since that point of inception, the concept has proved useful in the …
statistical experiments. Since that point of inception, the concept has proved useful in the …
Eigenvalues of Cayley graphs
X Liu, S Zhou - arXiv preprint arXiv:1809.09829, 2018 - arxiv.org
arXiv:1809.09829v3 [math.CO] 22 Apr 2022 Eigenvalues of Cayley graphs Page 1 arXiv:1809.09829v3
[math.CO] 22 Apr 2022 Eigenvalues of Cayley graphs Xiaogang Liu∗ School of Mathematics …
[math.CO] 22 Apr 2022 Eigenvalues of Cayley graphs Xiaogang Liu∗ School of Mathematics …
A new infinite family of hemisystems of the Hermitian surface
A new infinite family of hemisystems of the Hermitian surface Page 1 COMBINATORICA Bolyai
Society – Springer-Verlag 0209–9683/118/$6.00 c 2018 János Bolyai Mathematical Society and …
Society – Springer-Verlag 0209–9683/118/$6.00 c 2018 János Bolyai Mathematical Society and …
Geometric structures in pseudo-random graphs
In this paper, we provide a general framework for counting geometric structures in pseudo-
random graphs. As applications, our theorems recover and improve several results on the …
random graphs. As applications, our theorems recover and improve several results on the …
Explicit Ramsey graphs and Erdos distance problem over finite Euclidean and non-Euclidean spaces
LA Vinh - arXiv preprint arXiv:0711.3508, 2007 - arxiv.org
We study the Erdos distance problem over finite Euclidean and non-Euclidean spaces. Our
main tools are graphs associated to finite Euclidean and non-Euclidean spaces that are …
main tools are graphs associated to finite Euclidean and non-Euclidean spaces that are …
[PDF][PDF] On kaleidoscopic pseudo-randomness of finite Euclidean graphs
L Vinh - Discussiones Mathematicae Graph Theory, 2012 - bibliotekanauki.pl
D. Hart, A. Iosevich, D. Koh, S. Senger and I. Uriarte-Tuero (2008) showed that the distance
graphs has kaleidoscopic pseudo-random property, ie sufficiently large subsets of d …
graphs has kaleidoscopic pseudo-random property, ie sufficiently large subsets of d …
[HTML][HTML] Finite analogues of non-Euclidean spaces and Ramanujan graphs
E Bannai, O Shimabukuro, H Tanaka - European Journal of Combinatorics, 2004 - Elsevier
This is a companion paper of “Finite Euclidean graphs and Ramanujan graphs” by the same
authors. Finite analogues of the Poincaré upper half plane, ie, finite upper half plane graphs …
authors. Finite analogues of the Poincaré upper half plane, ie, finite upper half plane graphs …
Turán problems in pseudorandom graphs
X Liu, D Mubayi, DM Correia - Combinatorics, Probability and …, 2024 - cambridge.org
Turán problems in pseudorandom graphs Page 1 Combinatorics, Probability and
Computing (2024), 1–14 doi:10.1017/S0963548324000142 ARTICLE Turán problems in …
Computing (2024), 1–14 doi:10.1017/S0963548324000142 ARTICLE Turán problems in …
On a Furstenberg-Katznelson-Weiss type theorem over finite fields
LA Vinh - Annals of Combinatorics, 2011 - Springer
Abstract Using Fourier analysis, Covert, Hart, Iosevich, and Uriarte-Tuero (2008) showed
that if the cardinality of a subset of the 2-dimensional vector space over a finite field with q …
that if the cardinality of a subset of the 2-dimensional vector space over a finite field with q …
RANDOM WALKS AND THE” EUCLIDEAN” ASSOCIATION SCHEME IN FINITE VECTOR SPACES
C Brittenham, J Pakianathan - Canadian Journal of Mathematics, 2024 - cambridge.org
In this paper, we provide an application to the random distance-t walk in finite planes and
derive asymptotic formulas (as q→∞) for the probability of return to start point after l steps …
derive asymptotic formulas (as q→∞) for the probability of return to start point after l steps …