Related papers: A copositive formulation for the stability number …
A convex geometry is finite zero-closed closure system that satisfies the anti-exchange property. Complexity results are given for two open problems related to representations of convex geometries using implication bases. In particular, the…
In this paper, we give the sharp upper bound for the number of vertices with positive curvature in a planar graph with nonnegative combinatorial curvature. Based on this, we show that the automorphism group of a planar---possibly…
In this paper, we aim to design sparse D-optimal (determinantoptimal) pose-graph SLAM problems through the synthesis of sparse graphs with the maximum weighted number of spanning trees. Characterizing graphs with the maximum number of…
We present online deterministic algorithms for minimum coloring and minimum dominating set problems in the context of geometric intersection graphs. We consider a graph parameter: the independent kissing number $\zeta$, which is a number…
This paper addresses the problem of stabilization for infinite-dimensional systems. In particular, we design nonlinear stabilizers for both linear and nonlinear abstract systems. We focus on two classes of systems: the first class comprises…
We introduce a computational method to optimize target physical properties in the full configuration space regarding atomic composition, chemical stoichiometry, and crystal structure. The approach combines the universal potential of the…
The all-terminal reliability of a graph $G$ is the probability that $G$ remains connected when each edge fails independently with probability $p$. For fixed $n$ and $m$, the uniformly most reliable problem asks which graph with $n$ vertices…
Let red and blue points be distributed on $\mathbb{R}$ according to two independent Poisson processes $\mathcal{R}$ and $\mathcal{B}$ and let each red (blue) point independently be equipped with a random number of half-edges according to a…
We show that the number of entire maximal graphs with finitely many singular points that are conformally equivalent is a universal constant that depends only on the number of singularities, namely 2^$ for graphs with n+1 singularities. We…
We prove that every stability two unit disk graph has chromatic number at most 3/2 times its clique number.
A pair of graphs $(\Gamma,\Sigma)$ is said to be stable if the full automorphism group of $\Gamma\times\Sigma$ is isomorphic to the product of the full automorphism groups of $\Gamma$ and $\Sigma$ and unstable otherwise, where…
Combinatorial optimization problems are pervasive across science and industry. Modern deep learning tools are poised to solve these problems at unprecedented scales, but a unifying framework that incorporates insights from statistical…
The paper is devoted to the study of a stabilization problem for the 2D incompressible Euler system in an infinite strip with boundary controls. We show that for any stationary solution (c, 0) of the Euler system there is a control which is…
It is known that a graph isomorphism testing algorithm is polynomially equivalent to a detecting of a graph non-trivial automorphism algorithm. The polynomiality of the latter algorithm, is obtained by consideration of symmetry properties…
While stabilizer tableaus have proven exceptionally useful as a descriptive tool for additive quantum codes, they offer little guidance for concrete constructions or coding algorithm analysis. We introduce a representation of stabilizer…
We provide a way of determining the infinitesimal rigidity of rod configurations realizing a rank two incidence geometry in the Euclidean plane. We model each rod with a cone over its point set and prove that the resulting geometric…
We consider the problem of positive-semidefinite continuation: extending a partially specified covariance kernel from a subdomain $\Omega$ of a rectangular domain $I\times I$ to a covariance kernel on the entire domain $I\times I$. For a…
We present a method which provides a unified framework for most stability theorems that have been proved in graph and hypergraph theory. Our main result reduces stability for a large class of hypergraph problems to the simpler question of…
We consider popular matching problems in both bipartite and non-bipartite graphs with strict preference lists. It is known that every stable matching is a min-size popular matching. A subclass of max-size popular matchings called dominant…
We study the behavior of solutions of mutually coupled equations in heterogeneous random graphs. Heterogeneity means that some equations receive many inputs whereas most of the equations are given only with a few connections. Starting from…