Related papers: Conjugacy languages in virtual graph products
We introduce Latent Vector Grammars (LVeGs), a new framework that extends latent variable grammars such that each nonterminal symbol is associated with a continuous vector space representing the set of (infinitely many) subtypes of the…
The property graph is an increasingly popular data model. Pattern construction and pattern matching are important tasks when dealing with property graphs. Given a property graph schema S, a property graph G, and a query pattern P, all…
We investigate string graphs through the lens of graph product structure theory, which describes complicated graphs as subgraphs of strong products of simpler building blocks. A graph $G$ is called a string graph if its vertices can be…
Visual dialog, which aims to hold a meaningful conversation with humans about a given image, is a challenging task that requires models to reason the complex dependencies among visual content, dialog history, and current questions. Graph…
The objective of this paper is to detect which combinatorial properties of a regular graph can completely determine the geodesic growth of the right-angled Coxeter or Artin group this graph defines, and to provide the first examples of…
The coadjoint representation of a connected algebraic group $Q$ with Lie algebra $\mathfrak q$ is a thrilling and fascinating object. Symmetric invariants of $\mathfrak q$ (= $\mathfrak q$-invariants in the symmetric algebra $S(\mathfrak…
We study the structure constants of the class algebra $R_Z(G_n)$ of the wreath products $G_n$ associated to an arbitrary finite group G with respect to the basis of conjugacy classes. We show that a suitable filtration on $R_Z(G_n)$ gives…
The conjugacy problem for a finitely generated group $G$ is the two-variable problem of deciding for an arbitrary pair $(u,v)$ of elements of $G$, whether or not $u$ is conjugate to $v$ in $G$. We construct examples of finitely generated,…
We study zero-one laws for random graphs. We focus on the following question that was asked by many: Given a graph property P, is there a language of graphs able to express P while obeying the zero-one law? Our results show that on the one…
Given a finite, simple, vertex-weighted graph, we construct a graded associative (non-commutative) algebra, whose generators correspond to vertices and whose ideal of relations has generators that are graded commutators corresponding to…
We show that the number of conjugacy classes of intersections $A\cap B^g$, for fixed finitely generated subgroups $A, B<F$ of a free group, is bounded above in terms of the ranks of $A$ and $B$; this confirms an intuition of Walter Neumann.…
We introduce the notion of coherent graphs, and show how those can be used to define dynamic semantics for Multiplicative Linear Logic (MLL) extended with non-determinism. Thanks to the use of a coherence relation rather than mere formal…
If $G$ is a group, a virtual retract of $G$ is a subgroup which is a retract of a finite index subgroup. Most of the paper focuses on two group properties: property (LR), that all finitely generated subgroups are virtual retracts, and…
This paper presents a model for linguistic description based on group theory. A grammar in this model, or "G-grammar", is a collection of lexical expressions which are products of logical forms, phonological forms, and their inverses.…
In \cite{CDD22} we investigated the structure of $\ast$-isomorphisms between von Neumann algebras $L(\Gamma)$ associated with graph product groups $\Gamma$ of flower-shaped graphs and property (T) wreath-like product vertex groups as in…
We show that the Right-Angled Coxeter group $C=C(G)$ associated to a random graph $G\sim \mathcal{G}(n,p)$ with $\frac{\log n + \log\log n + \omega(1)}{n} \leq p < 1- \omega(n^{-2})$ virtually algebraically fibers. This means that $C$ has a…
We study subsets $E$ of finitely generated groups where the set of all words over a given finite generating set that lie in $E$ forms a context-free language. We call these sets recognisably context-free. They are invariant of the choice of…
In the $(G,H)$-isomorphism game, a verifier interacts with two non-communicating players (called provers) by privately sending each of them a random vertex from either $G$ or $H$, whose aim is to convince the verifier that two graphs $G$…
We use tensor analysis techniques for high-dimensional data to gain insight into pitch curves, which play an important role in linguistics research. In particular, we propose that demeaned phonetics pitch curve data can be modeled as having…
We study properties of generic elements of groups of isometries of hyperbolic spaces. Under general combinatorial conditions, we prove that loxodromic elements are generic (i.e. they have full density with respect to counting in balls for…