Related papers: Euler Transformation of Polyhedral Complexes
A directed graph is called Eulerian, if it contains a tour that traverses every arc in the graph exactly once. We study the problem of Eulerian extension (EE) where a directed multigraph G and a weight function is given and it is asked…
Let $D$ be a digraph. We call a subset $N$ of $V(D)$ $k$-independent if for every pair of vertices $u,v \in N$, $d(u,v) \geq k$; and we call it $\ell$-absorbent if for every vertex $u \in V(D) \setminus N$, there exists $v \in N$ such that…
We generalize Llarull's scalar curvature comparison to Riemannian manifolds admitting metric connections with parallel and alternating torsion and having a nonnegative curvature operator on 2-vectors. As a byproduct, we show that Euler…
Let $X$ be a compact connected Riemann surface of genus $g$, with $g \geq 2$. For each $d <\eta(X)$, where $\eta(X)$ is the gonality of $X$, the symmetric product $\text{Sym}^d(X)$ embeds into $\text{Pic}^d(X)$ by sending an effective…
\textsc{Edge Triangle Packing} and \textsc{Edge Triangle Covering} are dual problems extensively studied in the field of parameterized complexity. Given a graph $G$ and an integer $k$, \textsc{Edge Triangle Packing} seeks to determine…
Let $k$ be a field of characteristic $0$, and let $\alpha_{1}$, $\alpha_{2}$, and $\alpha_{3}$ be algebraically independent and transcendental over $k$. Let $K$ be the transcendental extension of $k$ obtained by adjoining the elementary…
For each positive integer $n$, let $G_n$ be the graph whose vertices are the partitions of $n$, with edges corresponding to elementary transfers of one cell between two parts, followed by reordering. Let $K_n := \mathrm{Cl}(G_n)$ be the…
In this paper we prove a formula relating the equivariant Euler characteristic of $K$-theoretic stable envelopes to an object known as the index vertex for the cotangent bundle of the full flag variety. Our formula demonstrates that the…
It is well-known that the constructions of space-filling curves depend on certain substitution rules. For a given self-similar set, finding such rules is somehow mysterious, and it is the main concern of the present paper. Our first idea is…
The Euler tour technique is a classical tool for designing parallel graph algorithms, originally proposed for the PRAM model. We ask whether it can be adapted to run efficiently on GPU. We focus on two established applications of the…
If K is an odd-dimensional flag closed manifold, flag generalized homology sphere or a more general flag weak pseudomanifold with sufficiently many vertices, then the maximal number of edges in K is achieved by the balanced join of cycles.…
A result due to Burago and Zalgaller (1960, 1995) states that every orientable polyhedral surface, one that is obtained by gluing Euclidean polygons, has an isometric piecewise linear (PL) embedding into Euclidean space $\mathbb{E}^3$. A…
We formulate an equivariant conservation of number, which proves that a generalized Euler number of a complex equivariant vector bundle can be computed as a sum of local indices of an arbitrary section. This involves an expansion of the…
In this paper we consider two topological transforms that are popular in applied topology: the Persistent Homology Transform (PHT) and the Euler Characteristic Transform (ECT). Both of these transforms are of interest for their mathematical…
The (k,d)-hypersimplex is a (d-1)-dimensional polytope whose vertices are the (0,1)-vectors that sum to k. When k=1, we get a simplex whose graph is the complete graph with d vertices. Here we show how many of the well known graph…
We present a novel method to perform numerical integration over curved polyhedra enclosed by high-order parametric surfaces. Such a polyhedron is first decomposed into a set of triangular and/or rectangular pyramids, whose certain faces…
A realization of a graph $G=(V,E)$ is a map $v\colon V\to\Bbb R^d$ that assigns to each vertex a point in $d$-dimensional Euclidean space. We study graph realizations from the perspective of representation theory (expressing certain…
We study the radial symmetry properties of stationary and uniformly rotating solutions of the 2D Euler equation in the unit disc, both in the smooth setting and the patch setting. In the patch setting, we prove that every uniformly rotating…
An Euler tour in a hypergraph is a closed walk that traverses each edge of the hypergraph exactly once, while an Euler family is a family of closed walks that jointly traverse each edge exactly once and cannot be concatenated. In this…
We construct and study a new class $\mathscr{M}=\{\mathscr{M}_n\}_{n\ge 4}$ of compact hyperbolic $3$-manifolds with totally geodesic boundary. The members of $\mathscr{M}_n$ are defined via triples of pairwise compatible Eulerian cycles in…