Related papers: The combinatorics of the Baer-Specker group
The representation theory of the symmetric groups S_n is intimately related to combinatorics: combinatorial objects such as Young tableaux and combinatorial algorithms such as Murnaghan-Nakayama rule. In the limit as n tends to infinity,…
A general setting to study a certain type of formulas, expressing characters of the symmetric group $\mathfrak{S}_n$ explicitly in terms of descent sets of combinatorial objects, has been developed by two of the authors. This theory is…
The aim of this article is to obtain variations on the classical theorems of Schur and Baer on finiteness of commutator subgroups, valid in the contexts of Lie algebras and Leibniz algebras over a field. Using non-abelian tensor products…
We give a general construction of topological groups from combinatorial structures such as trees, towers, gaps, and subadditive functions. We connect topological properties of corresponding groups with combinatorial properties of these…
Suppose $G$ is a finite group and $A\subseteq G$ is such that $\{gA:g\in G\}$ has VC-dimension strictly less than $k$. We find algebraically well-structured sets in $G$ which, up to a chosen $\epsilon>0$, describe the structure of $A$ and…
The aim of this partly expository paper is to present and discuss two classes of sets of integers (Jamison and Kazhdan sets) whose definition and/or properties are determined or inspired by operator-theoretical properties. Jamison sets…
The usual way to investigate the statistical properties of finitely generated subgroups of free groups, and of finite presentations of groups, is based on the so-called word-based distribution: subgroups are generated (finite presentations…
In this talk we introduce several topics in combinatorial number theory which are related to groups; the topics include combinatorial aspects of covers of groups by cosets, and also restricted sumsets and zero-sum problems on abelian…
Let G be a finite group. We systematically exploit general homological methods in order to reduce the computation of G-equivariant KK-theory to topological equivariant K-theory. The key observation is that the functor assigning to a…
We present a computational approach to studying the structure of the representation ring of the symmetric group in dimension six. The Kronecker coefficients and all power formulae of irreducible representations of $S_6$ are computed using…
For the p-adic group G=SL (2) , we present results of the computations of the sums of the Bernstein projectors of a given depth. Motivation for the computations is based on a conversation with Roger Howe in August 2013. The computations are…
What might a combinatorial interpretation of the Kronecker coefficients even look like? We introduce a class of combinatorial objects called bitableaux, which we believe are a natural candidate, and we formulate a purely combinatorial…
In this paper we compute the K-theory (algebraic and topological) and entire periodic cyclic homology of compact Lie group C*-algebras, define Chern characters between them and show that the Chern characters in both topological and…
Let G be a discrete group. We give methods to compute for a generalized (co-)homology theory its values on the Borel construction (EG x X)/G of a proper G-CW-complex X satisfying certain finiteness conditions. In particular we give formulas…
Let $k$ be a finitely generated field of characteristic $p>0$ and $X$ a smooth and proper scheme over $k$. Recent works of Cadoret, Hui and Tamagawa show that, if $X$ satisfies the $\ell$-adic Tate conjecture for divisors for every prime…
A semitopological group $G$ is called {\it an $n$-semitopological group}, if for any $g\in G$ with $e\not\in\overline{\{g\}}$ there is a neighborhood $W$ of $e$ such that $g\not\in W^{n}$, where $n\in\mathbb{N}$. The class of…
For every dimension d, there is an infinite family of convex co-compact reflection groups of isometries of hyperbolic d-space --- the superideal (simplicial and cubical) reflection groups --- with the property that a random group at any…
We present a general abstract framework for combinatorial Dyson-Schwinger equations, in which combinatorial identities are lifted to explicit bijections of sets, and more generally equivalences of groupoids. Key features of combinatorial…
A combinatorial property of prositive group presentations, called completeness, is introduced, with an effective criterion for recognizing complete presentations, and an iterative method for completing an incomplete presentation. We show…
Several types of nonclassical structures within the $N$-qubit Pauli group that can be seen as fundamental resources for quantum information processing are presented and discussed. Identity Products (IDs), structures fundamentally related to…