Related papers: FI-sets with relations
Let $I_n(x)=\prod_{i=1}^n \left( 1+x^{F_{i+1}}\right)$, where $F_{i+1}$ denotes a Fibonacci number. Let $v_r(n)$ denote the sum of the $r$th powers of the coefficients of $I_n(x)$. Our prototypical result is that $\sum_{n\geq 0} v_2(n)x^n=…
In this paper, we study some graph theoretical properties of two derivative Euler Phi function set-graphs. For the Euler Phi function $\phi(n)$, $n\in \mathbb{N}$, the set $S_\phi(n) =\{i:\gcd(i,n)=1, 1\leq i \leq n\}$ and the vertex set is…
We study several structure aspects of functor categories from a small additive category to a module category, in particular the category F(A,K) of functors from finitely generated free modules over a commutative ring A to vector spaces over…
Let $\mathcal{M}$ be an $n$-cluster tilting subcategory of ${\rm mod}\mbox{-}\Lambda$, where $\Lambda$ is an artin algebra. Let $\mathcal{S}(\mathcal{M})$ denotes the full subcategory of $\mathcal{S}(\Lambda)$, the submodule category of…
We focus on working on incidence rings, a class of (possibly infinite) matrix rings indexed by ordered sets. Some general properties about them are given, including how they are always the inverse limit of finite matrix rings, giving a…
We prove a single category-theoretic result encapsulating the notions of ultrafilters, ultrapower, ultraproduct, tensor product of ultrafilters, the Rudin--Kiesler partial ordering on ultrafilters, and Blass's category of ultrafilters UF.…
The groups $\Gamma_{n,s}$ are defined in terms of homotopy equivalences of certain graphs, and are natural generalisations of $\mbox{Out}(F_n)$ and $\mbox{Aut}(F_n)$. They have appeared frequently in the study of free group automorphisms,…
We consider iterations of integer-valued functions $\phi$, which have no fixed points in the domain of positive integers. We define a local function $\phi_n$, which is a sub-function of $\phi$ being restricted to the subdomain $\{0, ..., n…
In this contribution we investigate several extensions of the powerset that comprise arbitrarily nested subsets, and call them superpower set. This allows the definition of graphs with possibly infinitely nested nodes. additionally we…
Theory of relations is the framework of this thesis. It is about enumeration of finite structures. Let $\mathscr C$ be a class of finite combinatorial structures, the \emph{profile} of $\mathscr C$ is the function $\varphi_{\mathscr C}$…
The set $X$ of $k$-subsets of an $n$-set has a natural graph structure where two $k$-subsets are connected if and only if the size of their intersection is $k-1$. This is known as the Johnson graph. The symmetric group $S_n$ acts on the…
Representation stability is a theory describing a way in which a sequence of representations of different groups is related, and essentially contains a finite amount of information. Starting with Church-Ellenberg-Farb's theory of…
Let A, B, S be categories, let F:A-->S and G:B-->S be functors. We assume that for "many" objects a in A, there exists an object b in B such that F(a) is isomorphic to G(b). We establish a general framework under which it is possible to…
This article is a sequel to hep-th/9411050, q-alg/9412017. In Chapter 1 we associate with every Cartan matrix of finite type and a non-zero complex number $\zeta$ an abelian artinian category $\FS$. We call its objects {\em finite…
A family of permutations $A \subset S_n$ is said to be \emph{$t$-set-intersecting} if for any two permutations $\sigma, \pi \in A$, there exists a $t$-set $x$ whose image is the same under both permutations, i.e. $\sigma(x)=\pi(x)$. We…
Gaussian elimination answers any question about a finitely presented vector space. However, a "uniform family" of such presentations--given as generic relations among an unspecified number of generators--is susceptible to elimination only…
We construct a wide subcategory of the category of finite association schemes with a collection of desirable properties. Our subcategory has a first isomorphism theorem analogous to that of groups. Also, standard constructions taking…
Given a symmetric monoidal $(\infty,n)$-category $\mathcal{C}$ and a space $X$, we address the problem of explicitly describing the symmetric monoidal $(\infty,n)$-category freely obtained from $\mathcal{C}$ by adjoining $X$ new…
We define the Grothendieck-Witt category over a fixed ground ring. In order to study the structure of this category, we introduce the general theory of Gysin functors and their associated categories of correspondences. The latter…
In this paper we introduced an arithmetic graph function which associates with every group G the directed graph whose vertices corresponds to the divisors of |G|. With the help of such functions we introduced arithmetic graphs of classes of…