Related papers: Euler Transformation of Polyhedral Complexes

In this paper, we study desingularization of vortices for the two-dimensional incompressible Euler equations in the full plane. We construct a family of steady vortex pairs for the Euler equations with a general vorticity function, which…

Given a set D of nonnegative integers, we derive the asymptotic number of graphs with a givenvnumber of vertices, edges, and such that the degree of every vertex is in D. This generalizes existing results, such as the enumeration of graphs…

In the \textsc{Maximum Degree Contraction} problem, input is a graph $G$ on $n$ vertices, and integers $k, d$, and the objective is to check whether $G$ can be transformed into a graph of maximum degree at most $d$, using at most $k$ edge…

Untangling is a process in which some vertices of a planar graph are moved to obtain a straight-line plane drawing. The aim is to move as few vertices as possible. We present an algorithm that untangles the cycle graph C_n while keeping at…

We present a numerical method of analyzing possibly singular incompressible 3D Euler flows using massively parallel high-resolution adaptively refined numerical simulations up to 8192^3 mesh points. Geometrical properties of Lagrangian…

An irreversible $k$-threshold process (also a $k$-neighbor bootstrap percolation) is a dynamic process on a graph where vertices change color from white to black if they have at least $k$ black neighbors. An irreversible $k$-conversion set…

In this paper, we perform a careful numerical study of nearly singular solutions of the 3D incompressible Euler equations with smooth initial data. We consider the interaction of two perturbed antiparallel vortex tubes which was previously…

Let (X,\Omega) be a closed polarized complex manifold, g be an extremal metric on X that represents the K\"ahler class \Omega, and G be a compact connected subgroup of the isometry group Isom(X,g). Assume that the Futaki invariant relative…

Some graphs admit drawings in the Euclidean k-space in such a (natu- ral) way, that edges are represented as line segments of unit length. Such drawings will be called k dimensional unit distance representations. When two non-adjacent…

We study the enumeration of graph orientations under local degree constraints. Given a finite graph $G = (V, E)$ and a family of admissible sets $\{\mathsf P_v \subseteq \mathbb{Z} : v \in V\}$, let $\mathcal N (G; \prod_{v \in V} \mathsf…

Let $k \geq 3$ be an integer, $h_{k}(G)$ be the number of vertices of degree at least $2k$ in a graph $G$, and $\ell_{k}(G)$ be the number of vertices of degree at most $2k-2$ in $G$. Dirac and Erd\H{o}s proved in 1963 that if $h_{k}(G) -…

We analyze quantum-geometric bounds on optical weights in topological phases with pairs of bands hosting nontrivial Euler class, a multigap invariant characterizing non-Abelian band topology. We show how the bounds constrain the combined…

In this work we found the new class of exact stationary solutions for 2D-Euler equations. Unlike of already known solutions, the new one contain complex singularities. We consider as complex, point singularities which have the vector field…

The Euler characteristic (EC) is a powerful topological descriptor that can be used to quantify the shape of data objects that are represented as fields/manifolds. Fast methods for computing the EC are required to enable processing of…

We say that a pure $d$-dimensional simplicial complex $\Delta$ on $n$ vertices is \emph{shelling completable} if $\Delta$ can be realized as the initial sequence of some shelling of $\Delta_{n-1}^{(d)}$, the $d$-skeleton of the…

Skeletal polyhedra and polygonal complexes in ordinary Euclidean 3-space are finite or infinite 3-periodic structures with interesting geometric, combinatorial, and algebraic properties. They can be viewed as finite or infinite 3-periodic…

An almost complex torus manifold is a $2n$-dimensional compact connected almost complex manifold equipped with an effective action of a real $n$-dimensional torus $T^n \simeq (S^1)^n$ that has fixed points. For an almost complex torus…

We show that for any $d\ge 2$ and $\Delta>0$ there exists $\eta>0$ such that the following holds: Let $G$ be an $n$-vertex graph with at least $\Omega(n^2)$ edges and let $H$ be an $n$-vertex $d$-degenerate graph with maximum degree at most…

We study the parameterized complexity of transforming graphs into Uniform Cluster graphs, where each component is an equal-sized clique. We consider Uniform Cluster Vertex Deletion (UCVD), Uniform Cluster Edge Deletion (UCED), Uniform…

As a well-known fact, the classical Euler scheme works merely for SDEs with coefficients of linear growth. In this paper, we study a general framework of modified Euler schemes, which is applicable to SDEs with super-linear drifts and…