Related papers: The Directed Uniform Hamilton-Waterloo Problem Inv…

We establish the factorization of Dirac operators on Riemannian submersions of compact spin$^c$ manifolds in unbounded KK-theory. More precisely, we show that the Dirac operator on the total space of such a submersion is unitarily…

We analyze a non-standard isoperimetric problem in the plane associated with a metric having degenerate conformal factor at two points. Under certain assumptions on the conformal factor, we establish the existence of curves of least length…

The Darbroux transformation is generalized for time-dependent Hamiltonian systems which include a term linear in momentum and a time-dependent mass. The formalism for the $N$-fold application of the transformation is also established, and…

A unitary perfect number is a positive integer n satisfying \sigma^*(n)=2n, where \sigma^* sums unitary divisors. Only five examples are known, and no sixth has been found. We revisit the Subbarao-Warren problem by keeping the seed factor…

An oriented graph is a directed graph without directed 2-cycles. Poljak and Turz\'{i}k (1986) proved that every connected oriented graph $G$ on $n$ vertices and $m$ arcs contains an acyclic subgraph with at least $\frac{m}{2}+\frac{n-1}{4}$…

Although inverse limits with factor spaces indexed by the positive integers are most commonly studied, Ingram and Mahavier have defined inverse limits with set-valued functions broadly enough for any directed index set to be used. In this…

We consider the problem of when one quandle homomorphism will factor through another, restricting our attention to the case where all quandles involved are connected. We provide a complete solution to the problem for surjective quandle…

This paper presents a novel factor graph-based approach to solve the discrete-time finite-horizon Linear Quadratic Regulator problem subject to auxiliary linear equality constraints within and across time steps. We represent such optimal…

Building on the recent derivation of a bare factorization theorem for the $b$-quark induced contribution to the $h\to\gamma\gamma$ decay amplitude based on soft-collinear effective theory, we derive the first renormalized factorization…

Using periodic-orbit theory beyond the diagonal approximation we investigate the form factor, $K(\tau)$, of a generic quantum graph with mixing classical dynamics and time-reversal symmetry. We calculate the contribution from pairs of…

We use refined spectral sequence arguments to calculate known and previously unknown bi-Hamiltonian cohomology groups, which govern the deformation theory of semi-simple bi-Hamiltonian pencils of hydrodynamic type with one independent and…

We conjecture that every oriented graph $G$ on $n$ vertices with $\delta ^+ (G) , \delta ^- (G) \geq 5n/12$ contains the square of a Hamilton cycle. We also give a conjectural bound on the minimum semidegree which ensures a perfect packing…

Let $G$ be a graph on $n\geq 3$ vertices, claw the bipartite graph $K_{1,3}$, and $Z_i$ the graph obtained from a triangle by attaching a path of length $i$ to its one vertex. $G$ is called 1-heavy if at least one end vertex of each induced…

In 1960, Ghouila-Houri proved that every strongly connected directed graph $G$ on $n$ vertices with minimum degree at least $n$ contains a directed Hamilton cycle. We asymptotically generalize this result by proving the following: every…

Given any digraph $D$ on $n$ vertices, let $\mathcal{P}(D)$ be the family of all directed paths in $D$, and let $H$ be a digraph with the arc set $A(H)=\{a_1, \ldots, a_k\}$. The digraph $D$ is called arbitrary Hamiltonian $H$-linked if for…

Let D(n,p) be the random directed graph on n vertices where each of the n(n-1) possible arcs is present independently with probability p. A celebrated result of Frieze shows that if $p\ge(\log n+\omega(1))/n$ then D(n,p) typically has a…

Continuous unitary transformations can be used to diagonalize or approximately diagonalize a given Hamiltonian. In the last four years, this method has been applied to a variety of models of condensed matter physics and field theory. With a…

Factorization theorems allow to separate out the universal, non-perturbative content of the hadronic cross section from its perturbative part, which can be computed in perturbative QCD, up to the desired order. In this paper, we derive a…

We show that every edge in a 2-edge-connected planar cubic graph is either contained in a 2-edge-cut or is a chord of some cycle that is contained in a 2-factor of the graph. As a consequence, we show that every edge in a cyclically…

Let $G$ be a graph obtained as the union of some $n$-vertex graph $H_n$ with minimum degree $\delta(H_n)\geq\alpha n$ and a $d$-dimensional random geometric graph $G^d(n,r)$. We investigate under which conditions for $r$ the graph $G$ will…