Abstract A representation of a finitely generated group into the projective general linear group is called convex co‐compact if it has finite kernel and its image acts convex co‐compactly on a properly convex domain in real projective space. We prove that the fundamental group of a closed irreducible orientable 3‐manifold can admit such a representation only when the manifold is geometric (with Euclidean, Hyperbolic or Euclidean Hyperbolic geometry) or when every component in the geometric decomposition is hyperbolic. In each case, we describe the structure of such examples.
more »
« less
This content will become publicly available on February 28, 2026
On Set Representation of Bounded Degree Hypergaphs
In their classical paper, Erdős, Goodman and Pósa studied the representation of a graph with vertex set $[n]$ by a family of subsets $$S_1,\dots, S_n$$ with the property that $$\{i,j\}$$ is an edge if and only if $$S_i\cap S_j\neq \emptyset$$. In this note, we consider a similar representation of bounded degree $$r$$-uniform hypergraphs and establish some bounds for a corresponding problem.
more »
« less
- Award ID(s):
- 2300347
- PAR ID:
- 10584368
- Publisher / Repository:
- Electron. J. Combin.
- Date Published:
- Journal Name:
- The Electronic Journal of Combinatorics
- Volume:
- 32
- Issue:
- 1
- ISSN:
- 1077-8926
- Format(s):
- Medium: X
- Sponsoring Org:
- National Science Foundation
More Like this
-
-
A Stick graph is an intersection graph of axis-aligned segments such that the left end-points of the horizontal segments and the bottom end-points of the vertical segments lie on a “ground line,” a line with slope −1. It is an open question to decide in polynomial time whether a given bipartite graph G with bipartition A∪B has a Stick representation where the vertices in A and B correspond to horizontal and vertical segments, respectively. We prove that G has a Stick representation if and only if there are orderings of A and B such that G’s bipartite adjacency matrix with rows A and columns B excludes three small ‘forbidden’ submatrices. This is similar to characterizations for other classes of bipartite intersection graphs. We present an algorithm to test whether given orderings of A and B permit a Stick representation respecting those orderings, and to find such a representation if it exists. The algorithm runs in time linear in the size of the adjacency matrix. For the case when only the ordering of A is given, we present an O(|AB}^3)-time algorithm.more » « less
-
A Stick graph is an intersection graph of axis-aligned segments such that the left end-points of the horizontal segments and the bottom end-points of the vertical segments lie on a “ground line,” a line with slope −1. It is an open question to decide in polynomial time whether a given bipartite graph G with bipartition A∪B has a Stick representation where the vertices in A and B correspond to horizontal and vertical segments, respectively. We prove that G has a Stick representation if and only if there are orderings of A and B such that G’s bipartite adjacency matrix with rows A and columns B excludes three small ‘forbidden’ submatrices. This is similar to characterizations for other classes of bipartite intersection graphs. We present an algorithm to test whether given orderings of A and B permit a Stick representation respecting those orderings, and to find such a representation if it exists. The algorithm runs in time linear in the size of the adjacency matrix. For the case when only the ordering of A is given, we present an O(|A|3|B|3)-time algorithm. When neither ordering is given, we present some partial results about graphs that are, or are not, Stick representable.more » « less
-
A group is called matricial field (MF) if it admits finite-dimensional approximate unitary representations which are approximately faithful and approximately contained in the left regular representation. This paper provides a new class of MF groups by showing that given two amenable groups with a common normal subgroup, the amalgamated free product is MF.more » « less
-
Cuntz, J (Ed.)Fell’s absorption principle states that the left regular representation of a group absorbs any unitary representation of the group when tensored with it. In a weakened form, this result carries over to the left regular representation of a right LCM submonoid of a group and its Nica-covariant isometric representations but it fails if the semigroup does not satisfy independence. In this paper, we explain how to extend Fell’s absorption principle to an arbitrary submonoidPof a groupGby using an enhanced version of the left regular representation. Li’s semigroup\mathrm{C}^{*}-algebra\mathrm{C}^{*}_{s}(P)and its representations appear naturally in our context. Using the enhanced left regular representation, we not only provide a very concrete presentation for the reduced object for\mathrm{C}^{*}_{s}(P)but we also resolve open problems and obtain very transparent proofs of earlier results. In particular, we address the non-selfadjoint theory and we show that the non-selfadjoint object attached to the enhanced left regular representation coincides with that of the left regular representation. We obtain a non-selfadjoint version of Fell’s absorption principle involving the tensor algebra of a semigroup and we use it to improve recent results of Clouâtre and Dor-On on the residual finite dimensionality of certain\mathrm{C}^{*}-algebras associated with such tensor algebras. As another application, we give yet another proof for the existence of a\mathrm{C}^{*}-algebra which is co-universal for equivariant, Li-covariant representations of a submonoidPof a groupG.more » « less
An official website of the United States government
