Related papers: An Elementary Integrality Proof of Rothblum's Stab…
We prove uniqueness of self-similar profiles for the one-dimensional inelastic Boltzmann equation with moderately hard potentials, that is with collision kernel of the form | $\bullet$ | $\gamma$ for $\gamma$ > 0 small enough (explicitly…
Jamming is an emergent phenomenon wherein the local stability of individual particles percolates to form a globally rigid structure. However, the onset of rigidity does not imply that every particle becomes rigid, and indeed some remain…
The conjecture of Bollob\'as and Koml\'os, recently proved by B\"ottcher, Schacht, and Taraz [Math. Ann. 343(1), 175--205, 2009], implies that for any $\gamma>0$, every balanced bipartite graph on $2n$ vertices with bounded degree and…
I relate bipartite graph matchings to stable matchings. I prove a necessary and sufficient condition for the existence of a saturating stable matching, where every agent on one side is matched, for all possible preferences. I extend my…
Ioffe's criterion and various reformulations of it have become a~standard tool in proving theorems guaranteeing metric regularity of a (set-valued) mapping. First, we demonstrate that one should always use directly the so-called general…
For zero-dimensional complete intersections with homogeneous ideal generators of equal degrees over an algebraically closed field of characteristic zero, we give a combinatorial proof of the smoothness of the corresponding catalecticant…
In this paper, we develop new theory connected with resonant vector bundles that will allow for the use of validated numerics to rigorously determine the stability of pulse solutions in the context of the Swift-Hohenberg equation. For many…
This paper gives two different proofs to a structural theorem of decreasing minimization (lexicographic optimization) on integrally convex sets. The theorem states that the set of decreasingly minimal elements of an integrally convex set…
In this paper, we will prove a very general result of stability for perturbations of linear integrable Hamiltonian systems, and we will construct an example of instability showing that both our result and our example are optimal. Moreover,…
We give a combinatorial characterization of generic minimal rigidity for planar periodic frameworks. The characterization is a true analogue of the Maxwell-Laman Theorem from rigidity theory: it is stated in terms of a finite combinatorial…
We consider periodic solutions to equations of Korteweg-Devries type. While the stability theory for periodic waves has received much some attention the theory is much less developed than the analogous theory for solitary wave stability,…
This survey paper deals with upper and lower bounds on the number of $k$-matchings in regular graphs on $N$ vertices. For the upper bounds we recall the upper matching conjecture which is known to hold for perfect matchings. For the lower…
It is shown by Makai, Martini, and \'Odor that a convex body $K\subset\mathbb{R}^n$, all of whose maximal sections pass through the origin, must be origin-symmetric. We prove a stability version of this result. We also discuss a theorem of…
We introduce persistence matching diagrams induced by set mappings of metric spaces, based on 0-persistent homology of Vietoris-Rips filtrations. Also, we present a geometric definition of the persistence matching diagram that is more…
Intuitively speaking, a bipartite graph is mirror if it can be drawn in the Cartesian plane in such a way that, the vertices of one stable are points in x=0, the vertices of the other stable set are points in x=1, the edges are straight…
It follows from known results that every regular tripartite hypergraph of positive degree, with $n$ vertices in each class, has matching number at least $n/2$. This bound is best possible, and the extremal configuration is unique. Here we…
We study online robust matrix completion on graphs. At each iteration a vector with some entries missing is revealed and our goal is to reconstruct it by identifying the underlying low-dimensional subspace from which the vectors are drawn.…
In many matching markets--such as athlete recruitment or academic admissions--participants on one side are evaluated by attribute vectors known to the other side, which in turn applies individual \emph{salience vectors} to assign relative…
Computing the permanent of a $(0,1)$-matrix is a well-known $\#P$-complete problem. In this paper, we present an expression for the permanent of a bipartite graph in terms of the determinant of the graph and its subgraphs, obtained by…
An instance of a strongly stable matching problem (SSMP) is an undirected bipartite graph $G=(A \cup B, E)$, with an adjacency list of each vertex being a linearly ordered list of ties, which are subsets of vertices equally good for a given…