Related papers: Digraph-defined external difference families and n…
Bandelt and Mulder's structural characterization of Bipartite Distance Hereditary graphs asserts that such graphs can be built inductively starting from a single vertex and by repeatedly adding either pending vertices or twins (i.e.,…
Binary self-dual codes with large minimum distances, such as the extended Hamming code and the Golay code, are fascinating objects in the coding theory. They are closely related to sporadic simple groups, lattices and invariant theory. A…
A new heuristic based on vertex invariants is developed to rapidly distinguish non-isomorphic graphs to a desired level of accuracy. The method is applied to sample subgraphs from an E.coli protein interaction network, and as a probe for…
The \emph{difference subgroup graph} $D(G)$ of a finite group $G$ is defined as the graph whose vertices are the non-trivial proper subgroups of $G$, with two distinct vertices $H$ and $K$ adjacent if and only if $\langle H, K \rangle = G$…
Electrode-electrolyte interfaces are crucial for electrochemical energy conversion and storage. At these interfaces, the liquid electrolytes form electrical double layers (EDLs). However, despite more than a century of active research, the…
A two-dimensional grid with dots is called a \emph{configuration with distinct differences} if any two lines which connect two dots are distinct either in their length or in their slope. These configurations are known to have many…
Graph embedding is a central problem in social network analysis and many other applications, aiming to learn the vector representation for each node. While most existing approaches need to specify the neighborhood and the dependence form to…
We study (1,0) and (2,0) 6D superconformal field theories (SCFTs) that can be constructed in F-theory. Quite surprisingly, all of them involve an orbifold singularity C^2 / G with G a discrete subgroup of U(2). When G is a subgroup of…
Conjunctive normal forms where every clause has length at most two are called 2-CNFs. We study minimally unsatisfiable 2-CNFs (2-MUs), that is, unsatisfiable 2-CNFs where removing any clause destroys unsatisfiability, and obtain their full…
Functional digraphs are unlabelled finite digraphs where each vertex has exactly one out-neighbor. They are isomorphic classes of finite discrete-time dynamical systems. Endowed with the direct sum and product, functional digraphs form a…
We describe new families of Eliahou semigroups, encompassing previous families described by Delgado, Eliahou and Fromentin, and Bras-Amor\'os. A crucial parameter is a Farey interval associated to the semigroup. We show that these…
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…
An equiangular tight frame (ETF) is a type of optimal packing of lines in a real or complex Hilbert space. In the complex case, the existence of an ETF of a given size remains an open problem in many cases. In this paper, we observe that…
Crystal Structure Prediction (CSP) remains a fundamental challenge with significant implications for the development of new materials and the advancement of various scientific disciplines. Recent developments have shown that generative…
We introduce a new logic, called \emph{cluster first-order logic}, a restricted fragment of first-order logic specifically designed to study order invariance. An order-invariant formula is one on a vocabulary that contains an order;…
In this paper we discuss off-shell representations of N-extended supersymmetry in one dimension, ie, N-extended supersymmetric quantum mechanics, and following earlier work on the subject codify them in terms of certain graphs, called…
Modular graph forms (MGFs) are a class of non-holomorphic modular forms which naturally appear in the low-energy expansion of closed-string genus-one amplitudes and have generated considerable interest from pure mathematicians. MGFs satisfy…
In the recent paper entitled "Explicit constructions of MDS self-dual codes" accepted in { IEEE Transactions on Information Theory}, doi: 10.1109/TIT.2019.2954877, the author has constructed families of MDS self-dual codes from genus zero…
Methods that generate networks sharing a given degree distribution and global clustering can induce changes in structural properties other than that controlled for. Diversity in structural properties, in turn, can affect the outcomes of…
We introduce group crosscoders, an extension of crosscoders that systematically discover and analyse symmetrical features in neural networks. While neural networks often develop equivariant representations without explicit architectural…