Related papers: Doubly periodic textile patterns
Natural and man-made transport webs are frequently dominated by dense sets of nested cycles. The architecture of these networks, as defined by the topology and edge weights, determines how efficiently the networks perform their function.…
Collective organisation of patterns into ring-like configurations has been well-studied when patterns are subject to either weak or semi-strong interactions. However, little is known numerically or analytically about their formation when…
We investigate broken rational tori consisting of a chain of four (rather than two) periodic orbits. The normal form that describes this configuration is identified and used to construct a uniform semiclassical approximation, which can be…
A model of random walk on knot diagrams is used to study the Alexander polynomial and the colored Jones polynomial of knots. In this context, the inverse of the Alexander polynomial of a knot plays the role of an Ihara-Selberg zeta function…
Triply-periodic networks (TPNs), like the well-known gyroid and diamond network phases, abound in soft matter assemblies, from block copolymers (BCPs), lyotropic liquid crystals and surfactants to functional architectures in biology. While…
It is known, since works of Burde and de Rham, that one can detect the roots of the Alexander polynomial of a knot by the study of the representations of the knot group into the group of the invertible upper triangular $2x2$ matrices. In…
We extend the construction of the DAHA-Jones polynomials for any reduced root systems and DAHA-superpolynomials in type A from the iterated torus knots (our previous paper) to links, including arbitrary algebraic links. Such a passage…
The vector space spanned by rooted forests admits two graded bialgebra structures. The first is defined by A. Connes and D. Kreimer using admissible cuts, and the second is defined by D. Calaque, K. Ebrahimi-Fard and the second author using…
This work concerns the study of properties of a group of Koszul algebras coming from the toric ideals of a chordal bipartite infinite family of graphs (alternately, these rings may be interpreted as coming from determinants of certain…
Double stranded quasiperiodic copper mean arrangement has been studied in respect of their electronic property and thermoelectric signature. The two-arm network is demonstrated by a tight binding Hamiltonian. The eigenspectrum of such…
The twist construction is a method to build new interesting examples of geometric structures with torus symmetry from well-known ones. In fact it can be used to construct arbitrary nilmanifolds from tori. In our previous paper, we presented…
We investigate the twisted Alexander polynomial of a 2-bridge knot associated to a Fox coloring. For several families of 2-bridge knots, including but not limited to, torus knots and genus-one knots, we derive formulae for these twisted…
The group of a nontrivial knot admits a finite permutation representation such that the corresponding twisted Alexander polynomial is not a unit.
The Burau representation of the braid group can be used to recover the Alexander polynomial of the closure of a braid. We define twisted Burau maps and use them to compute twisted Alexander polynomials.
Core-periphery structure is a common property of complex networks, which is a composition of tightly connected groups of core vertices and sparsely connected periphery vertices. This structure frequently emerges in traffic systems, biology,…
Given a connected undirected graph $G$, a spanning tree is a subgraph $T$ of $G$ such that $V(T) = V(G)$ and $T$ is a tree. A collection of $\ell$ spanning trees $T_1,\ldots,T_\ell$ is pairwise $k$-diverse if for every $i \neq j$, $|E(T_i)…
Transversal structures (also known as regular edge labelings) are combinatorial structures defined over 4-connected plane triangulations with quadrangular outer-face. They have been intensively studied and used for many applications…
We establish a connection between knot theory and cluster algebras via representation theory. To every knot diagram (or link diagram), we associate a cluster algebra by constructing a quiver with potential. The rank of the cluster algebra…
We classify the twisted tensor products of a finite set algebra with a two elements set algebra using colored quivers obtained through considerations analogous to Ore extensions. This provides also a classification of entwining structures…
Linear recurrent sequences are those whose elements are defined as linear combinations of preceding elements, and finding recurrence relations is a fundamental problem in computer algebra. In this paper, we focus on sequences whose elements…