Related papers: Matching theorems for systems of a finitely genera…
Given a finite graph G there is a corresponding group given by the presentation with generators the vertices of G and a relation [x,y]=1 for generators x and y precisely when (x,y) is an edge of G. Such groups are known as partially…
In this paper, we describe an algorithm for computing the left, right, or 2-sided congruences of a finitely presented semigroup or monoid with finitely many classes, and an alternative algorithm when the finitely presented semigroup or…
In this paper, we prove a fine condensation theorem. This is quite similar to condensation theorems for pure extender mice in the literature, except that condensation for iteration strategies has been added to the mix.
In recent papers we have refined a conjecture of Lehrer and Solomon expressing the characters of a finite Coxeter group $W$ afforded by the homogeneous components of its Orlik-Solomon algebra as sums of characters induced from linear…
Let G be a finite group and let k be a field of characteristic p. Given a finitely generated indecomposable non-projective kG-module M, we conjecture that if the Tate cohomology $\HHHH^*(G, M)$ of G with coefficients in M is finitely…
We formulate and prove a de Finetti representation theorem for finitely exchangeable states of a quantum system consisting of k infinite-dimensional subsystems. The theorem is valid for states that can be written as the partial trace of a…
A new general formula for the number of conjugacy classes of subgroups of given index in a finitely generated group is obtained.
Coherent sets of desirable gamble sets is used as a model for representing an agents opinions and choice preferences under uncertainty. In this paper we provide some results about the axioms required for coherence and the natural extension…
Let $c_n$ denote the number of nodes at a distance $n$ from the root of a rooted tree. A criterion for proving the rationality and computing the rational generating function of the sequence $\{c_n\}$ is described. This criterion is applied…
In this paper, we investigate how the initial models and the final models for the polynomial functors can be uniformly specified in matching logic.
We prove the dichotomy that every Coxeter group either has a strongly solid group von Neumann algebra or contains the product of an infinite cyclic group and a free group of rank 2. This generalizes the same dichotomy for right-angled…
For a commutative finite $\mathbb{Z}$-algebra, i.e., for a commutative ring $R$ whose additive group is finitely generated, it is known that the group of units of $R$ is finitely generated, as well. Our main results are algorithms to…
We study ideal-simple commutative semirings and summarize the results giving their classification, in particular when they are finitely generated. In the principal case of (para)semifields, we then consider their minimal number of…
We prove that any finitely generated one ended group has linear end depth. Moreover, we give alternative proofs to theorems relating the growth of a finitely generated group to the number of its ends.
A combinatorial group-theoretic hypothesis is presented that serves as a necessary and sufficient condition for a union of connected Cockcroft two-complexes to be Cockcroft. This hypothesis has a component that can be expressed in terms of…
In this paper, we give the enumeration of z-classes in finite Coxeter groups.
We introduce a notion of essential hyperbolic Coxeter polytope as a polytope which fits some minimality conditions. The problem of classification of hyperbolic reflection groups can be easily reduced to classification of essential Coxeter…
In the combinatorics of finite finite Coxeter groups, there is a simple formula giving the number of maximal chains of noncrossing partitions. It is a reinterpretation of a result by Deligne which is due to Chapoton, and the goal of this…
Universality has been an important concept in computable structure theory. A class $\mathcal{C}$ of structures is universal if, informally, for any structure, of any kind, there is a structure in $\mathcal{C}$ with the same…
Counting maximum matchings in a graph is of great interest in statistical mechanics, solid-state chemistry, theoretical computer science, mathematics, among other disciplines. However, it is a challengeable problem to explicitly determine…