Related papers: Asymptotic structure. II. Path-width and additive …
In this paper, we address the additivity of $n$-multiplicative isomorphisms and $n$-multiplicative derivations on Gamma rings. We proved that, if $\M$ is a $\Gamma$-ring satisfying the some conditions, then any $n$-multiplicative…
This note is the sequel of "Geometric structures as variational objects, I." It generalizes the main result and perspectives of that work to a class of geometric structures that includes integrable almost-complex structures.
We enumerate rooted 2-connected and 3-connected surface maps with respect to vertices and edges. We also derive the bivariate version of the large face-width result for random 3-connected maps. These results are then used to derive…
This doctoral thesis undertakes an in-depth exploration of limiting shape theorems across diverse mathematical structures, with a specific focus on subadditive processes within finitely generated groups exhibiting polynomial growth rates,…
Given any countable group $G$, we construct uncountably many quasi-isometry classes of proper geodesic metric spaces with quasi-isometry group isomorphic to $G$. Moreover, if the group $G$ is a hyperbolic group, the spaces we construct are…
The d-measurement set of a graph is its set of possible squared edge lengths over all d-dimensional embeddings. In this note, we define a new notion of graph isomorphism called d-measurement isomorphism. Two graphs are d-measurement…
An arithmetical structure on a graph is given by a labeling of the vertices which satisfies certain divisibility properties. In this note, we look at several families of graphs and attempt to give counts on the number of arithmetical…
Graph states provide a powerful framework for describing multipartite entanglement in quantum information science. In their standard formulation, graph states are generated by controlled-$Z$ interactions and naturally encode symmetric…
Given an $r$-uniform hypergraph $H$ and a positive integer $n$, the weak saturation number $\mathrm{wsat}(n,H)$ is the minimum number of edges in an $r$-uniform hypergraph $F$ on $n$ vertices such that the missing edges in $F$ can be added,…
We undertake a systematic study of the approximation properties of the topological and measurable versions of the coarse boundary groupoid associated to a sequence of finite graphs of bounded degree. On the topological side, we prove that…
Two graph parameters are said to be coarsely equivalent if they are within constant factors from each other for every graph $G$. Recently, several graph parameters were shown to be coarsely equivalent to tree-length. Recall that the length…
In a 2D conservative Hamiltonian system there is a formal integral $\Phi$ besides the energy H. This is not convergent near a stable periodic orbit, but it is convergent near an unstable periodic orbit. We explain this difference and we…
The pathwidth of a graph $G$ is the smallest $w\in \mathbb{N}$ such that $G$ can be constructed from a sequence of graphs, each on at most $w+1$ vertices, by gluing them together in a linear fashion. We provide a full classification of the…
We describe the kernel of the canonical map from the Floyd boundary of a relatively hyperbolic group to its Bowditch boundary. Using our methods we then prove that a finitely generated group $H$ admitting a quasi-isometric map $\phi$ into a…
A path system $\mathscr{P}$ in a graph $G=(V,E)$ is a collection of paths, with exactly one path between any two vertices in $V$. A path system is said to be consistent if it is closed under subpaths. We say that a path system $\mathscr{P}$…
We prove that a PQ-symmetric homeomorphism between two complete metric spaces can be extended to a quasi-isometry between their hyperbolic approximations. This result is used to prove that two visual Gromov hyperbolic spaces are…
An \emph{obstacle representation} of a graph $G$ is a straight-line drawing of $G$ in the plane together with a collection of connected subsets of the plane, called \emph{obstacles}, that block all non-edges of $G$ while not blocking any of…
A simple Almost-Riemannian Structure on a Lie group G is defined by a linear vector field (that is an infinitesimal automorphism) and dim(G) -- 1 left-invariant ones. It is first proven that two different ARSs are isometric if and only if…
The aim of this paper is to give, using some contiguous relations, the asymptotic behaviour of some linear combination of two symmetric contiguous hypergeometric functions, under some conditions of their parameters.
We review basic notions in the field of information geometry such as Fisher metric on statistical manifold, $\alpha$-connection and corresponding curvature following Amari's work . We show application of information geometry to asymptotic…