Related papers: Product Structure and Treewidth of Hyperbolic Unif…

Motivated by the notion of cusp excursion in geometrically finite hyperbolic manifolds, we define a notion of excursion in any subgroup of a given group, and study its asymptotic distribution for right-angled Artin groups and graph…

We define persistent homology groups over any set of spaces which have inclusions defined so that the corresponding directed graph between the spaces is acyclic, as well as along any subgraph of this directed graph. This method…

Geometric constraints between feature matches are critical in 3D point cloud registration problems. Existing approaches typically model unordered matches as a consistency graph and sample consistent matches to generate hypotheses. However,…

Higher dimensional grand unified theories, with gauge symmetry breaking by orbifold compactification, possess SU(5) breaking at fixed points, and do not automatically lead to tree-level gauge coupling unification. A new framework is…

A constraint on masses of superheavy gauge and Higgs multiplets at the grand unification (GUT) scale is obtained from the gauge coupling unification in the case of high-scale supersymmetry. We found that all of the particles may lie around…

We study smooth higher symmetry groups and moduli $\infty$-stacks of generic higher geometric structures on manifolds. Symmetries are automorphisms which cover non-trivial diffeomorphisms of the base manifold. We construct the smooth higher…

In this paper we study the maximum number of hyperedges which may be in an $r$-uniform hypergraph under the restriction that no pair of vertices has more than $t$ Berge paths of length $k$ between them. When $r=t=2$, this is the even-cycle…

Chung and Graham [J. London Math. Soc. 1983] claimed to prove that there exists an $n$-vertex graph $G$ with $ \frac{5}{2}n \log_2 n + O(n)$ edges that contains every $n$-vertex tree as a subgraph. Frati, Hoffmann and T\'oth [Combin.…

A unit disk graph $G$ on a given set $P$ of points in the plane is a geometric graph where an edge exists between two points $p,q \in P$ if and only if $|pq| \leq 1$. A spanning subgraph $G'$ of $G$ is a $k$-hop spanner if and only if for…

Given a connected graph $G$ and a non-negative integer $g$, the {\em $g$-extra connectivity} $\k_g(G)$ of $G$ is the minimum cardinality of a set of vertices in $G$, if it exists, whose deletion disconnects $G$ and leaves each remaining…

Higgs triplet models are known to have difficulties obtaining agreement with electroweak precision data and in particular constraints on the $\rho$ parameter. Either a global $SU(2)_L \otimes SU(2)_R$ symmetry has to be imposed on the…

Hierarchical data is common in many domains like life sciences and e-commerce, and its embeddings often play a critical role. While hyperbolic embeddings offer a theoretically grounded approach to representing hierarchies in low-dimensional…

We prove there is a class of maps $\gamma:\mathbb{T}^{2n}\rightarrow\mathbb{S}^1$ such that a conservative dynamically coherent partially hyperbolic skew-product on $\mathbb{T}^{2n}\times\mathbb{S}^1$ with fixed hyperbolic dynamics on the…

A geometric intersection graph is constructed over a set of geometric objects, where each vertex represents a distinct object and an edge connects two vertices if and only if the corresponding objects intersect. We examine the problem of…

We prove the existence of families of distinct isotopy classes of physical unknots through the key concept of parametrised thickness. These unknots have prescribed length, tube thickness, a uniform bound on curvature, and cannot be…

Treewidth is a parameter that emerged from the study of minor closed classes of graphs (i.e. classes closed under vertex and edge deletion, and edge contraction). It in some sense describes the global structure of a graph. Roughly, a graph…

A graph is an instrument which is extensively utilized to model various problems in different fields. Up to date, many graphs have been developed to represent algebraic structures, particularly rings in order to study their properties. In…

The Lagrangian density of an $r$-uniform hypergraph $H$ is $r!$ multiplying the supremum of the Lagrangians of all $H$-free $r$-uniform hypergraphs. For an $r$-uniform graph $H$ with $t$ vertices, it is clear that $\pi_{\lambda}(H)\ge…

We describe in this paper a geometric construction in the projective p-adic plane that gives, together with a suitable notion of p-adic convexity, some open subsets of P 2 .Q p / naturally endowed with a "Hilbert" distance and a transitive…

Circle graphs are intersection graphs of chords in a circle and $k$-polygon graphs are intersection graphs of chords in a convex $k$-sided polygon where each chord has its endpoints on distinct sides. The $k$-polygon graphs, for $k \ge 2$,…