Related papers: An Elementary Integrality Proof of Rothblum's Stab…
This paper clarifies the main research methods and ideas of the thesis [1,2,4]. The special calculation process is also realized by corresponding computer algorithm. Finally, we introduce zero rows sum case and give the corresponding…
We introduce the matching measure of a finite graph as the uniform distribution on the roots of the matching polynomial of the graph. We analyze the asymptotic behavior of the matching measure for graph sequences with bounded degree. A…
Using Je\v{r}\'abek 's framework for probabilistic reasoning, we formalize the correctness of two fundamental RNC^2 algorithms for bipartite perfect matching within the theory VPV for polytime reasoning. The first algorithm is for testing…
Let $G$ be a connected $d$-regular graph of order $n$, where $d\geq3$. Let $\lambda_{2}(G)$ be the second largest eigenvalue of $G$. For even $n$, we show that $G$ contains $\left\lfloor\frac{2}{3}(d-\lambda_{2}(G))\right\rfloor$…
Following Smale, we study simple symmetric mechanical systems of $n$ point particles in the plane. In particular, we address the question of the linear and spectral stability properties of relative equilibria, which are special solutions of…
In the context of integrable systems on quad-graphs, the boundary consistency around a half of a rhombic dodecahedron, as a companion notion to the three-dimensional consistency around a cube, was introduced as a criterion for defining…
We study the problem of finding solutions to the stable matching problem that are robust to errors in the input and we obtain a polynomial time algorithm for a special class of errors. In the process, we also initiate work on a new…
By definition, transverse intersections are stable under infinitesimal perturbations. Using persistent homology, we extend this notion to a measure. Given a space of perturbations, we assign to each homology class of the intersection its…
We show cocycle stability for linear maps with a weak irreducibility condition and their jointly integrable perturbations.
We prove a sufficient condition for the existence of explicit first integrals for vector fields which admit an integrating factor. This theorem recovers and extends previous results in the literature on the integrability of vector fields…
A pair of graphs $(\Gamma,\Sigma)$ is called unstable if their direct product $\Gamma\times\Sigma$ admits automorphisms not from $\mathrm{Aut}(\Gamma)\times\mathrm{Aut}(\Sigma)$, and such automorphisms are said to be unexpected. The…
For strictly entropic Riemann shock solutions of strictly hyperbolic systems of balance laws, we prove that exponential spectral stability implies large-time asymptotic orbital stability. As a preparation, we also prove similar results for…
An important family of structural constants in the theory of symmetric functions and in the representation theory of symmetric groups and general linear groups are the plethysm coefficients. In 1950, Foulkes observed that they have some…
The main purpose of this paper is to prove the smooth local orbital linearization theorem for smooth vector fields which admit a complete set of first integrals near a nondegenerate singular point. The main tools used in the proof of this…
We identify a family of $O(|E(G)|^2)$ nontrivial facets of the connected matching polytope of a graph $G$, that is, the convex hull of incidence vectors of matchings in $G$ whose covered vertices induce a connected subgraph. Accompanying…
A stable approach for integrating the impedance matrix in cylindrical, radial inhomogeneous structures is developed and studied. A Stroh-like system using the time-harmonic displacement-traction state vector is used to derive the Riccati…
We give a method for verifying, by a symbolic calculation, the stability or semistability with respect to a linearization of fixed, possibly small, degree $m$, of the Hilbert point of a scheme $X \in {\mathbb P}(V)$ having a suitably large…
We study the complexity of proving that a sparse random regular graph on an odd number of vertices does not have a perfect matching, and related problems involving each vertex being matched some pre-specified number of times. We show that…
We give an exponential lower bound for the Graver complexity of the incidence matrix of a complete bipartite graph of arbitrary size. Our result is a generalization of the result by Berstein and Onn (2009) for 3xr complete bipartite graphs,…
We study steady solutions to the relativistic Boltzmann equation with hard-sphere interactions in a slab geometry. Under a spatial symmetry assumption in the transverse variables $x_2$ and $x_3$, the problem reduces to a one-dimensional…