Related papers: On Dantzig figures from graded lexicographic order…
Given the integral lattice $\Lambda^d$ in $d$-dimensional Euclidean space, partitions of the lattice nodes into orbits of finite-index subgroups of $Aut(\Lambda^d)$ have been computed for $d \leq 4$. These partitions can be interpreted as…
Given the degree sequence $d$ of a graph, the realization graph of $d$ is the graph having as its vertices the labeled realizations of $d$, with two vertices adjacent if one realization may be obtained from the other via an edge-switching…
Let ${\cal G}=(G,w) $ be a positive-weighted graph, that is a graph $G$ endowed with a function $w$ from the edge set of $G$ to the set of positive real numbers; for any distinct vertices $i,j $, we define $D_{i,j}({\cal G})$ to be the…
Semialgebraic graphs are graphs whose vertices are points in $\mathbb{R}^d$, and adjacency between two vertices is determined by the truth value of a semialgebraic predicate of constant complexity. We show how to harness polynomial…
We introduce the notion of a polyptych lattice, which encodes a collection of lattices related by piecewise linear bijections. We initiate a study of the new theory of convex geometry and polytopes associated to polyptych lattices. In…
Let $K$ be a finitely generated field. We construct an $n$-dimensional linear system $\mathcal{L}$ of hypersurfaces of degree $d$ in $\mathbb{P}^n$ defined over $K$ such that each member of $\mathcal{L}$ defined over $K$ is smooth, under…
Let $G$ be a group. The directed endomorphism graph, $\dend(G)$ of $G$ is a directed graph with vertex set $G$ and there is a directed edge from the vertex $a$ to the vertex $b$ if $a \neq b$ and there exists an endomorphism on $G$ mapping…
We study stable curves of arithmetic genus 2 which admit two morphisms of finite degree $p$, resp. $d$, onto smooth elliptic curves, with particular attention to the case $p$ prime.
It is known that the Levi graph of any rank two coset geometry is an edge-transitive graph, and thus coset geometries can be used to construct many edge transitive graphs. In this paper, we consider the reverse direction. Starting from…
In this paper, we study oriented bipartite graphs. In particular, we introduce "bitransitive" graphs. Several characterizations of bitransitive bitournaments are obtained. We show that bitransitive bitounaments are equivalent to acyclic…
The Gruenberg-Kegel graph ${\rm GK}(G)=(V_G, E_G)$ of a finite group $G$ is a simple graph with vertex set $V_G=\pi(G)$, the set of all primes dividing the order of $G$, and such that two distinct vertices $p$ and $q$ are joined by an edge,…
An ordered hypergraph is a hypergraph whose vertex set is linearly ordered, and a convex geometric hypergraph is a hypergraph whose vertex set is cyclically ordered. Extremal problems for ordered and convex geometric graphs have a rich…
We develop a new framework for analysing finite connected, oriented graphs of valency 4, which admit a vertex-transitive and edge-transitive group of automorphisms preserving the edge orientation. We identify a sub-family of "basic" graphs…
In earlier papers, we showed a decomposition of 2-diregular digraphs (2-dds) and used it to provide some sufficient conditions for these graphs to be non-Hamiltonian; we also showed a close connection between the permanent and determinant…
We define a simple orthogonal polyhedron to be a three-dimensional polyhedron with the topology of a sphere in which three mutually-perpendicular edges meet at each vertex. By analogy to Steinitz's theorem characterizing the graphs of…
Bisztriczky defines a multiplex as a generalization of a simplex, and an ordinary polytope as a generalization of a cyclic polytope. This paper presents results concerning the combinatorics of multiplexes and ordinary polytopes. The flag…
We construct double Grothendieck polynomials of classical types which are essentially equivalent to but simpler than the polynomials defined by A.N.Kirillov in arXiv:1504.01469 and identify them with the polynomials defined by T.Ikeda and…
We study graphs coming from quadratic spaces over finite fields via orthogonality which generalize a recent result given by Bishnoi, Ihringer, and Pepe (2019). More precisely, we study the graph $\Gamma^{\square}(n,k,q)$ as follows: the…
We define non-commutative versions of the vertex packing polytope, the theta convex body and the fractional vertex packing polytope of a graph, and establish a quantum version of the Sandwich Theorem of Gr\"{o}tschel, Lov\'{a}sz and…
We study the deformation complex of the standard morphism from the degree $d$ shifted Lie operad to its polydifferential version, and prove that it is quasi-isomorphic to the Kontsevich graph complex $\mathbf{GC}_d$. In particular, we show…