Related papers: Difference Sets with Few Character Values
A classical theorem on character degrees states that if a finite group has fewer than four character degrees, then the group is solvable. We prove a corresponding result on character values by showing that if a finite group has fewer than…
We present fundamental limits on the reliable classification of linear and affine subspaces from noisy, linear features. Drawing an analogy between discrimination among subspaces and communication over vector wireless channels, we propose…
A linking system of difference sets is a collection of mutually related group difference sets, whose advantageous properties have been used to extend classical constructions of systems of linked symmetric designs. The central problems are…
Mutual-visibility sets were motivated by visibility in distributed systems and social networks, and intertwine with several classical mathematical areas. Monotone properties of the variety of mutual-visibility sets, and restrictions of such…
For a variety of finite groups $\mathbf H$, let $\overline{\mathbf H}$ denote the variety of finite semigroups all of whose subgroups lie in $\mathbf H$. We give a characterization of the subsets of a finite semigroup that are pointlike…
We consider two problems regarding some divisibility properties of the subset sums of a set $A\subseteq \{1, 2, \ldots ,n\}$. At the beginning, we study the cardinality of $A$ which has the following property: For every $d\le n$ there is a…
We describe the conditions under which a set of continuous variables or characters can be described as an X-tree or a split network. A distance matrix corresponds exactly to a split network or a valued X-tree if, after ordering of the taxa,…
A More Sums Than Differences (MSTD) set is a set of integers A contained in {0, ..., n-1} whose sumset A+A is larger than its difference set A-A. While it is known that as n tends to infinity a positive percentage of subsets of {0, ...,…
We find finite, reasonably small, generator sets of the coordinate rings of G-character varieties of finitely generated groups for all classical groups G. This result together with the method of Grobner basis gives an algorithm for…
We derive an identity that relates a class of multiple integrals involving Vandermonde polynomials to divided differences. Alternatively the identity can be viewed as an integral formula for divided differences. As part of the derivation we…
In this paper, a construction of $(n,k,\delta)$ LDPC convolutional codes over arbitrary finite fields, which generalizes the work of Robinson and Bernstein and the later work of Tong is provided. The sets of integers forming a…
If V is a representation of a linear algebraic group G, a set S of G-invariant regular functions on V is called separating if the following holds: If two elements v,v' from V can be separated by an invariant function, then there is an f…
A graph G is distinguished if its vertices are labelled by a map \phi: V(G) \longrightarrow {1,2,...,k} so that no graph automorphism preserves \phi. The distinguishing number of G is the minimum number k necessary for \phi to distinguish…
Starting with a novel definition of divided differences, this essay derives and discusses the basic properties of, and facts about, (univariate) divided differences.
We study finite groups $G$ having a subgroup $H$ and $D \subset G \setminus H$ such that the multiset $\{ xy^{-1}:x,y \in D\}$ has every non-identity element occur the same number of times (such a $D$ is called a {\it difference set}). We…
Recognition of Off-line Chinese characters is still a challenging problem, especially in historical documents, not only in the number of classes extremely large in comparison to contemporary image retrieval methods, but also new unseen…
For a group $G$ acting on an affine variety $X$, the separating variety is the closed subvariety of $X\times X$ encoding which points of $X$ are separated by invariants. We concentrate on the indecomposable rational linear representations…
A disjoint $(v,k,k-1)$ difference family in an additive group $G$ is a partition of $G\setminus\{0\}$ into sets of size $k$ whose lists of differences cover, altogether, every non-zero element of $G$ exactly $k-1$ times. The main purpose of…
If a group $G$ is $\pi$-separable, where $\pi$ is a set of primes, the set of irreducible characters $\operatorname{B}_{\pi}(G) \cup \operatorname{B}_{\pi'}(G)$ can be defined. In this paper, we prove that there are variants of some…
Difference hierarchies were originally introduced by Hausdorff and they play an important role in descriptive set theory. In this survey paper, we study difference hierarchies of regular languages. The first sections describe standard…