相关论文: A Bramble like Witness for Large Branch-Width
A recent development in graph-minor theory is to study local separators, vertex-sets that separate graphs locally but not necessarily globally. The local separators of a graph roughly correspond to the genuine separators of its local…
We study D-branes in the extended geometry appearing in exceptional field theory (or exceptional generalised geometry). Starting from the exceptional sigma model (an $E_{d(d)}$ covariant worldsheet action with extra target space…
Uncover the vertices of a given graph, deterministic or random, in random order; we consider both a discrete-time and a continuous-time version. We study the evolution of the number of visible edges, and show convergence after normalization…
We show that the entanglement witnesses based on local orthogonal observables which are introduced in [S. Yu and N.-L. Liu, Phys. Rev. Lett. 95, 150504 (2005)] and [O. G\"uhne, M. Mechler, G. T\'oth and P. Adam, Phys. Rev. A 74, 010301…
For an oriented surface link $S$, we can take a satellite construction called a 2-dimensional braid over $S$, which is a surface link in the form of a covering over $S$. We demonstrate that 2-dimensional braids over surface links are useful…
We present a complex matrix gauge model defined on an arbitrary two-dimensional orientable lattice. We rewrite the model's partition function in terms of a sum over representations of the group U(N). The model solves the general…
Since the works of Haraux and Jaffard we know that rectangular plates may be observed by subregions not satisfying the geometrical control condition. We improve these results by observing only on an arbitrarily short segment inside the…
If one wants to establish optimality of a given bipartite entanglement witness, the current standard approach is to check whether it has the spanning property. Although this is not necessary for optimality, it is most often satisfied in…
5-brane configurations describing 5d field theories are promoted to an M theory description a la Witten in terms of polynomials in two complex variables. The coefficients of the polynomials are the Coulomb branch. This picture resolves…
The numerical invariants (global) cohomological length, (global) cohomological width, and (global) cohomological range of complexes (algebras) are introduced. Cohomological range leads to the concepts of derived bounded algebras and…
The notion of commutator width of a group, defined as the smallest number of commutators needed to represent each element of the derived group as their product, has been extensively studied over the past decades. In particular, in 1992…
In this paper we introduce a general framework for the study of limits of relational structures in general and graphs in particular, which is based on a combination of model theory and (functional) analysis. We show how the various…
For a semisimple Lie algebra admitting a good enumeration, we prove a parametrization for the elements in its Weyl group. As an application, we give a coordinate-free comparison between the crystal graph description (when it is known) and…
We introduce two common divisor graphs associated with a finite skew brace, based on its $\lambda$- and $\theta$-orbits. We prove that the number of connected components is at most two and the diameter of a connected component is at most…
Highly connected and yet sparse graphs (such as expanders or graphs of high treewidth) are fundamental, widely applicable and extensively studied combinatorial objects. We initiate the study of such highly connected graphs that are, in…
Graphs and networks provide a canonical representation of relational data, with massive network data sets becoming increasingly prevalent across a variety of scientific fields. Although tools from mathematics and computer science have been…
A map graph is a graph admitting a representation in which vertices are nations on a spherical map and edges are shared curve segments or points between nations. We present an explicit fixed-parameter tractable algorithm for recognizing map…
Given a graph and a representation of its fundamental group, there is a naturally associated twisted adjacency operator. The main result of this article is the fact that these operators behave in a controlled way under graph covering maps.…
The scramble number of a graph, a natural generalization of bramble number, is an invariant recently developed to study chip-firing games and graph gonality. We introduce the carton number of a graph, defined to be the minimum size of a…
We define a graph structure associated in a natural way to finite fields that nevertheless distinguishes between different models of isomorphic fields.