Related papers: Constructing Goeritz matrix from Dehn coloring mat…

We show that the counting of observables and correlators for a 3-index tensor model are organized by the structure of a family of permutation centralizer algebras. These algebras are shown to be semi-simple and their Wedderburn-Artin…

We introduce the notion of a coloring of a poset, which consists of a labeling of the edges in its Hasse diagram by elements in a given group $G$. We use $G$-colorings to describe the covering maps of posets and present a new method based…

This paper generalizes the bordered-algebraic knot invariant introduced in an earlier paper, giving an invariant now with more algebraic structure. It also introduces signs to define these invariants with integral coefficients. We describe…

Let the join of two graphs be the union of two disjoint graphs connected by $j$ edges in a one-to-one manner. In previous work by Gyurov and Pinzon, which generalized the results of Badura and Rara, the determinant of the adjacency matrix…

A graph embedded in a surface with all faces of size 4 is known as a quadrangulation. We extend the definition of quadrangulation to higher dimensions, and prove that any graph G which embeds as a quadrangulation in the real projective…

We consider knots whose diagrams have a high amount of twisting of multiple strands. By encircling twists on multiple strands with unknotted curves, we obtain a link called a generalized augmented link. Dehn filling this link gives the…

We consider a variant of the ring of components of Hurwitz spaces introduced by Ellenberg, Venkatesh and Westerland. By focusing on Hurwitz spaces classifying covers of the projective line, the resulting ring of components is commutative,…

We prove that coherent configurations can be represented as modules over Frobenius structures in the category of real nonnegative matrices. We generalize the notion of admissible morphism from association schemes to coherent configurations.…

Deep learning has consistently defied state-of-the-art techniques in many fields over the last decade. However, we are just beginning to understand the capabilities of neural learning in symbolic domains. Deep learning architectures that…

We revisit a well-known family of polynomial ideals encoding the problem of graph-$k$-colorability. Our paper describes how the inherent combinatorial structure of the ideals implies several interesting algebraic properties. Specifically,…

In this paper, we find determinant formulas of several Hessenberg-Toeplitz matrices whose nonzero entries are derived from the small and large Schroder and Fine number sequences. Algebraic proofs of these results can be given which make use…

In this paper we resolve the complexity of the isomorphism problem on all but finitely many of the graph classes characterized by two forbidden induced subgraphs. To this end we develop new techniques applicable for the structural and…

In this work we provide a definition of a coloured operad as a monoid in some monoidal category, and develop the machinery of Gr\"obner bases for coloured operads. Among the examples for which we show the existance of a quadratic Gr\"obner…

In this paper we look for closed expressions to calculate the number of colourings of prime knots for given linear Alexander quandles. For this purpose the colouring matrices are simplified to a triangular form, when possible. The…

The connection between matrix integrals and links is used to define matrix models which count alternating tangles in which each closed loop is weighted with a factor n, i.e. may be regarded as decorated with n possible colors. For n=2, the…

Gy\'arfas proved that every coloring of the edges of $K_n$ with $t+1$ colors contains a monochromatic connected component of size at least $n/t$. Later, Gy\'arf\'as and S\'ark\"ozy asked for which values of $\gamma=\gamma(t)$ does the…

Motivated by the definition of linear coloring on simplicial complexes, recently introduced in the context of algebraic topology \cite{Civan}, and the framework through which it was studied, we introduce the linear coloring on graphs. We…

A harmonic map from a Riemannian manifold into a Grassmannian manifold is characterized by a vector bundle, a space of sections of this bundle and a Laplace operator. We apply our main theorem, itself a generalization of a Theorem of…

Van der Waerden's (VDW) colouring theorem in combinatoric number theory [1] has scope for physical applications.The solution of the two colour case has enabled the construction of an explicit mapping of an infinite, one dimensional…

An affine variety induces the structure of an algebraic matroid on the set of coordinates of the ambient space. The matroid has two natural decorations: a circuit polynomial attached to each circuit, and the degree of the projection map to…