Related papers: Polynomial Criterion for Abelian Difference Sets

What polynomial in the coefficients of a system of algebraic equations should be called its discriminant? We prove a package of facts that provide a possible answer. Let us call a system typical, if the homeomorphic type of its set of…

Let $G$ be an additive group of order $v$. A $k$-element subset $D$ of $G$ is called a $(v, k, \lambda, t)$-almost difference set if the expressions $gh^{-1}$, for $g$ and $h$ in $D$, represent $t$ of the non-identity elements in $G$…

In this paper, we introduce a notion of quantum discrepancy, a non-commutative version of combinatorial discrepancy which is defined for projection systems, i.e. finite sets of orthogonal projections, as non-commutative counterparts of set…

Let $A$ be abelian variety over the function field $K$ of a compact Riemann surface $B$. Fix a model $f \colon \mathcal{A} \to B$ of $A/K$ and a certain effective horizontal divisor $\DD \subset \mathcal{A}$. We give a sufficient condition…

The group isomorphism problem in computational complexity asks whether two finite groups given by their Cayley tables are isomorphic or not. Although polynomial-time isomorphism tests exist for many specific types of groups, no general…

The process of replacing an arbitrary Boolean function by a bijective one, a fundamental tool in reversible computing and in cryptography, is interpreted algebraically as a particular instance of a certain group homomorphism from the X-fold…

We study relations between subsets of integers that are large, where large can be interpreted in terms of size (such as a set of positive upper density or a set with bounded gaps) or in terms of additive structure (such as a Bohr set). Bohr…

It is proved that for any finite dimensional representation of a prime order group over the field of rational numbers, polynomial invariants of degree at most $3$ separate the orbits. A result providing an upper degree bound for separating…

Boolean networks are special types of finite state time-discrete dynamical systems. A Boolean network can be described by a function from an n-dimensional vector space over the field of two elements to itself. A fundamental problem in…

The spectrum of a group is the set of its element orders. A finite group $G$ is said to be recognizable by spectrum if every finite group that has the same spectrum as $G$ is isomorphic to $G$. We prove that the simple alternating groups…

We give a new proof of quantifier elimination in the theory of all ordered abelian groups in a suitable language. More precisely, this is only "quantifier elimination relative to ordered sets" in the following sense. Each definable set in…

We introduce a hierarchy of conditions necessarily satisfied by any distribution P(ab) representing the probabilities for two separate observers to obtain outcomes a and b when making local measurements on a shared quantum state. Each…

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…

Signed difference sets have interesting applications in communications and coding theory. A $(v,k,\lambda)$-difference set in a finite group $G$ of order $v$ is a subset $D$ of $G$ with $k$ distinct elements such that the expressions…

Researchers frequently wish to assess the equality or inequality of groups, but this poses the challenge of adequately adjusting for multiple comparisons. Statistically, all possible configurations of equality and inequality constraints can…

In this paper, the discriminant of homogeneous polynomials is studied in two particular cases: a single homogeneous polynomial and a collection of n-1 homogeneous polynomials in n variables. In these two cases, the discriminant is defined…

A notion of degeneration of elements in groups is introduced. It is used to parametrize the orbits in a finite abelian group under its full automorphism group by a finite distributive lattice. A pictorial description of this lattice leads…

The present paper develops two concepts of pointwise differentiability of higher order for arbitrary subsets of Euclidean space defined by comparing their distance functions to those of smooth submanifolds. Results include that…

Generalisations of the bent property of a boolean function are presented, by proposing spectral analysis with respect to a well-chosen set of local unitary transforms. Quadratic boolean functions are related to simple graphs and it is shown…

We establish correspondances between factorisations of finite abelian groups (direct factors, unitary factors, non isomorphic subgroup classes) and factorisations of integer matrices. We then study counting functions associated to these…