Related papers: The Semigroup of Combinatorial Configurations
An $(n_k)$-configuration is a set of $n$ points and $n$ lines in the projective plane such that their point-line incidence graph is $k$-regular. The configuration is geometric, topological, or combinatorial depending on whether lines are…
It is proved that the numerical semigroups associated to the combinatorial configurations satisfy a family of non-linear symmetric patterns. Also, these numerical semigroups are studied for two particular classes of combinatorial…
Let $k$ and $l$ be integers, both at least 2. A $(k,l)$-bipartite graph is an $l$-regular bipartite multigraph with coloured bipartite sets of size $k$. Define $\chi(k,l)$ and $\mu(k,l)$ to be the minimum and maximum order of automorphism…
An abstract $(v_k,b_r)$-configuration is a pair of finite sets of cardinalities $v$ and $b$ with a relation on the product of the sets such that each element of the first set is related to the same number $k$ of elements from the second set…
If $G$ is a graph with vertex set $V$, let Conf$_n^{\text{sink}}(G,V)$ be the space of $n$-tuples of points on $G$, which are only allowed to overlap on elements of $V$. We think of Conf$_n^{\text{sink}}(G,V)$ as a configuration space of…
A pseudo $(v,\, k,\, \la)$-design is a pair $(X, {\cal B})$ where $X$ is a $v$-set and ${\cal B}=\{B_1,...,B_{v-1}\}$ is a collection of $k$-subsets (blocks) of $X$ such that each two distinct $B_i, B_j$ intersect in $\la$ elements; and…
To any finite ordered subset and any finite partition of a group a set of tuples of positive integers, named as configurations, is associated that describes the group's behavior. The present paper provides an exposition of this notion and…
This paper is a continuation of the paper "Numerical Semigroups: Ap\'ery Sets and Hilbert Series". We consider the general numerical AA-semigroup, i.e., semigroups consisting of all non-negative integer linear combinations of relatively…
A numerical semigroup is a co-finite submonoid of the monoid of non-negative integers under addition. Many properties of numerical semigroups rely on some fundamental invariants, such as, among others, the set of gaps (and its cardinality),…
A $k$-star is a complete bipartite graph $K_{1,k}$. A partial $k$-star design of order $n$ is a pair $(V,\mathcal{A})$ where $V$ is a set of $n$ vertices and $\mathcal{A}$ is a set of edge-disjoint $k$-stars whose vertex sets are subsets of…
We provide a new way to represent numerical semigroups by showing that the position of every Ap\'ery set of a numerical semigroup $S$ in the enumeration of the elements of $S$ is unique, and that $S$ can be re-constructed from this…
Configurations are necklaces with prescribed numbers of red and black beads. Among all possible configurations, the regular one plays an important role in many applications. In this paper, several aspects of regular configurations are…
The paper consider an equivalence relation in the set of vertices of a bipartite graph. Some numerical characteristics showing the cardinality of equivalence classes are introduced. A combinatorial identity that is in relationship to these…
Let $[n]^{(k)}$ be the set of all ordered $k$-tuples of distinct elements in $[n]=\{1,2,...,n\}$. The $(n,k,r)$-arrangement graph $A(n,k,r)$ with $1\leq r\leq k\leq n$, is the graph with vertex set $[n]^{(k)}$ and with two $k$-tuples are…
We give a brief account of a construction called tokens here, which is significant in algebra, analysis, combinatorics, and physics. Tokens allow to express a semigroup on one set via a semigroup convolution on another set. Therefore tokens…
An $(n_k)$ configuration is a set of $n$ points and $n$ lines such that each point lies on $k$ lines while each line contains $k$ points. The configuration is geometric, topological, or combinatorial depending on whether lines are…
We study combinatorial configurations with the associated point and line graphs being strongly regular. Examples not belonging to known classes such as partial geometries and their generalizations or elliptic semiplanes are constructed.…
Let $\mathcal{C}$ be a positive integer cone and $k\in \mathcal{C}$. A $\mathcal{C}$-semigroup $S$ is $k$-positioned if for every $h\in \mathcal{C}\setminus S$ we have that $k-h$ belongs to $S$. In this work, we focus on this family of…
Diagram semigroups are interesting algebraic and combinatorial objects, several types of them originating from questions in computer science and in physics. Here we describe diagram semigroups in a general framework and extend our…
Let $X$, $Y$ be sets and let $\Phi$, $\Psi$ be mappings with the domains $X^{2}$ and $Y^{2}$ respectively. We say that $\Phi$ is combinatorially similar to $\Psi$ if there are bijections $f \colon \Phi(X^2) \to \Psi(Y^{2})$ and $g \colon Y…