相关论文: Combinatorics of $A_2$-crystals
Crystals are the materials which can be described by uniform periodic lattices. Traditionally, only the 1-, 2-, 3-, 4- and 6-fold rotation symmetries are allowed in crystals because other n-fold rotation symmetries are forbidden by the…
When two boundary-parabolic representations of knot groups are given, we introduce the connected sum of these representations and show several natural properties including the unique factorization property. Furthermore, the complex volume…
We study in this work the dynamics of a collection of identical hollow spheres (ping-pong balls) that rest on a horizontal metallic grid. Fluidization is achieved by means of a turbulent air current coming from below. The upflow is adjusted…
We give an expression of the $q$-analogues of the multiplicities of weights in irreducible $\sl_{n+1}$-modules in terms of the geometry of the crystal graph attached to the corresponding $U_q(\sl_{n+1})$-modules. As an application, we…
A graph $H$ is said to be common if the number of monochromatic labelled copies of $H$ in a $2$-colouring of the edges of a large complete graph is asymptotically minimized by a random colouring. It is well known that the disjoint union of…
In `A survey of two-graphs' \cite{Sei}, J.J. Seidel lays out the connections between simple graphs, two-graphs, equiangular lines and strongly regular graph. It is well known that there is a one-to-one correspondence between regular…
We present an explicit combinatorial realization of the commutor in the category of crystals which was first studied by Henriques and Kamnitzer. Our realization is based on certain local moves defined by van Leeuwen.
The wavelet group and wavelet representation associated with shifts coming from a two dimensional crystal symmetry group $\Gamma$ and dilations by powers of 3, are defined and studied. The main result is an explicit decomposition of the…
We generalise the concept of duality to systems of ordinary difference equations (or maps). We propose a procedure to construct a chain of systems of equations which are dual, with respect to an integral $H$, to the given system, by…
We present a method for generating hexagonal aperiodic tilings that are topologically equivalent to the triangular and dice lattices. This approach incorporates aperiodic sequences into the spacing between three sets of grids for the…
The theory of Bloembergen and Pershan for the light waves at the boundary of nonlinear media is extended to a nonlinear two-dimensional atomic crystal, i.e. a single planar atomic lattice, placed in between linear bulk media. The crystal is…
This paper provides short proofs of two fundamental theorems of finite semigroup theory whose previous proofs were significantly longer, namely the two-sided Krohn-Rhodes decomposition theorem and Henckell's aperiodic pointlike theorem,…
We define and study a family of partitions of the wonderful compactification \bar{G} of a semi-simple algebraic group G of adjoint type. The partitions are obtained from subgroups of G \times G associated to triples (A_1, A_2, a), where A_1…
In this work, we show that the class of word-representable graphs is closed under split recomposition and determine the representation number of the graph obtained by recomposing two word-representable graphs. Accordingly, we show that the…
We introduce a new model of indeterminacy in graphs: instead of specifying all the edges of the graph, the input contains all triples of vertices that form a connected subgraph. In general, different (labelled) graphs may have the same set…
We construct a four-parameter family of affine Yangian algebras by gluing two copies of the affine Yangian of $\mathfrak{gl}_1$. Our construction allows for gluing operators with arbitrary (integer or half integer) conformal dimension and…
In this paper we consider how the following three objects are related: (i) the dual polar graphs; (ii) the quantum algebra U_q(sl_2); (iii) the Leonard systems of dual q-Krawtchouk type. For convenience we first describe how (ii) and (iii)…
The subdivided double construction on 4-regular graphs was used by Poto\v{c}nik and Wilson to explore semi-symmetric (edge-transitive but not vertex-transitive) graphs, and can be used to construct every semi-symmetric 4-regular graph that…
We prove that there exist perfect graphs of arbitrarily large clique-chromatic number. These graphs can be obtained from cobipartite graphs by repeatedly gluing along cliques. This negatively answers a question raised by Duffus, Sands,…
Matrix congruence can be used to mimic linear maps between homogeneous quadratic polynomials in $n$ variables. We introduce a generalization, called standard-form congruence, which mimics affine maps between non-homogeneous quadratic…