相关论文: The Algebra of an Age for Metrically Homogeneous G…
Graphs that are squares under the gluing algebra arise in the study of homomorphism density inequalities such as Sidorenko's conjecture. Recent work has focused on these homomorphism density applications. This paper takes a new perspective…
A digraph is connected-homogeneous if every isomorphism between two finite connected induced subdigraphs extends to an automorphism of the whole digraph. In this paper, we completely classify the countable connected-homogeneous digraphs.
The profile of a relational structure $R$ is the function $\varphi_R$ which counts for every integer $n$ the number, possibly infinite, $\varphi_R(n)$ of substructures of $R$ induced on the $n$-element subsets, isomorphic substructures…
P.J.Cameron introduced the orbit algebra of a permutation group and conjectured that this algebra is an integral domain if and only if the group has no finite orbit. We prove that this conjecture holds and in fact that the age algebra of a…
We consider the permutation group algebra defined by Cameron and show that if the permutation group has no finite orbits, then no homogeneous element of degree one is a zero-divisor of the algebra. We proceed to make a conjecture which…
In the branch of mathematics known as graph theory, graphs are considered as a set of points, called vertices, with connections between these points, called edges. The purpose of this paper is to study mappings between two graphs that have…
We associate to each synchronous game an algebra whose representations determine if the game has a perfect deterministic strategy, perfect quantum strategy or one of several other perfect strategies. when applied to the graph coloring game,…
We define a normal graph algebra modeled on algebras used in genetics. Although the algebra does not always determine its graph, it often highlights special features. After developing basic properties of the algebra, we examine those of…
The monography examines the problem of constructing a group of automorphisms of a graph. A graph automorphism is a mapping of a set of vertices onto itself that preserves adjacency. The set of such automorphisms forms a vertex group of a…
Let $M$ be a Fra\"{i}ss\'{e} structure (a countably infinite ultrahomogeneous structure). We refer to the class of structures embeddable in $M$ as the $\omega$-age of $M$. We consider the following two properties of $M$: we say that $M$ has…
An algorithm is presented that generates sets of size equal to the degree of a given variety defined by a homogeneous ideal. This algorithm suggests a versatile framework to study various problems in combinatorial algebraic geometry and…
A graph $X$ is said to be a pattern polynomial graph if its adjacency algebra is a coherent algebra. In this study we will find a necessary and sufficient condition for a graph to be a pattern polynomial graph. Some of the properties of the…
A countable graph is ultrahomogeneous if every isomorphism between finite induced subgraphs can be extended to an automorphism. Woodrow and Lachlan showed that there are essentially four types of such countably infinite graphs: the random…
To any directed graph we associate an algebra with edges of the graph as generators and with relations defined by all pairs of directed paths with the same origin and terminus. Such algebras are related to factorizations of polynomials over…
The algebraic geometry of a universal algebra $\mathbf{A}$ is defined as the collection of solution sets of term equations. Two algebras $\mathbf{A}_1$ and $\mathbf{A}_2$ are called algebraically equivalent if they have the same algebraic…
In this short note, we describe the so-called homogeneous involution on finite-dimensional graded-division algebra over an algebraically closed field. We also compute their graded polynomial identities with involution. As pointed out by L.…
Metric algebras are metric variants of $\Sigma$-algebras. They are first introduced in the field of universal algebra to deal with algebras equipped with metric structures such as normed vector spaces. Recently a similar notion of…
We consider algebras with basis numerated by elements of a group $G.$ We fix a function $f$ from $G\times G$ to a ground field and give a multiplication of the algebra which depends on $f$. We study the basic properties of such algebras. In…
Many computational problems admit fast algorithms on special inputs, however, the required properties might be quite restrictive. E.g., many graph problems can be solved much faster on interval or cographs, or on graphs of small…
A monomial algebra is the quotient of a polynomial algebra by an ideal generated by monomials. We prove that finite-dimensional monomial algebras are characterized by their automorphism group among finite-dimensional, local algebras with…