Related papers: Full Square Rhomboids and Their Algebraic Expressi…
High-dimensional multiplex graphs are characterized by their high number of complementary and divergent dimensions. The existence of multiple hierarchical latent relations between the graph dimensions poses significant challenges to…
I show how to associate a Clifford algebra to a graph. I describe the structure of these Clifford graph algebras and provide many examples and pictures. I describe which graphs correspond to isomorphic Clifford algebras and also discuss…
A rectangle in the plane can be continuously deformed preserving its edge lengths, but adding a diagonal brace prevents such a deformation. Bolker and Crapo characterized combinatorially which choices of braces make a grid of squares…
The purpose of this paper is to introduce an algebraic cohomology and formal deformation theory of left alternative algebras. Connections to some other algebraic structures are given also.
A rational perfect cuboid is a rectangular parallelepiped whose edges and face diagonals are given by rational numbers and whose space diagonal is equal to unity. Its existence is equivalent to the existence of a perfect cuboid with all…
In a recent paper, algebraic descriptions for all non-relativistic spins were derived by elementary means directly from the Lie algebra $\specialorthogonalliealgebra{3}$, and a connection between spin and the geometry of Euclidean…
In this thesis, we study connections between metric and combinatorial graphs from a Dirichlet space point of view.
A separating algebra is, roughly speaking, a subalgebra of the ring of invariants whose elements distinguish between any two orbits that can be distinguished using invariants. In this paper, we introduce a geometric notion of separating…
One of the questions investigated in deformation theory is to determine to which algebras can a given associative algebra be deformed. In this paper we investigate a different but related question, namely: for a given associative…
We study a structure of the group of unitriangular automorphisms of a free associative algebra and a polynomial algebra and prove that this group is a semi direct product of abelian groups. Using this decomposition we describe a structure…
A generalization of the semisimplicity concept for polyadic algebraic structures is proposed. If semisimple structures can be presented in block diagonal matrix form (resulting in the Wedderburn decomposition), a general form of polyadic…
A graph G(V, E) is word-representable if there exists a word w over V such that distinct letters x and y alternate in w iff $xy \in E$. We introduce p-complete squares and p-complete square-free word-representable graphs. A word is…
The main purpose of this paper is to describe some published results and outline corresponding approaches which when applied to automorphism groups of algebras or groups establish that these groups are linear or non-linear.
Motivated by applications in moduli theory, we introduce a flexible and powerful language for expressing lower bounds on relative dimension of morphisms of schemes, and more generally of algebraic stacks. We show that the theory is robust…
Graph G is the square of graph H if two vertices x,y have an edge in G if and only if x,y are of distance at most two in H. Given H it is easy to compute its square H^2. Determining if a given graph G is the square of some graph is not easy…
We resolve a conjecture of Hegarty regarding the number of edges in the square of a regular graph. If $G$ is a connected $d$-regular graph with $n$ vertices, the graph square of $G$ is not complete, and $G$ is not a member of two narrow…
Modern methods of graph theory describe a graph up to isomorphism, which makes it difficult to create mathematical models for visualizing graph drawings on a plane. The topological drawing of the planar part of a graph allows representing…
We investigate the structure of two-dimensional partial cubes, i.e., of isometric subgraphs of hypercubes whose vertex set defines a set family of VC-dimension at most 2. Equivalently, those are the partial cubes which are not contractible…
Let $G = V, E$ be a simple connected undirected graph. A set $X \subseteq V$ is \emph{geodesically convex} if for any pair of vertices $x, y \in X$, all vertices on all shortest paths in $G$ from $x$ to $y$ are contained in $X$. A set $H…
Given a graph E we define E-algebraic branching systems, show their existence and how they induce representations of the associated Leavitt path algebra. We also give sufficient conditions to guarantee faithfulness of the representations…