Related papers: Digraph-defined external difference families and n…
Euclidean distance matrices (EDM) are matrices of squared distances between points. The definition is deceivingly simple: thanks to their many useful properties they have found applications in psychometrics, crystallography, machine…
We introduce the Circular Directional Flow Decomposition (CDFD), a new framework for analyzing circularity in weighted directed networks. CDFD separates flow into two components: a circular (divergence-free) component and an acyclic…
We construct an exotic one-parameter semigroup of endomorphims of a symmetric cone $C$, whose generator is not the sum of a Lie group generator and an endomorphism of $C$. The question is motivated by the theory of affine processes on…
Interplay between coding theory and combinatorial $t$-designs has been a hot topic for many years for combinatorialists and coding theorists. Some infinite families of cyclic codes supporting infinite families of $3$-designs have been…
Flip graphs are graphs on combinatorial objects in which the adjacency relation reflects a local change in the underlying objects. In this thesis we introduce Yoke graphs, a family of flip graphs that generalizes previously studied families…
We build the first examples of diffeomorphisms that are distorted in a group of $C^r$ diffeomorphisms yet undistorted in the corresponding group of $C^s$ diffeomorphisms, where $r < s$. This explicit construction is performed for the closed…
We initiate a study of E-semigroups over convex cones. We prove a structure theorem for E-semigroups which leave the algebra of compact operators invariant. Then we study in detail the CCR flows, E$_0$semigroups constructed from isometric…
We review recent developments in differential topology with special concern for their possible significance to physical theories, especially general relativity. In particular we are concerned here with the discovery of the existence of…
Cover-free families are set systems used as solutions for a large variety of problems, and in particular, problems where we deal with $n$ elements and want to identify $d$ invalid ones among them by performing only $t$ tests ($t \leq n$).…
Strong difference families of special types are introduced to produce new relative difference families from the point of view of both asymptotic existences and concrete examples. As applications, group divisible designs of type $30^u$ with…
This paper provides a combinatorial characterization of weak algebraic manipulation detection (AMD) codes via a kind of generalized external difference families called bounded standard weighted external difference families (BSWEDFs). By…
We focus on strongly connected, strong for short, digraphs since in this setting distance is defined for every pair of vertices. Distance ideals generalize the spectrum and Smith normal form of several distance matrices associated with…
Joint analysis of data from multiple information repositories facilitates uncovering the underlying structure in heterogeneous datasets. Single and coupled matrix-tensor factorization (CMTF) has been widely used in this context for…
We associate each endomorphism of a finite cyclic group with a digraph and study many properties of this digraph, including its adjacent matrix and automorphism group.
The $\Sigma$-method for structural analysis of a differential-algebraic equation (DAE) system produces offset vectors from which the sparsity pattern of a system Jacobian is derived. This pattern implies a block-triangular form (BTF) of the…
Constacyclic codes over finite fields are of theoretical importance as they are closely related to a number of areas of mathematics such as algebra, algebraic geometry, graph theory, combinatorial designs and number theory. However, the…
Any simple group-grading of a finite dimensional complex algebra induces a natural family of digraphs. We prove that $|E\circ E^{\text{op}}\cup E^{\text{op}}\circ E|\geq |E|$ for any digraph $\Gamma =(V,E)$ without parallel edges, and…
Heffter arrays were introduced by Archdeacon in 2015 as an interesting link between combinatorial designs and topological graph theory. Since the initial paper on this topic, there has been a good deal of interest in Heffter arrays as well…
Thus far, digraphs that are uniquely determined by their Hermitian spectra have proven elusive. Instead, researchers have turned to spectral determination of classes of switching equivalent digraphs, rather than individual digraphs. In the…
This paper provides a further step in our program of studying superconformal nets over S^1 from the point of view of noncommutative geometry. For any such net A and any family Delta of localized endomorphisms of the even part A^gamma of A,…