Related papers: Oriented Euler Complexes and Signed Perfect Matchi…
We completely determine, up to homeomorphism, which simply connected compact oriented 4-manifolds admit scalar-flat, anti-self-dual Riemannian metrics. The key new ingredient is a proof that the connected sum of five reverse-oriented…
We present a review of methods for optimal experimental design (OED) for Bayesian inverse problems governed by partial differential equations with infinite-dimensional parameters. The focus is on problems where one seeks to optimize the…
The orthogonal matching pursuit (OMP) is an algorithm to solve sparse approximation problems. Sufficient conditions for exact recovery are known with and without noise. In this paper we investigate the applicability of the OMP for the…
We develop a new approach for approximating large independent sets when the input graph is a one-sided spectral expander - that is, the uniform random walk matrix of the graph has its second eigenvalue bounded away from 1. Consequently, we…
The absolute order is a natural partial order on a Coxeter group W. It can be viewed as an analogue of the weak order on W in which the role of the generating set of simple reflections in W is played by the set of all reflections in W. By…
The orientals or oriented simplexes are a family of strict omega-categories constructed by Ross Street. We show that the category of orientals is isomorphic to a subcategory of the category of chain complexes. This leads to a very simple…
In this paper we prove symmetry of compactly supported steady solutions of the 2D Euler equations. Assuming that $\Omega = \{x \in \mathbb{R}^2:\ u(x) \neq 0\}$ is an annular domain, we prove that the streamlines of the flow are circular.…
In 2009, Kong, Wang, and Lee began work on the problem of finding the edge-balanced index sets (EBI) of complete bipartite graphs K_{m,n} by solving the cases where n = 1, 2, 3, 4, and 5, and also the case where m = n. In 2011, Krop and…
In a basic framework of a complex Hilbert space equipped with a complex conjugation and an involution, linear operators can be real, quaternionic, symmetric or anti-symmetric, and orthogonal projections can furthermore be symplectic. This…
We present a combinatorial approach to rigorously show the existence of fixed points, periodic orbits, and symbolic dynamics in discrete-time dynamical systems, as well as to find numerical approximations of such objects. Our approach…
An embedding of a graph on an orientable surface is orientably-regular (or rotary, in an equivalent terminology) if the group of orientation-preserving automorphisms of the embedding is transitive (and hence regular) on incident vertex-edge…
We define oriented posets with correpsonding rank matrices, where linking two posets by an edge corresponds to matrix multiplication. In particular, linking chains via this method gives us fence posets, and taking traces gives us circular…
Given an undirected graph G, the edge orientation problem asks for assigning a direction to each edge to convert G into a directed graph. The aim is to minimize the maximum out degree of a vertex in the resulting directed graph. This…
Consider a problem where we are given a bipartite graph H with vertices arranged on two horizontal lines in the plane, such that the two sets of vertices placed on the two lines form a bipartition of H. We additionally require that H admits…
We prove homological stability for sequences of "oriented configuration spaces" as the number of points in the configuration goes to infinity. These are spaces of configurations of n points in a connected manifold M of dimension at least 2…
We give an elementary proof of the fact that a pure-dimensional closed subvariety of a complex abelian variety has a signed intersection homology Euler characteristic. We also show that such subvarieties which, moreover, are local complete…
Mathematical billiards is much like the real game: a point mass, representing the ball, rolls in a straight line on a (perfectly friction-less) table, striking the sides according to the law of reflection. A billiard trajectory is then…
We present an algorithm for solving inverse problems on graphs analogous to those arising in diffuse optical tomography for continuous media. In particular, we formulate and analyze a discrete version of the inverse Born series, proving…
We discuss a graph complex formed by directed acyclic graphs with external legs. This complex comes in particular with a map to the ribbon graph complex computing the (compactly supported) cohomology of the moduli space of points $\mathcal…
A matching is a set of edges in a graph with no common endpoint. A matching M is called acyclic if the induced subgraph on the endpoints of the edges in M is acyclic. Given a graph G and an integer k, Acyclic Matching Problem seeks for an…