Related papers: Euler Transformation of Polyhedral Complexes

In this paper, we study a natural discretization of the smooth Gaussian curvature on surfaces, which is defined as the quotient of the angle defect and the area of a geodesic disk at a vertex of a polyhedral surface. It is proved that each…

Given a graph $G$ with only even degrees let $\varepsilon(G)$ denote the number of Eulerian orientations, and let $h(G)$ denote the number of half graphs, that is, subgraphs $F$ such that $d_F(v)=d_G(v)/2$ for each vertex $v$. Recently,…

Given a simple graph $G$, its line graph, denoted by $L(G)$, is obtained by representing each edge of $G$ as a vertex, with two vertices in $L(G)$ adjacent whenever the corresponding edges in $G$ share a common endpoint. By applying the…

Euler angles determining rotations of a system as a whole are conveniently separated in three-particle basis functions. Analytic integration of matrix elements over Euler angles is done in a general form. Results for the Euler angle…

We prove that for every surface $\Sigma$, the class of Eulerian directed graphs that are Eulerian embeddable into $\Sigma$ (in particular they have degree at most $4$) is well-quasi-ordered by strong immersion. This result marks one of the…

We prove that for all $d \geq 1$ a shellable $d$-dimensional simplicial complex with at most $d+3$ vertices is extendably shellable. The proof involves considering the structure of `exposed' edges in chordal graphs as well as a connection…

We compute the weighted Euler characteristic, equivariant with respect to the action of the symplectic group of degree six over the field of two elements, of the moduli space of principally polarized abelian threefolds together with a level…

Let $(X,g)$ be a compact $n$-dimensional smooth Riemannian manifold with a lower bound on the average of the lowest $n-p$ eigenvalues of the curvature operator and the diameter of $X$ is bounded above by $D>0$. In this article, we…

The problem of modifying a given graph to satisfy certain properties has been one of the central topics in parameterized tractability study. In this paper, we study the cycle contraction problem, which makes a graph into a cycle by edge…

In this paper, we show that every $(3k-3)$-edge-connected graph $G$, under a certain condition on whose degrees, can be edge-decomposed into $k$ factors $G_1,\ldots, G_k$ such that for each vertex $v\in V(G_i)$, $|d_{G_i}(v)-d_G(v)/k|< 1$,…

Differential equations are derived which show how generalized Euler vector representations of the Euler rotation axis and angle for a rigid body evolve in time; the Euler vector is also known as a rotation vector or axis-angle vector. The…

The purpose of this paper is to construct a crepant resolution of quotient singularities by trihedral groups ( finite subgroups of SL(3,C) of certain type ), and prove that each Euler number of the minimal model is equal to the number of…

Let ${\cal L}$ be an arrangement of $n$ lines in the Euclidean plane. The \emph{$k$-level} of ${\cal L}$ consists of all vertices $v$ of the arrangement which have exactly $k$ lines of ${\cal L}$ passing below $v$. The complexity (the…

A plane topological graph $G=(V,E)$ is a graph drawn in the plane whose vertices are points in the plane and whose edges are simple curves that do not intersect, except at their endpoints. Given a plane topological graph $G=(V,E)$ and a set…

Alternating Euler trails has been extensively studied for its diverse applications, for example, in genetic and molecular biology, social science and channel assignment in wireless networks, as well as for theoretical reasons. We will…

The Eulerian extension number of any graph~\(H\) (i.e. the minimum number of edges needed to be added to make~\(H\) Eulerian) is at least~\(t(H),\) half the number of odd degree vertices of~\(H.\) In this paper we consider an inhomogenous…

We consider the Trivially Perfect Editing problem, where one is given an undirected graph $G = (V,E)$ and a parameter $k \in \mathbb{N}$ and seeks to edit (add or delete) at most $k$ edges from $G$ to obtain a trivially perfect graph. The…

In this paper we study Eulerian extensions with edge constraints and use the probabilistic method to establish sufficient conditions for a given connected graph to be a subgraph of a Eulerian graph containing $m$ edges, for a given number…

Vertical decomposition is a widely used general technique for decomposing the cells of arrangements of semi-algebraic sets in $d$-space into constant-complexity subcells. In this paper, we settle in the affirmative a few long-standing open…

We show that $k$-uniform hypergraphs on $n$ vertices whose codegree is at least $(2/3 + o(1))n$ can be decomposed into tight cycles, subject to the trivial divisibility conditions. As a corollary, we show those graphs contain tight Euler…