相关论文: Equable Parallelograms on the Eisenstein Lattice

The equator of a graph is the length of a longest isometric cycle. We bound the order $n$ of a graph from below by its equator $q$, girth $g$ and minimum degree $\delta$ - and show that this bound is sharp when there exists a Moore graph…

An order-theoretic forest is a countable partial order such that the set of elements larger than any element is linearly ordered. It is an order-theoretic tree if any two elements have an upper-bound. The order type of a branch can be any…

We study the structure and dynamics of the infinite sequence of extensions of the Poincar{\'e} algebra whose method of construction was described in a previous paper [1]. We give explicitly the Maurer-Cartan (MC) 1-forms of the extended Lie…

A graph $\Gamma$ of even order is a bicirculant if it admits an automorphism with two orbits of equal length. Symmetry properties of bicirculants, for which at least one of the induced subgraphs on the two orbits of the corresponding…

Andrei et al. have shown in 2000 that the graph $\boldsymbol{\mathrm{C}}$ of the Collatz function starting with root $8$ after the initial loop is an infinite binary tree $\boldsymbol{A}(8)$. According to their result they gave a…

Similar to Euclidean geometry, graph theory is a science that studies figures that consist of points and lines. The core of Euclidean geometry is the parallel postulate, which provides the basis of the geometric invariant that the sum of…

This paper studies properties of tilings of the plane by parallelograms. In particular it is established that in parallelogram tilings using a finite number of shapes all tiles occur in only finitely many orientations.

We extend the the definition of Kumjian-Pask algebras to include algebras associated to finitely aligned higher-rank graphs. We show that these Kumjian-Pask algebras are universally defined and have a graded uniqueness theorem. We also…

Given $n \geq 1$, we study the existence of a tree on $n$ vertices whose independence polynomial is symmetric and unimodal as well as the existence of a symmetric and unimodal independence polynomial of degree $n$ of a tree.

We introduce a new infinite family of regular graphs admitting nested solutions in the edge-isoperimetric problem for all their Cartesian powers. The obtained results include as special cases most of previously known results in this area.

Suppose that $I$ is a unit square. Let $T$ (resp. $\Delta$) be an isosceles right triangle (resp. an equilateral triangle). We prove that any collection of triangles homothetic to $T$ (resp. $\Delta$), whose total area does not exceed…

In this paper we explain the parallelism in the classification of three different kinds of mathematical objects: (i) Classical r-matrices. (ii) Generalized cohomology theories that have Chern classes for complex vector bundles. (iii)…

The aim of this paper is twofold. First, we study eigenvalues and eigenvectors of the adjacency matrix of a bond percolation graph when the base graph is finite and well approximated locally by an infinite regular graph. We relate…

Let $E$ be the infinite dimensional Grassmann algebra over a field $F$ of characteristic zero. In this paper we investigate the structures of $\mathbb{Z}$-gradings on $E$ of full support. Using methods of elementary number theory, we…

Base on a conjecture, we prove that for any smooth separated stack of finite type over a number field, its descent obstruction equals its iterated descent obstruction. As a consequence, we show that for any algebraic stack over a number…

We study the stochastic parallel dynamics of Ising spin systems defined on finitely connected directed random graphs with arbitrary degree distributions, using generating functional analysis. For fully asymmetric graphs the dynamics of the…

This paper is concerned with certain invariant random processes (called factors of IID) on infinite trees. Given such a process, one can assign entropies to different finite subgraphs of the tree. There are linear inequalities between these…

Let $G$ be a graph on $n$ vertices and $1 \le k \le n$ a fixed integer. The \textit{$k$-token graph} of $G$ is the graph $F_k(G)$ whose vertex set consists of all $k$-subsets of the vertex set of $G$, where two vertices $A$ and $B$ are…

Topological drawings are natural representations of graphs in the plane, where vertices are represented by points, and edges by curves connecting the points. Topological drawings of complete graphs and of complete bipartite graphs have been…

The fundamental role of on-shell diagrams in quantum field theory has been recently recognized. On-shell diagrams, or equivalently bipartite graphs, provide a natural bridge connecting gauge theory to powerful mathematical structures such…