Related papers: Euler Transformation of Polyhedral Complexes

Let $(X,L_{X})$ be an $n$-dimensional polarized manifold. Let $D$ be a smooth hypersurface defined by a holomorphic section of $L_{X}$. We prove that if $D$ has a constant positive scalar curvature K\"{a}hler metric, $X \setminus D$ admits…

For a graph $G$, the vertices of the $k$-dominating graph, denoted $\mathcal{D}_k(G)$, correspond to the dominating sets of $G$ with cardinality at most $k$. Two vertices of $\mathcal{D}_k(G)$ are adjacent if and only if the corresponding…

Whether the 3D incompressible Euler equations can develop a singularity in finite time from smooth initial data is one of the most challenging problems in mathematical fluid dynamics. This work attempts to provide an affirmative answer to…

We study the minimal homogeneous generating sets of the Eulerian ideal associated with a simple graph and its maximal generating degree. We show that the Eulerian ideal is a lattice ideal and use this to give a characterization of binomials…

For any fixed positive integer $r$ and a given budget $k$, the $r$-\textsc{Eigenvalue Vertex Deletion} ($r$-EVD) problem asks if a graph $G$ admits a subset $S$ of at most $k$ vertices such that the adjacency matrix of $G\setminus S$ has at…

In this paper, we study the $d$-dimensional rectilinear drawings of the complete $d$-uniform hypergraph $K_{2d}^d$. Anshu et al. [Computational Geometry: Theory and Applications, 2017] used Gale transform and Ham-Sandwich theorem to prove…

Given a graph $G$ and an integer $k$, the $H$-free Edge Editing problem is to find whether there exists at most $k$ pairs of vertices in $G$ such that changing the adjacency of the pairs in $G$ results in a graph without any induced copy of…

In the Trivially Perfect Editing problem one is given an undirected graph $G = (V,E)$ and an integer $k$ and seeks to add or delete at most $k$ edges in $G$ to obtain a trivially perfect graph. In a recent work, Dumas, Perez and Todinca…

We give a simple polynomial-time algorithm to exactly count the number of Euler Tours (ETs) of any Eulerian generalized series-parallel graph, and show how to adapt this algorithm to exactly sample a random ET of the given generalized…

Euler graphs are characterized by the simple criterion that degree of each node is even. By restricting on the cycle types yet additional intrinsic properties of Euler graphs are unveiled. For example, regularity higher than degree two is…

Given two $k$-dicolourings of a digraph $D$, we prove that it is PSPACE-complete to decide whether we can transform one into the other by recolouring one vertex at each step while maintaining a dicolouring at any step even for $k=2$ and for…

We report the theoretical prediction and experimental observation of a new class of four-dimensional (4D) tensor singularities and their three-dimensional (3D) Euler-class descendants, protected by chiral and spacetime inversion symmetries…

For a finite group $G$ with a normal subgroup $H$, the enhanced quotient graph of $G/H$, denoted by $\mathcal{G}_{H}(G),$ is the graph with vertex set $V=(G\backslash H)\cup \{e\}$ and two vertices $x$ and $y$ are edge connected if $xH =…

We carry out a systematic investigation of all the 2-loop integrals occurring in the electron vertex in QED in the continuous $D$-dimensional regularization scheme, for on-shell electrons, momentum transfer $t=-Q^2$ and finite squared…

In this paper we use the results of our previous work in order to compute the phase of the torsion of an Euler structure in terms of its characteristic class. Also, we introduce here a new notion of an absolute torsion, which does not…

In 1975, Erd\H{o}s asked for the maximum number of edges that an $n$-vertex graph can have if it does not contain two edge-disjoint cycles on the same vertex set. It is known that Tur\'an-type results can be used to prove an upper bound of…

There is a mysterious connection between the multiple polylogarithms at N-th roots of unity and modular varieties. In this paper we "explain" it in the simplest case of the double logarithm. We introduce an Euler complex data on modular…

The current article continues our project on representation theory, Euler elements, causal homogeneous spaces and Algebraic Quantum Field Theory (AQFT). We call a pair (h,k) of Euler elements orthogonal if $e^{\pi i \ad h} k = -k$. We show…

This paper builds one-cusped complex hyperbolic $2$-manifolds by an explicit geometric construction. Specifically, for each odd $d \ge 1$ there is a smooth projective surface $Z_d$ with $c_1^2(Z_d) = c_2(Z_d) = 6d$ and a smooth irreducible…

Let G be a countable discrete group and let M be a smooth proper cocompact G-manifold without boundary. The Euler operator defines via Kasparov theory an element, called the equivariant Euler class, in the equivariant K-homology of M. The…