Related papers: Polynomial Criterion for Abelian Difference Sets
We give two new constructions of almost difference sets. The first is a generic construction of $(q^{2}(q+1),q(q^{2}-1),q(q^{2}-q-1),q^{2}-1)$ almost difference sets in certain groups of order $q^{2}(q+1)$ ($q$ is an odd prime power) having…
Let $A$ be a subset of a finite abelian group such that $A$ has a small difference set $A-A$ and the density of $A$ is small. We prove that, counter--intuitively, the smallness (in terms of $|A-A|$) of the Fourier coefficients of $A$…
Cluster analysis requires many decisions: the clustering method and the implied reference model, the number of clusters and, often, several hyper-parameters and algorithms' tunings. In practice, one produces several partitions, and a final…
Combinatorial discrepancy is a complexity measure of a collection of sets which quantifies how well the sets in the collection can be simultaneously balanced. More precisely, we are given an n-point set $P$, and a collection $\mathcal{F} =…
One of the classical problems in group theory is determining the set of positive integers $n$ such that every group of order $n$ has a particular property $P$, such as cyclic or abelian. We first present the Sylow theorems and the idea of…
We consider differential rings of the form (K[x; y];D), where K is an algebraically closed field of characteristic zero and D : K[x; y] \to K[x; y] is a K-derivation. We study the Automorphism Group of such a ring and give criteria for…
Consider the algebraic dynamics on a torus T=G_m^n given by a matrix M in GL_n(Z). Assume that the characteristic polynomial of M is prime to all polynomials X^m-1. We show that any finite equivariant map from another algebraic dynamics…
Hall's theorem on differences of bijections characterizes the multisets $$ \{a_1,\ldots,a_{|G|}\} $$ in a finite abelian group $G$ that can be written in the form $$ a_i=b_i-c_i, $$ where both $b_1,\ldots,b_{|G|}$ and $c_1,\ldots,c_{|G|}$…
This is a survey of recent progress in several areas of combinatorial algebra. We consider combinatorial problems about free groups, polynomial algebras, free associative and Lie algebras. Our main idea is to study automorphisms and, more…
The variant of calculation of functions of set and their application is offered. In particular: the new measure of system of sets generalizing classical concept of a measure is entered; the variation of set that has allowed to construct a…
Difference sets and their generalisations to difference families arise from the study of designs and many other applications. Here we give a brief survey of some of these applications, noting in particular the diverse definitions of…
Conformal prediction constructs a confidence set for an unobserved response of a feature vector based on previous identically distributed and exchangeable observations of responses and features. It has a coverage guarantee at any nominal…
A new criterion is developed which provides a check as to whether a chosen set of polarization observables is complete with respect to the determination of all independent $T$-matrix elements of a reaction of the type $a+b\to c+d+...$. As…
Divergences are fundamental to the information criteria that underpin most signal processing algorithms. The alpha-beta family of divergences, designed for non-negative data, offers a versatile framework that parameterizes and continuously…
The set of answers to a query may be very large, potentially overwhelming users when presented with the entire set. In such cases, presenting only a small subset of the answers to the user may be preferable. A natural requirement for this…
We show that after mapping each element of a set of second class constraints to the surface of the other ones, half of them form a subset of abelian first class constraints. The explicit form of the map is obtained considering the most…
In this paper we improve our previous results on classification of groups of points on abelian varieties over finite fields. The classification is given in terms of the Weil polynomial of abelian varieties in a given $k$-isogeny class.
In this paper, we define Abelian and consta-Abelian polyadic codes over rings defined as affine algebras over chain rings. For that aim, we use the classical construction via splittings and multipliers of the underlying Abelian group. We…
In this paper we introduce a method of characteristic sets with respect to several term orderings for difference-differential polynomials. Using this technique, we obtain a method of computation of multivariate dimension polynomials of…
In this note, we provide a different proof of Hill's criterion of freeness for abelian groups. Our proof hinges on the construction of suitable families of subgroups of the links in Hill's theorem and, ultimately, on the construction of…