Related papers: A note on $m$-factorizations of complete multigrap…
A graph is $k$-vertex-critical if $\chi(G)=k$ but $\chi(G-v)<k$ for all $v\in V(G)$. We construct a new infinite families of $k$-vertex-critical $(P_5,C_5)$-free graphs for all $k\ge 6$. Our construction generalizes known constructions for…
The directions of an infinite graph $G$ are a tangle-like description of its ends: they are choice functions that choose compatibly for all finite vertex sets $X\subseteq V(G)$ a component of $G-X$. Although every direction is induced by a…
We study a new class of infinite dimensional Lie algebras, which has important applications to the theory of integrable equations. The construction of these algebras is very similar to the one for automorphic functions and this motivates…
In a recent paper Cameron, Lakshmanan and Ajith began an exploration of hypergraphs defined on algebraic structures, especially groups, to investigate whether this can add a new perspective. Following their suggestions, we consider suitable…
The representations of a $k$-graph $C^*$-algebra $C^*(\Lambda)$ which arise from $\Lambda$-semibranching function systems are closely linked to the dynamics of the $k$-graph $\Lambda$. In this paper, we undertake a systematic analysis of…
It has been known for a long time that $t$-designs can be employed to construct both linear and nonlinear codes and that the codewords of a fixed weight in a code may hold a $t$-design. While a lot of progress in the direction of…
A connected 1-factorisation is a 1-factorisation of a hypergraph for which the union of each pair of distinct 1-factors is a connected hypergraph. A uniform 1-factorisation is a 1-factorisation of a hypergraph for which the union of each…
We construct a connected cubic nonnormal Cayley graph on $\mathrm{A}_{2^m-1}$ for each integer $m\geqslant4$ and determine its full automorphism group. This is the first infinite family of connected cubic nonnormal Cayley graphs on…
This is the second report of our work on the construction of directed strongly regular graphs. In our previous work, we constructed a couple of infinite families of new directed strongly regular graphs on the sets of antiflags of partial…
We develop a family of simple rank one theories built over quite arbitrary sequences of finite hypergraphs. (This extends an idea from the recent proof that Keisler's order has continuum many classes, however, the construction does not…
We analyze the factorization process for lattice maps, searching for integrable cases. The maps were assumed to be at most quadratic in the dependent variables, and we required minimal factorization (one linear factor) after 2 steps of…
We give a general construction leading to different non-isomorphic families $\Gamma_{n,q}(\K)$ of connected $q$-regular semisymmetric graphs of order $2q^{n+1}$ embedded in $\PG(n+1,q)$, for a prime power $q=p^h$, using the linear…
Combinatorial $t$-designs have been an interesting topic in combinatorics for decades. It was recently reported that the image sets of a fixed size of certain special polynomials may constitute a $t$-design. Till now only a small amount of…
Orbits of automorphism groups of partially ordered sets are not necessarily congruence classes, i.e. images of an order homomorphism. Based on so-called orbit categories a framework of factorisations and unfoldings is developed that…
For $r:=(r_1,\dots,r_k)$, an $r$-factorization of the complete $\lambda$-fold $h$-uniform $n$-vertex hypergraph $\lambda K_n^h$ is a partition of (the edges of) $\lambda K_n^h$ into $F_1,\dots, F_k$ such that for $i=1,\dots,k$, $F_i$ is…
We introduce a variation of the Ziv-Lempel and Crochemore factorizations of words by requiring each factor to be a palindrome. We compute these factorizations for the Fibonacci word, and more generally, for all $m$-bonacci words.
In this article we completely determine the spectrum for uniformly resolvable decompositions of the complete graph K_v into r 1-factors and s classes containing only copies of h-suns.
In this paper, we consider infinite words that arise as fixed points of primitive substitutions on a finite alphabet and finite colorings of their factors. Any such infinite word exhibits a "hierarchal structure" that will allow us to…
We extend the definition of quasi-finite complexes by considering not necessarily countable complexes. We provide a characterization of quasi-finite complexes in terms of L-invertible maps and dimensional properties of compactifications.…
We initiate the study of $\lambda$-fold near-factorizations of groups with $\lambda > 1$. While $\lambda$-fold near-factorizations of groups with $\lambda = 1$ have been studied in numerous papers, this is the first detailed treatment for…