Related papers: Loop conditions
We consider several integrable systems from a standpoint of the SL(2,R) invariant gauge theory. In the Drinfeld-Sokorov gauge, we get a one parameter family of nonlinear equations from zero curvature conditions. For each value of the…
Let $G$ be a graph on $n$ vertices. A vertex of $G$ with degree at least $n/2$ is called a heavy vertex, and a cycle of $G$ which contains all the heavy vertices of $G$ is called a heavy cycle. In this paper, we characterize the graphs…
We show that every nontrivial finite or infinite connected directed graph with loops and at least one vertex without a loop is uniquely representable as a Cartesian or weak Cartesian product of prime graphs. For finite graphs the…
We introduce the notion of a logarithmic stable map from a minimal log prestable curve to a log twisted semi-stable variety of form $xy=0$. We study the compactification of the moduli spaces of such maps and provide a perfect obstruction…
Vassiliev invariants can be studied by studying the spaces of chord diagrams associated with singular knots. To these chord diagrams are associated the intersection graphs of the chords. We extend results of Chmutov, Duzhin and Lando to…
Muchnik's theorem about simple conditional descriptions states that for all strings $a$ and $b$ there exists a short program $p$ transforming $a$ to $b$ that has the least possible length and is simple conditional on $b$. In this paper we…
Let $G$ be a graph with $n$ vertices and $\lambda_n(G)$ be the least eigenvalue of its adjacency matrix of $G$. In this paper, we give sharp bounds on the least eigenvalue of graphs without given pathes or cycles and determine the extremal…
We characterize weakly harmonic maps with respect to non-local Dirichlet forms by Markov processes and martingales. In particular, we can obtain discontinuous martingales on Riemannian manifolds from the image of symmetric stable processes…
We derive sufficient conditions for a probability measure on a finite product space (a spin system) to satisfy a (modified) logarithmic Sobolev inequality. We establish these conditions for various examples, such as the (vertex-weighted)…
A linearly constrained framework in $\mathbb{R}^d$ is a bar-joint framework where, in addition, vertices with loops are constrained to lie in given affine subspaces. In the generic case, when each vertex is incident to sufficiently many…
Supersingular isogeny graphs are known to have very few loops and multi-edges. We formalize this idea by studying and finding bounds for the number of loops and multi-edges in such graphs. We also find conditions under which the…
A graph is called $t$-tough if the removal of any vertex set $S$ that disconnects the graph leaves at most $|S|/t$ components. The toughness of a graph is the largest $t$ for which the graph is $t$-tough. A graph is minimally $t$-tough if…
We define a path integral over Dirac operators that averages over noncommutative geometries on a fixed graph, as the title reveals, using quiver representations. We prove algebraic relations that are satisfied by the expectation value of…
A graph $G$ is called collapsible if for every even subset $R\subseteq V(G)$, there is a spanning connected subgraph $H$ of $G$ such that $R$ is the set of vertices of odd degree in $H$. A graph is the reduction of $G$ if it is obtained…
In this paper we investigate some Mal'cev classes of varieties of left-quasigroups. We prove that the weakest Mal'cev condition for a variety of left-quasigroup is having a Mal'cev term. Then we specialize to the setting of quandles for…
Meet semidistributive varieties are in a sense the last of the most important classes in universal algebra for which it is unknown whether it can be characterized by a strong Maltsev condition. We present a new, relatively simple Maltsev…
We show that, when restricted to the class of varieties that have a Taylor term, several commutator properties are definable by Maltsev conditions.
In this paper, we give a definition of weak stability condition on a triangulated category. The difference between our definition and existing definitions is that we allow objects in the kernel to have non-maximal phases. We then construct…
The toughness of a graph $G$ is defined as the largest real number $t$ such that for any set $S\subseteq V(G)$ such that $G-S$ is disconnected, $S$ has at least $t$ times more elements than $G-S$ has components (unless $G$ is complete, in…
We characterize the graphs with loops whose degree sequences have no repeated values and find their adjacency spectrum. In the case of simple graphs, such graphs are called anti-regular graphs and are examples of threshold graphs. The…