Related papers: Refinement monoids and adaptable separated graphs
Let $(\mathcal{G},\nu)$ be a $t$-discrete ergodic groupoid. Consider a finite Von Neumann algebra $\mathcal{M}$ with separable predual. We prove that every uniformly bounded measurable representation $\rho:\mathcal{G} \rightarrow…
We prove the global triangulation conjecture for families of refined p-adic representations under a mild condition. That is, for a refined family, the associated family of (phi, Gamma)-modules admits a global triangulation on a Zariski open…
We study analytic properties of graph product of finite groups with a hyperbolic defining graph. This is done by studying dynamics on the Bowditch compactification of the extension graph, or the crossing graph, of graph product. In…
The study of very large graphs is a prominent theme in modern-day mathematics. In this paper we develop a rigorous foundation for studying the space of finite labelled graphs and their limits. These limiting objects are naturally countable…
Tits has defined Steinberg groups and Kac-Moody groups for any root system and any commutative ring R. We establish a Curtis-Tits-style presentation for the Steinberg group St of any rank > 2 irreducible affine root system, for any R.…
We study in detail the profinite group G arising as geometric \'etale iterated monodromy group of an arbitrary quadratic polynomial over a field of characteristic different from two. This is a self-similar closed subgroup of the group of…
We develop a unified representation theory for the categories of finite subsets and relation-preserving maps of highly homogeneous relational structures classified by Cameron. For any commutative coefficient ring $k$, we extend the…
In this paper, we consider terminal reflexive polytopes arising from finite directed graphs and study the problem of deciding which directed graphs yield smooth Fano polytopes. We show that any centrally symmetric or pseudo-symmetric smooth…
The processes of constructing some graphs from others using binary operations of union with intersection (gluing) are studied. For graph classes closed with respect to gluing operations the elemental and operational bases are introduced.…
The aim of this chapter is to provide an adequate graph theoretic framework for the description of periodic bifurcations which have recently been discovered in descendant trees of finite p-groups. The graph theoretic concepts of rooted…
Color refinement is an important technique that works very well in practice for the graph isomorphism problem. Tinhofer graphs are the class of graphs for which refinement together with individualization correctly tests graph isomorphism…
This paper is concerned with long-time interest of us, especially, the author, in realizing graphs as Reeb graphs of real algebraic functions of certain nice classes. The Reeb graph of a differentiable function is the set consisting of all…
We are interested in shapes of real algebraic curves in the plane and regions surrounded by them: they are named refined algebraic domains by the author. As characteristic finite sets, we consider points contained in two curves and the sets…
Geometric modeling by constraints leads to large systems of algebraic equations. This paper studies bipartite graphs underlaid by systems of equations. It shows how these graphs make possible to polynomially decompose these systems into…
We argue that Transformers are essentially graph-to-graph models, with sequences just being a special case. Attention weights are functionally equivalent to graph edges. Our Graph-to-Graph Transformer architecture makes this ability…
A hyperbolicity cone is said to be rank-one generated (ROG) if all its extreme rays have rank one, where the rank is computed with respect to the underlying hyperbolic polynomial. This is a natural class of hyperbolicity cones which are…
Our first main result shows that a graph product of right cancellative monoids is itself right cancellative. If each of the component monoids satisfies the condition that the intersection of two principal left ideals is either principal or…
The main result of this paper utilizes the representation graph of a group $G$, $R(V,G)$, and gives a general construction of a diagrammatic category $\mathbf{Dgrams}_{R(V,G)}$. The proof of the main theorem shows that, given explicit…
A new method for constructing self-referential tilings of Euclidean space from a graph directed iterated function system, based on a combinatorial structure we call a pre-tree, is introduced. In the special case that we refer to as…
The independent domination number $i(G)$ of a graph $G$ is the minimum cardinality of a maximal independent set of $G$, also called an $i(G)$-set. The $i$-graph of $G$, denoted $\mathcal{I}(G)$, is the graph whose vertices correspond to the…