Related papers: New constructions of signed difference sets

Given a representation V of a group G, there are two natural ways of defining a representation of the group algebra k[G] in the external power V^{\wedge m}. The set L(V) of elements of k[G] for which these two ways give the same result is a…

In this article, we give a sufficient and necessary condition for determining whether a matchgate signature retains its property under a certain variable permutation, which can be checked in polynomial time. We also define the concept of…

A packing of partial difference sets is a collection of disjoint partial difference sets in a finite group $G$. This configuration has received considerable attention in design theory, finite geometry, coding theory, and graph theory over…

Let $G$ be a linear algebraic group over a field $k$, and let $V$ be a $G$-module. Recall that the nullcone of $(G,V)$ is the set of points $v$ in $V$ with the property that $f(v)=0$ for every positive degree homogeneous invariant $f$ in…

We study $t$-designs of parameters $(n,k,\lambda)$ over finite fields as group divisible designs and set systems admitting a transitive action of a linear group encoded in an hypergraph $G$ whose vertex set of size $n$ is partitioned into…

A (v,b,r,k) combinatorial configuration is a (r,k)-biregular bipartite graph with v vertices on the left and b vertices on the right and with no cycle of length 4. Combinatorial configurations have become very important for some…

Suppose that $\gamma$ and $\sigma$ are two continuous bounded variation paths which take values in a finite-dimensional inner product space $V$. Recent papers have introduced the truncated and the untruncated signature kernel of $\gamma$…

Operators acting on the discrete random chaos yield signed multiplicative systems, extending the notion of spin matrices and quaternions. We investigate signed groups through the associated sign matrices, focusing on generators and their…

Consider arbitrarily parenthesized expressions on the $k$ variables $x_0, x_1, ..., x_{k-1}$, where each $x_i$ appears exactly once and in the order of their indices. We call these expressions {\em formal $k$--products}. $F^\sigma(k)$…

Let $G$ be a finite group and construct a graph $\Delta(G)$ by taking $G\setminus\{1\}$ as the vertex set of $\Delta(G)$ and by drawing an edge between two vertices $x$ and $y$ if $\langle x,y\rangle$ is cyclic. Let $K(G)$ be the set…

A signed graph is a graph with edges marked positive and negative; it is unbalanced if some cycle has negative sign product. We introduce the concept of vector valued switching function in signed graphs, which extends the concept of…

This paper presents a new end-to-end signal classification method using the signed cumulative distribution transform (SCDT). We adopt a transport-based generative model to define the classification problem. We then make use of mathematical…

If $G$ is a finite group and $k =q>2$ or $k=q+1$ for a prime power $q$ then, for infinitely many integers $v$, there is a $2$-$(v,k,1)$-design ${\bf D}$ for which ${\rm Aut} {\bf D}\cong G$.

The $k$-th exact-distance graph, of a graph $G$ has $V(G)$ as its vertex set, and $xy$ as an edge if and only if the distance between $x$ and $y$ is (exactly) $k$ in $G$. We consider two possible extensions of this notion for signed graphs.…

In this paper, we present an algorithm that enumerates a certain class of signed permutations, referred to as grid signed permutation classes. In the case of permutations, the corresponding grid classes are of interest because they are…

A signed graph is a pair $(G,\sigma)$, where $G$ is a graph and $\sigma: E(G)\rightarrow \{-, +\}$, called signature, is an assignment of signs to the edges. Given a signed graph $(G,\sigma)$ with no negative loops, a balanced…

We say that a linear space is harmonious if it is resolvable and admits an automorphism group acting sharply transitively on the points and transitively on the parallel classes. Generalizing old results by the first author et al. we present…

In this paper we define the concepts of $g.\Lambda_s$-sets and $g.V_s$-sets and we use them in order to obtain new characterizations of semi-T_1-, semi-R_0- and semi-T_{1/2}-spaces.

We find new constructions of infinite families of skew Hadamard difference sets in elementary abelian groups under the assumption of the existence of cyclotomic strongly regular graphs. Our construction is based on choosing cyclotomic…

There are many concepts of signed graph coloring which are defined by assigning colors to the vertices of the graphs. These concepts usually differ in the number of self-inverse colors used. We introduce a unifying concept for this kind of…