Related papers: On LP-orientations of cubes and crosspolytopes
We find necessary and sufficient conditions for an operator of the fourth order on a graph with loops to admit the (L,A,B)-triple Krichever-Novikov deformation of one energy level.
In this paper we formulate the problem of elastodynamic transformation cloaking for Kirchhoff-Love plates and elastic plates with both the in-plane and out-of-plane displacements. A cloaking transformation maps the boundary-value problem of…
We derive necessary and sufficient conditions for order-2 $CP$ ($CP2$) symmetry in $N$-Higgs-doublet potentials for $N>2$. The conditions, which are formulated as relations between vectors that transform under the adjoint representation of…
For a curve C and a reductive group G in prime characteristic, we relate the de Rham moduli of logarithmic G-connections on C to the Dolbeault moduli of logarithmic G-Higgs bundles on the Frobenius twist of C. We name this result the…
We give a partial description of the (s,t)-p-path polytope of a directed graph D which is the convex hull of the incidence vectors of simple directed (s,t)-paths in D of length p. First, we point out how the (s,t)-p-path polytope is located…
We study the polyhedral properties of three problems of constructing an optimal complete bipartite subgraph (a biclique) in a bipartite graph. In the first problem we consider a balanced biclique with the same number of vertices in both…
The contraction map proof method is the commonly used method to prove holographic entropy inequalities. Existence of a contraction map corresponding to a holographic entropy inequality is a sufficient condition for its validity. But is it…
We show that every non-degenerate regular polytope can be used to construct a thin, residually-connected, chamber-transitive incidence geometry, i.e. a regular hypertope, with a tail-triangle Coxeter diagram. We discuss several interesting…
Two sets of conditions are presented for the compactness of a real plane algebraic curve, one sufficient and one necessary, in terms of the Newton polygon of the defining polynomial.
Let N be a topologically finite, orientable 3-manifold with ideal triangulation. We show that if there is a solution to the hyperbolic gluing equations, then all edges in the triangulation are essential. This result is extended to a…
In this paper, we study arrangements of orthogonal circles, that is, arrangements of circles where every pair of circles must either be disjoint or intersect at a right angle. Using geometric arguments, we show that such arrangements have…
We consider the problem of characterizing the convex hull of the graph of a bilinear function $f$ on the $n$-dimensional unit cube $[0,1]^n$. Extended formulations for this convex hull are obtained by taking subsets of the facets of the…
We prove several new sufficient conditions for hamiltonicity and bipancyclicity in balanced bipartite digraphs, in terms of sums of degrees over dominating or dominated pairs of vertices.
We study the problem of finding an acyclic orientation of an undirected graph with constrained in-degree parities specified by a subset T of vertices. An orientation is called T -odd if a vertex v has odd in-degree if and only if v P T .…
We give a necessary and sufficient condition in terms of pattern avoidance for the conjugates of the bottom vertex in the Bruhat graph attached to an O_n orbit O in the flag variety for GL_n to have degree equal to the rank of this graph as…
We formulate a sufficient condition for non-displaceability (by Hamiltonian symplectomorphisms which are identity outside of a compact) of a pair of subsets in a cotangent bundle. This condition is based on micro-local analysis of sheaves…
A well-known theorem of Blind and Mani says that every simple polytope is uniquely determined by its graph. Kalai gave a very short and elegant proof of this result using the concept of acyclic orientations. As it turns out, Kalai's proof…
Examples by Poletsky and the author and by Zwonek show the existence nowhere extendable holomorphic functions with the property that the pluripolar hull of their graphs is much larger than the graph of the respective functions and contains…
L.H. Feng at el \cite{feng4} present sufficient conditions based on spectral radius for a graph with large minimum degree to be $s$-path-coverable and $s$-Hamiltonian. Motivated by this study, in this paper, we give the sufficient…
We call a polytope P of dimension 3 admissible if it has the following two properties: (1) for each vertex of P the set of its first-neighbours is coplanar; (2) all planes determined by the first-neighbours are distinct. It is shown that…