相关论文: Reconstructing a generalized quadrangle from the P…
We propose a geometric explanation for the observation that generic quadratic polynomials over split quaternions may have up to six different factorizations while generic polynomials over Hamiltonian quaternions only have two. Split…
Maximal planar graph refers to the planar graph with the most edges, which means no more edges can be added so that the resulting graph is still planar. The Four-Color Conjecture says that every planar graph without loops is 4-colorable.…
All quasi-affine connected Generalized Dynkin Diagram with rank $= 4$ are found. All quasi-affine Nichols (Lie braided) algebras with rank $ 4$ are also found.
We investigate arrangements of hyperplanes whose normal vectors are given by connected subgraphs of a fixed graph. These include the resonance arrangement and certain ideal subarrangements of Weyl arrangements. We characterize those which…
This work provides explicit characterizations and formulae for the minimal polynomials of a wide variety of structured $4\times 4$ matrices. These include symmetric, Hamiltonian and orthogonal matrices. Applications such as the complete…
The combinatorial structure of a d-dimensional simple convex polytope can be reconstructed from its abstract graph [Blind & Mani 1987, Kalai 1988]. However, no polynomial/efficient algorithm is known for this task, although a polynomially…
It is inevitable that the $L_{g}(s)$ association scheme with $g\geq 3, s\geq g+2$ is a pseudo-$L_{g}(s)$ association scheme. On the contrary, although $s^2$ treatments of the pseudo-$L_{g}(s)$ association scheme can form one $L_{g}(s)$…
In this note we apply a 4-fold sum operation to develop an associativity rule for the pairwise symplectic sum. This allows us to show that certain diffeomorphic symplectic $4$-manifolds made out of elliptic surfaces are in fact…
We give necessary and sufficient conditions for the Terwilliger algebra of a quasi-thin Schurian association scheme to coincide with: (a) the centralizer algebra of a point stabilizer of its automorphism group, and (b) its subspace $T^0$.…
A compatible associative algebra is a vector space endowed with two associative multiplication operations that satisfy a natural compatibility condition. In this paper, we investigate and classify compatible pairs of associative algebras of…
Over a scheme with 2 invertible, we show that a vector bundle of rank four has a sub or quotient line bundle if and only if the canonical symmetric bilinear form on its exterior square has a lagrangian subspace. For this, we exploit a…
We relate degree one grasper families of embedded circles to various constructions of diffeomorphisms found in the literature -- theta clasper classes of Watanabe, barbell diffeomorphisms of Budney and Gabai, and twin twists of Gay and…
As an extension of the former study on 2-dimensional systems, we simulate phase behavior of polymer-grafted colloidal particles in 3 dimensions by molecular Monte Carlo technique in the canonical ensemble. We use a spherically symmetric…
We obtain an explicit criterion for $p$-ary functions to produce association schemes in terms of their Walsh spectrum. Employing this characterization, we explicitly find a correlation between $p$-ary bent functions and association schemes;…
We provide an analysis of the structure of renormalisation scheme invariants for the case of $\phi^4$ theory, relevant in four dimensions. We give a complete discussion of the invariants up to four loops and include some partial results at…
We present two graph drawing algorithms based on the recently defined "grand-Schnyder woods", which are a far-reaching generalization of the classical Schnyder woods. The first is a straight-line drawing algorithm for plane graphs with…
In this paper, we give a method to construct non-symmetric association schemes of class $3$ from non-symmetric association schemes of class $2$. This construction is a non-symmetric analogue of the construction of Taylor graphs as an…
One-dimensional sigma-models with N supersymmetries are considered. For conventional supersymmetries there must be N-1 complex structures satisfying a Clifford algebra and the constraints on the target space geometry can be formulated in…
We present new data structures for quasistrict higher categories, in which associativity and unit laws hold strictly. Our approach has low axiomatic complexity compared to traditional algebraic definitions of higher categories, and we use…
We propose a wide class of preferential attachment models of random graphs, generalizing previous approaches. Graphs described by these models obey the power-law degree distribution, with the exponent that can be controlled in the models.…