Related papers: A note on $m$-factorizations of complete multigrap…
A new family of maximal curves over a finite field is presented and some of their properties are investigated.
An automorphism group G of a 1-factorization of the complete multipartite graph $K_{m\times n}$ consists in permutations of the vertices of the graph mapping factors to factors. In this paper, we give a complete answer to the existence or…
We give an interpretation of the semi-infinite intersection cohomology sheaf associated to a semisimple simply-connected algebraic group in terms of finite-dimensional geometry. Specifically, we describe a procedure for building…
We investigate topological, combinatorial, statistical, and enumeration properties of finite graphs with high Kolmogorov complexity (almost all graphs) using the novel incompressibility method. Example results are: (i) the mean and variance…
We study several extensions of the notion of perfect graphs to $k$-uniform hypergraphs.
We classify the factorizations of finite classical groups with nonsolvable factors, completing the classification of factorizations of finite almost simple groups.
Motivated by the wide-ranging applications of Hamiltonian decompositions in distributed computing, coded caching, routing, resource allocation, load balancing, and fault tolerance, our work presents a comprehensive design for Hamiltonian…
An intense activity is nowadays devoted to the definition of models capturing the properties of complex networks. Among the most promising approaches, it has been proposed to model these graphs via their clique incidence bipartite graphs.…
Using a result of Vdovina, we may associate to each complete connected bipartite graph $\kappa$ a $2$-dimensional square complex, which we call a tile complex, whose link at each vertex is $\kappa$. We regard the tile complex in two…
We introduce a new model of indeterminacy in graphs: instead of specifying all the edges of the graph, the input contains all triples of vertices that form a connected subgraph. In general, different (labelled) graphs may have the same set…
The interplay between coding theory and $t$-designs started many years ago. While every $t$-design yields a linear code over every finite field, the largest $t$ for which an infinite family of $t$-designs is derived directly from a linear…
In this monograph we undertake a comprehensive study of separable representations (as well as their unitary equivalence classes) of $C^*$-algebras associated to strongly connected finite $k$-graphs $\Lambda$. We begin with the…
In this paper, we explore the concept of the ``matrix product of graphs," initially introduced by Prasad, Sudhakara, Sujatha, and M. Vinay. This operation involves the multiplication of adjacency matrices of two graphs with assigned labels,…
In this paper, a new invariant was built towards the classification of separable C*-algebras of real rank zero, which we call latticed total K-theory. A classification theorem is given in terms of such an invariant for a large class of…
Block designs are combinatorial structures in which each pair of a set of varieties appears together in a fixed number of blocks. Complete graphs are graphs in which every pair of vertices are adjacent. We present some new constructions of…
This is a first of our papers devoted to "noncommutative topology and graph theory". Its origin is the paper math.QA/0002238 by I. Gelfand, V. Retakh, and R.L. Wilson where a new class of noncommutative algebras $Q_n$ was introduced. The…
The present paper considers multipartite graphs from the perspective of design theory and coding theory. A one-factor $F$ of the complete multipartite graph $K_{n\times g}$ (with $n$ parts of size $g$) gives rise to a $(g+1)$-ary code…
Ball, Ortega--Moreno, and Prodromou asked whether, for every odd prime $p$, one can find a $1$-factor of the complete graph $K_{p+1}$ with some arithmetic restrictions related to quadratic residues. This problem is motivated by…
This paper describes a part of the factorization theory of the family of all the entire functions with non vanishing derivatives. In particular it proves that this family of mappings contains primes. This assures that this family of entire…
New and old results on closed polynomials, i.e., such polynomials f in K[x_1,...,x_n] that the subalgebra K[f] is integrally closed in K[x_1,...,x_n], are collected. Using some properties of closed polynomials we prove the following…