Related papers: Total embedding distributions of Ringel ladders
We show that the distributions occurring in the geometric and spectral side of the twisted Arthur-Selberg trace formula extend to non-compactly supported test functions. The geometric assertion is modulo a hypothesis on root systems proven…
Random geometric graphs (RGGs) are commonly used to model networked systems that depend on the underlying spatial embedding. We concern ourselves with the probability distribution of an RGG, which is crucial for studying its random…
We calculate explicit formulae for the Shannon entropies of several families of tailored random graph ensembles for which no such formulae were as yet available, in leading orders in the system size. These include bipartite graph ensembles…
The splitting number is effective to distinguish the embedded topology of plane curves, and it is not determined by the fundamental group of the complement of the plane curve. In this paper, we give a generalization of the splitting number,…
We develop some basic results about full amalgamation classes with intrinsic trascendentals. These classes have generics whose models may have finite subsets whose intrinsic closure is not contained in its algebraic closure. We will show…
The problem of continuum percolation in dispersions of rods is reformulated in terms of weighted random geometric graphs. Nodes (or sites or vertices) in the graph represent spatial locations occupied by the centers of the rods. The…
We give an algorithm to calculate the minimal and maximal genus of the orientable closed surface where a graph $G$ can be embedded. For this, we construct some special branched coverings of the 2-sphere. We apply this algorithm to calculate…
A shelling of a graph, viewed as an abstract simplicial complex that is pure of dimension 1, is an ordering of its edges such that every edge is adjacent to some other edges appeared previously. In this paper, we focus on complete bipartite…
Let $R=k[|t^a,t^b,t^c|]$ be a complete intersection numerical semigroup ring over an infinite field $k$, where $a,b,c\in\BN$. The generalized Loewy length, which is Auslander's index in this case, is computed in terms of the minimal…
We use spectral theory to produce embeddings of distributions in the algebras of generalized functions on a closed Riemannian manifold. These embeddings are invariant under isometries and preserve the singularity structure of the…
Rotary maps (orientably regular maps) are highly symmetric graph embeddings on orientable surfaces. This paper classifies all rotary maps whose underlying graphs are Praeger-Xu graphs, denoted $\operatorname{C}(p,r,s)$, for any odd prime…
Let $R$ be a commutative ring with $1\not = 0$, $Z(R)$ be the set of all zero-divisors of $R$, and $n \geq 1$. This paper introduces the $n$-total graph of a commutative ring $R$. The $n$-total graph of a commutative ring $R$, denoted by…
In this paper, we study random embeddings of polymer networks distributed according to any potential energy which can be expressed in terms of distances between pairs of monomers. This includes freely jointed chains, steric effects,…
We are interested in the distribution of the number of faces across all the $2-$cell embeddings of a graph, which is equivalent to the distribution of genus by Euler's formula. In order to study this distribution, we consider the local…
We prove that any quasirandom graph with $n$ vertices and $rn$ edges can be decomposed into $n$ copies of any fixed tree with $r$ edges. The case of decomposing a complete graph establishes a conjecture of Ringel from 1963.
We conjecture that every oriented graph $G$ on $n$ vertices with $\delta ^+ (G) , \delta ^- (G) \geq 5n/12$ contains the square of a Hamilton cycle. We also give a conjectural bound on the minimum semidegree which ensures a perfect packing…
The Erd\H{o}s-S\'os Conjecture states that every graph with average degree exceeding $k-1$ contains every tree with $k$ edges as a subgraph. We prove that there are $\delta>0$ and $k_0\in\mathbb N$ such that the conjecture holds for every…
In 1986, Oliver Pretzel studied the set of orientations of a connected finite graph $G$ and showed that any two such orientations having the same flow-difference around all closed loops can be obtained from one another by a succession of…
A tangled-diagram over $[n]=\{1,...,n\}$ is a graph of degree less than two whose vertices $1,...,n$ are arranged in a horizontal line and whose arcs are drawn in the upper halfplane with a particular notion of crossings and nestings.…
In this dissertation, we explore the structure of inversion graphs of permutations--a class of graphs that naturally arises by representing each permutation as a graph, where vertices correspond to entries and edges encode inversions.…