Related papers: Oriented Euler Complexes and Signed Perfect Matchi…
Most existing results about \emph{last-iterate convergence} of learning dynamics are limited to two-player zero-sum games, and only apply under rigid assumptions about what dynamics the players follow. In this paper we provide new results…
While discounted payoff games and classic games that reduce to them, like parity and mean-payoff games, are symmetric, their solutions are not. We have taken a fresh view on the properties that optimal solutions need to have, and devised a…
In this article we explain that several integrable mechanical billiards in the plane are connected via conformal transformations. We first remark that the free billiard in the plane are conformal equivalent to infinitely many billiard…
Genome-scale orthology assignments are usually based on reciprocal best matches. In the absence of horizontal gene transfer (HGT), every pair of orthologs forms a reciprocal best match. Incorrect orthology assignments therefore are always…
Given a point set $P$ in a metric space and a real number $t \geq 1$, an \emph{oriented $t$-spanner} is an oriented graph $\overrightarrow{G}=(P,\overrightarrow{E})$, where for every pair of distinct points $p$ and $q$ in $P$, the shortest…
Oscillator Ising machines (OIMs) are networks of coupled oscillators that seek the minimum energy state of an Ising model. Since many NP-hard problems are equivalent to the minimization of an Ising Hamiltonian, OIMs have emerged as a…
The model of spinning particle, based on the Kerr-Newman solution with |a}>>m, is discussed. It is shown that the Kerr singular ring can be considered as a string with an orientifold world-sheet. Orientifold adds to the Kerr ring an extra…
Despite the recent progress in genome sequencing and assembly, many of the currently available assembled genomes come in a draft form. Such draft genomes consist of a large number of genomic fragments (scaffolds), whose order and/or…
We describe a way of assigning labels to the vertices of any undirected graph on up to $n$ vertices, each composed of $n/2+O(1)$ bits, such that given the labels of two vertices, and no other information regarding the graph, it is possible…
We give bijections between bipolar-oriented (acyclic with unique source and sink) planar maps and certain random walks, which show that the uniformly random bipolar-oriented planar map, decorated by the "peano curve" surrounding the tree of…
A graph $G$ is said to be $1$-perfectly orientable if it has an orientation such that for every vertex $v\in V(G)$, the out-neighborhood of $v$ in $D$ is a clique in $G$. In $1982$, Skrien posed the problem of characterizing the class of…
Partial graph matching extends traditional graph matching by allowing some nodes to remain unmatched, enabling applications in more complex scenarios. However, this flexibility introduces additional complexity, as both the subset of nodes…
A wide variety of problems in computational biology, most notably the assessment of orthology, are solved with the help of reciprocal best matches. Using an evolutionary definition of best matches that captures the intuition behind the…
An ordered $r$-matching is an $r$-uniform hypergraph matching equipped with an ordering on its vertices. These objects can be viewed as natural generalisations of $r$-dimensional orders. The theory of ordered 2-matchings is well-developed…
We describe polar homology groups for complex manifolds. The polar k-chains are subvarieties of complex dimension k with meromorphic forms on them, while the boundary operator is defined by taking the polar divisor and the Poincare residue…
We study the problem of finding an acyclic orientation of an undirected graph with constrained in-degree parities specified by a subset T of vertices. An orientation is called T -odd if a vertex v has odd in-degree if and only if v P T .…
Inspired by the paper of Bonichon, Bousquet-M\'elou, Dorbec and Pennarun, we give a system of functional equations which characterise the ordinary generating function, $U(x),$ for the number of planar Eulerian orientations counted by edges.…
We provide a justification with rigorous error estimates showing that the leading term in weakly nonlinear geometric optics expansions of highly oscillatory reflecting pulses is close to the uniquely determined exact solution for small…
We give a geometric characterization of compact Riemann surfaces admitting orientation reversing involutions with fixed points. Such surfaces are generally called real surfaces and can be represented by real algebraic curves with non-empty…
We analyse the problem of assigning sign choices to O-planes in orientifolds of type II string theory. We show that there exists a sequence of invariant $p$-gerbes with $p\geq-1$, which give rise to sign choices and are related by…