Related papers: Vortices and Superfields on a Graph
A well-known application of the dependent random choice asserts that any $n$-vertex graph $G$ with positive edge density contains a `rich' vertex subset $U$ of size $n^{1-o(1)}$ such that every pair of vertices in $U$ has at least…
The general position problem in graphs is to find the maximum number of vertices that can be selected such that no three vertices lie on a common shortest path. The mutual-visibility problem in graphs is to find the maximum number of…
A new and extensive formalism is developed for monads and galaxies in non-standard enlargements. It is shown that monads and galaxies can be manipulated using order-preserving and order-reversing set-to-set maps, and that set properties…
We use holography to investigate the dynamics of a vortex-anti-vortex dipole in a strongly coupled superfluid in 2+1 dimensions. The system is evaluated in numerical real-time simulations in order to study the evolution of the vortices as…
We construct a supersymmetric grand unified model in the framework of a latticized extra dimension. The SU(5) symmetries on the lattice are broken by the vacuum expectation values of the link fields connecting adjacent SU(5) sites, leaving…
Let ${\rm dim}(G)$ and $D(G)$ respectively denote the metric dimension and the distinguishing number of a graph $G$. It is proved that $D(G) \le {\rm dim}(G)+1$ holds for every connected graph $G$. Among trees, exactly paths and stars…
Charged vortex solutions for noncommutative Maxwell-Higgs model in 3+1 dimensions are found. We show that the stability of these vortex solutions is spoiled out for some, large enough, noncommutativity parameter. A non topological charge,…
We study the connection between N=2 supersymmetry and a topological bound in a two-Higgs-doublet system having an $SU(2)\times U(1)_Y\times U(1)_{Y'}$ gauge group. We derive Bogomol'nyi equations from supersymmetry considerations showing…
We consider the superfield formulation of supersymmetric gauge and matter field theories on a three-dimensional sphere with rigid ${\cal N}=2$ supersymmetry, as well as with ${\cal N}> 2$. The construction is based on a supercoset…
Strongly coupled field theories with gravity duals can be placed at finite density in two ways: electric field flux emanating from behind a horizon, or bulk charged fields outside of the horizon that explicitly source the density. We…
We show that classical U(infinity) gauge theories can be obtained from the dimensional reduction of a certain class of higher-derivative theories. In general, the exact symmetry is attained in the limit of degenerate metric; otherwise, the…
Morris and Saxton used the method of containers to bound the number of $n$-vertex graphs with $m$ edges containing no $\ell$-cycles, and hence graphs of girth more than $\ell$. We consider a generalization to $r$-uniform hypergraphs. The…
We consider drawings of graphs that contain dense subgraphs. We introduce intersection-link representations for such graphs, in which each vertex $u$ is represented by a geometric object $R(u)$ and in which each edge $(u,v)$ is represented…
We define a range of new coarse geometric invariants based on various graph-theoretic measures of complexity for finite graphs, including: treewidth, pathwidth, cutwidth and bandwidth. We prove that, for bounded degree graphs, these…
In this paper, solution space organization of minimum vertex-cover problem is deeply investigated using the K\"{o}nig-Eg\'{e}rvary (KE) graph and theorem, in which a hierarchical decomposition mechanism named KE-layer structure of general…
The Graph Minors Structure Theorem of Robertson and Seymour asserts that, for every graph $H,$ every $H$-minor-free graph can be obtained by clique-sums of ``almost embeddable'' graphs. Here a graph is ``almost embeddable'' if it can be…
A hypergraph is said to be $1$-Sperner if for every two hyperedges the smallest of their two set differences is of size one. We present several applications of $1$-Sperner hypergraphs and their structure to graphs. In particular, we…
By imposing self-duality conditions, we obtain the explicit form in which gauge theories spontaneously breakdown in the Bogomol'nyi limit. In this context, we reconsider the Abelian Higgs, Chern-Simons Higgs and Maxwell-Chern-Simons Higgs…
A graph is called pseudo-outerplanar if each block has an embedding on the plane in such a way that the vertices lie on a fixed circle and the edges lie inside the disk of this circle with each of them crossing at most one another. In this…
In this paper we discuss reconstruction problems for graphs. We develop some new ideas like isomorphic extension of isomorphic graphs, partitioning of vertex sets into sets of equivalent points, subdeck property, etc. and develop an…