相关论文: Reconstructing a generalized quadrangle from the P…
Effective reconstruction formulas of a curve from its theta hyperplanes are known classically in genus 2 (where the theta hyperplanes are Weierstrass points), and 3 (where, for a generic curve, the theta hyperplanes are bitangents to a…
An association scheme which is associated to a height t presuperscheme is said to be extensible to height t. Smith (1994, 2007) showed that an association scheme X=(Q,\Gamma) of order d:=|Q| is Schurian iff X is extensible to height (d-2).…
We construct a pair of non-commutative rank 8 association schemes from a rank 3 non-symmetric association scheme. For the pair, two association schemes have the same character table but different Frobenius-Schur indicators. This situation…
We study a gauge coupling unification scenario based on a non-supersymmetric 5-dimensional model. Through an orbifold compactification, we obtain the Standard Model with split multiplets on a 4-dimensional wall, which is compatible with a…
In this article we determine feasible parameter sets for (what could potentially be) commutative association schemes with noncyclotomic eigenvalues that are of smallest possible rank and order. A feasible parameter set for a commutative…
We study the standard one-component $\varphi^4$-theory in four dimensions. A renormalized coupling is defined in a finite size renormalization scheme which becomes the standard scheme of the broken phase for large volumes. Numerical…
We prove that every flock generalised quadrangle contains a hemisystem, and we provide a construction method which unifies our results with the examples of Cossidente and Penttila in the classical case.
Bivariate P-polynomial association scheme of type $(\alpha,\beta)$ are defined as a generalization of the P-polynomial association schemes. This generalization is shown to be equivalent to a set of conditions on the intersection parameters.…
We describe the Terwilliger algebras of the four-class Latin-square association schemes arising from Cayley tables of Bol loops. We give some necessary conditions involving Terwilliger algebras for a quasigroup to be a Bol loop.
In this paper we aim to characterize association schemes all of whose symmetric fusion schemes have only integral eigenvalues, and classify those obtained from a regular action of a finite group by taking its orbitals.
The bivariate $P$- and $Q$-polynomial structures of association schemes based on attenuated spaces are examined using recurrence and difference relations of the bivariate polynomials which form the eigenvalues of the scheme. These…
This paper deals with developing techniques for the reconstruction of high-dimensional datasets given each bivariate projection, as would be found in a matrix scatterplot. A graph-based solution is introduced, involving clique-finding,…
An association scheme is called amorphic if every possible fusion of relations gives rise to another association scheme. In earlier work, we showed that if an association scheme has at most one relation that is neither strongly regular of…
We describe a new class of maximal cliques, with a vector space structure, of Cayley graphs defined on the additive group of a field. In particular, we show that in the cubic Paley graph with order $q^3$, the subfield with $q$ elements…
Additive spanners are fundamental graph structures with wide applications in network design, graph sparsification, and distance approximation. In particular, a $4$-additive spanner is a subgraph that preserves all pairwise distances up to…
The structure theory for the quadratic algebra generated by first and second order constants of the motion for 2D second order superintegrable systems with nondegenerate (3-parameter) and or 2-parameter potentials is well understood, but…
We propose and study a hierarchical algorithm to generate graphs having a predetermined distribution of cliques, the fully connected subgraphs. The construction mechanism may be either random or incorporate preferential attachment. We…
A $pseudo$-$oval$ of a finite projective space over a finite field of odd order $q$ is a configuration of equidimensional subspaces that is essentially equivalent to a translation generalised quadrangle of order $(q^n,q^n)$ and a Laguerre…
Finding cliques in random graphs and the closely related "planted" clique variant, where a clique of size t is planted in a random G(n,1/2) graph, have been the focus of substantial study in algorithm design. Despite much effort, the best…
We compute the renormalized trajectory of $\phi^4_4$-theory by perturbation theory in a running coupling. We introduce an iterative scheme without reference to a bare action. The expansion is proved to be finite to every order of…