English
Related papers

Related papers: FI-sets with relations

200 papers

Associating graph algebras to directed graphs leads to both covariant and contravariant functors from suitable categories of graphs to the category k-Alg of algebras and algebra homomorphisms. As both functors are often used at the same…

Rings and Algebras · Mathematics 2026-04-30 Gilles G. de Castro , Francesco D'Andrea , Piotr M. Hajac

This paper studies a general class of Iterated Function Systems (IFS). No contractivity assumptions are made, other than the existence of some compact attractor. The possibility of escape to infinity is considered. Our present approach is…

Classical Analysis and ODEs · Mathematics 2007-05-23 Palle E. T. Jorgensen

A strongly polynomial sequence of graphs $(G_n)$ is a sequence $(G_n)_{n\in\mathbb{N}}$ of finite graphs such that, for every graph $F$, the number of homomorphisms from $F$ to $G_n$ is a fixed polynomial function of $n$ (depending on $F$).…

Combinatorics · Mathematics 2016-08-09 Andrew Goodall , Jaroslav Nesetril , Patrice Ossona de Mendez

We show that if X_n is a variety of cxn-matrices that is stable under the group Sym([n]) of column permutations and if forgetting the last column maps X_n into X_{n-1}, then the number of Sym([n])-orbits on irreducible components of X_n is…

Commutative Algebra · Mathematics 2022-09-02 Jan Draisma , Rob H. Eggermont , Azhar Farooq

The attempt is to give a formal concpet of system, and with this provide a definition of category, that will also satisfy the definition of a system. An axiomatic base is given, for constructing the group of integers. In the process, we…

Category Theory · Mathematics 2015-11-26 Juan Pablo Ramirez

We prove an essentially surjective Galois-correspondence-like functor for $n$-stacks. More specifically, it gives an essentially surjective functor from the $\infty$-category of $n$-stacks of finite sets with an action of the fundamental…

Algebraic Topology · Mathematics 2025-05-20 Yuxiang Yao

We study when the adjacency matrix of a Cayley graph factors as the product of two adjacency matrices of Cayley graphs. Let $G$ be a finite group and let $U\subseteq G\setminus \{e\}$ be symmetric. Writing $A(G;U)$ for the adjacency matrix…

Combinatorics · Mathematics 2025-12-22 Allen W. Herman , Bobby Miraftab

Let G be a finitely presented group, and let {G_i} be a collection of finite index normal subgroups that is closed under intersections. Then, we prove that at least one of the following must hold: 1. G_i is an amalgamated free product or…

Group Theory · Mathematics 2007-05-23 Marc Lackenby

It is shown that the multiplicative monoids of Brauer's centralizer algebras generated out of the basis are isomorphic to monoids of endomorphisms in categories where an endofunctor is adjoint to itself, and where, moreover, a kind of…

Category Theory · Mathematics 2011-09-13 K. Dosen , Z. Petric

Permutation invariant polynomial functions of matrices have previously been studied as the observables in matrix models invariant under $S_N$, the symmetric group of all permutations of $N$ objects. In this paper, the permutation invariant…

High Energy Physics - Theory · Physics 2022-08-24 George Barnes , Adrian Padellaro , Sanjaye Ramgoolam

Fix $m \in \mathbb N$. A new generalization of the $H$-join operation of a family of graphs $\{G_1, G_2, \dots, G_k\}$ constrained by indexing maps $I_1,I_2,\dots,I_k$ is introduced as $H_m$-join of graphs, where the maps $I_i:V(G_i)$ to…

Combinatorics · Mathematics 2024-02-19 R. Ganeshbabu , G. Arunkumar

The algebra of symmetric functions contains several interesting families of symmetric functions indexed by integer partitions or skew partitions. Given a sequence $\{u_n\}$ of symmetric functions taken from one of these families such that…

Combinatorics · Mathematics 2024-03-12 Velmurugan S

We consider elements of finite order in the Riordan group $\cal R$ over a field of characteristic $0$. Viewing $\cal R$ as a semi-direct product of groups of formal power series, we solve, for all $n \geq 2$, two foundational questions…

Combinatorics · Mathematics 2019-02-07 Marshall M. Cohen

In a recent paper [3], the authors introduced a map $\mathcal{F}$ which associates a Deitmar scheme (which is defined over the field with one element, denoted by $\mathbb{F}_1$) with any given graph $\Gamma$. By base extension, a scheme…

Algebraic Geometry · Mathematics 2016-05-10 Manuel Merida-Angulo , Koen Thas

Let $L_{n}$ be the free Lie algebra, $F_{n}$ be the free metabelian Lie algebra, and $L_{n,c}$ be the free metabelian nilpotent of class $c$ Lie algebra of rank $n$ generated by $x_1,\ldots,x_n$ over a field $K$ of characteristic zero. We…

Rings and Algebras · Mathematics 2020-03-17 Sehmus Findik , Nazar Sahin Oguslu

We study the number of non-isomorphic functional graphs of affine-linear transformations from (\F_q)^n to itself, and we prove upper and lower bounds on this quantity for n large. As a corollary to our result, we prove bounds on the number…

Number Theory · Mathematics 2013-02-20 Eric Bach , Andrew Bridy

Let $\phi \colon \Gamma_2 \rightarrow \Gamma_1$ be a harmonic morphism of connected graphs. We show that an arithmetical structure on $\Gamma_1$ can be pulled back via $\phi$ to an arithmetical structure on $\Gamma_2$. We then show that…

Combinatorics · Mathematics 2025-04-14 Kassie Archer , Caroline Melles

Let ${\mathbb{D}}^{m\times n}$ be the set of $m\times n$ matrices over a division ring $\mathbb{D}$. Two matrices $A,B\in {\mathbb{D}}^{m\times n}$ are adjacent if ${\rm rank}(A-B)=1$. By the adjacency, ${\mathbb{D}}^{m\times n}$ is a…

Combinatorics · Mathematics 2017-02-21 Li-Ping Huang , Kang Zhao

For $n \in \mathbb{N}$, let $X_n = \{a_1, a_2, \ldots, a_n\}$ be an $n$ - element set and let $\textbf{F} = (X_n; <_f)$ be a fence, also called a zigzag poset. As usual, we denote by $I_n$ the symmetric inverse semigroup on $X_n$. We say…

Rings and Algebras · Mathematics 2021-11-30 Ilinka Dimitrova , Jörg Koppitz

The symmetric group S_n acts as a reflection group on CP^{n-2} (for $n\geq 3$) . Associated with each of the $\binom{n}{2}$ transpositions in S_n is an involution on CP^{n-2} that pointwise fixes a hyperplane--the mirrors of the action. For…

Dynamical Systems · Mathematics 2007-05-23 Scott Crass
‹ Prev 1 3 4 5 6 7 10 Next ›