Related papers: Reconstructing a generalized quadrangle from the P…
In this paper we characterize "large" regular graphs using certain entries in the projection matrices onto the eigenspaces of the graph. As a corollary of this result, we show that "large" association schemes become $P$-polynomial…
Clique complexes of Erd\H{o}s-R\'{e}nyi random graphs with edge probability between $n^{-{1\over 3}}$ and $n^{-{1\over 2}}$ are shown to be aas not simply connected. This entails showing that a connected two dimensional simplicial complex…
We construct Euler and Stiefel-Whitney classes of vector bundles with quadratic form by analyzing the intersection theory of the associated quadric bundles. We also compute the Chow rings of quadric and isotropic flag bundles. Along the…
Any oriented 4-dimensional real vector bundle is naturally a line bundle over a bundle of quaternion algebras. In this paper we give an account of modules over bundles of quaternion algebras, discussing Morita equivalence, characteristic…
Numerous graph neural network (GNN)-based algorithms have been proposed to solve graph-based combinatorial optimization problems (COPs), but methods to explain their predictions remain largely undeveloped. We introduce ARM-Explainer, a…
We develop the theory of truncated wedge schemes, a higher dimensional analog of jet schemes. We prove some basic properties and give an irreducibility criterion for truncated wedge schemes of a locally complete intersection variety…
We prove that with high probability over the choice of a random graph $G$ from the Erd\H{o}s-R\'enyi distribution $G(n,1/2)$, the $n^{O(d)}$-time degree $d$ Sum-of-Squares semidefinite programming relaxation for the clique problem will give…
We construct freely acting asymmetric $\mathbb{Z}_4$ orbifolds of type IIB string theory on $T^5$ preserving 24,16 or 8 supercharges in five dimensions. We show that these models are well-defined if the SO(8) lattice is chosen, instead of…
We construct a wide subcategory of the category of finite association schemes with a collection of desirable properties. Our subcategory has a first isomorphism theorem analogous to that of groups. Also, standard constructions taking…
In [H. Suzuki, Association schemes with multiple $Q$-polynomial structures, J. Algebraic Combin. 7 (1998) 181-196], Suzuki gave a classification of association schemes with multiple $Q$-polynomial structures, allowing for one exceptional…
4-dimensional $F_{4} $ polytopes and their dual polytopes have been constructed as the orbits of the Coxeter-Weyl group $W(F_{4})$ where the group elements and the vertices of the polytopes are represented by quaternions. Branchings of an…
We give a combinatorial construction of an ordered semiring A, and show that it can be identified with a certain subquotient of the semiring of p-local Bousfield classes, containing almost all of the classes that have previously been named…
C-projective structures are analogues of projective structures in the complex setting. The maximal dimension of the Lie algebra of c-projective symmetries of a complex connection on an almost complex manifold of C-dimension $n>1$ is…
It is well-known that there is a positive relationship between the maximal multiplicity and the length of the associated virtual 1-parameter subgroup of a projective hypersurface. In this paper, we will define the multiplicity classes of…
Higher-dimensional rewriting is founded on a duality of rewrite systems and cell complexes, connecting computational mathematics to higher categories and homotopy theory: the two sides of a rewrite rule are two halves of the boundary of an…
We construct twelve infinite families of pseudocyclic and non-amorphic association schemes, in which each nontrivial relation is a strongly regular graph. Three of the twelve families generalize the counterexamples to A. V. Ivanov's…
In this paper, we investigate the global clustering coefficient (a.k.a transitivity) and clique number of graphs generated by a preferential attachment random graph model with an additional feature of allowing edge connections between…
It is known that a Delsarte $t$-design in a $Q$-polynomial association scheme has degree at least $\left \lceil{\frac{t}{2}}\right \rceil $. Following Ionin and Shrikhande who studied combinatorial $(2s-1)$-designs (i.e., Delsarte designs…
For planar graphs, it is well known that high connectivity implies a Hamiltonian cycle and hence any 4-connected planar graph has a near-perfect matching. Nevertheless, whether 6-connected 1-planar graphs admit near-perfect matchings…
We develop a systematic algorithm for constructing an N-fold supersymmetric system from a given vector space invariant under one of the supercharges. Applying this algorithm to spaces of monomials, we construct a new multi-parameter family…