Isomorphism problems for Hopf–Galois structures on separable field extensions

Let $L/K$ be a finite separable extension of fields whose Galois closure $E/K$ has Galois group G. Greither and Pareigis use Galois descent to show that a Hopf algebra giving a Hopf–Galois structure on $L/K$ has the form $E{[N]}^G$ for some group N of order $[L:K]$. We formulate criteria for two such Hopf algebras to be isomorphic as Hopf algebras, and provide a variety of examples. In the case that the Hopf algebras in question are commutative, we also determine criteria for them to be isomorphic as K-algebras. By applying our results, we complete a detailed analysis of the distinct Hopf algebras and K-algebras that appear in the classification of Hopf–Galois structures on a cyclic extension of degree $p^n$, for p an odd prime number.     

Representations of elementary abelian p-groups and finite subgroups of fields

Suppose $\mathbb{F}$ is a field of prime characteristic p and E is a finite subgroup of the additive group $(\mathbb{F},+)$. Then E is an elementary abelian p-group. We consider two such subgroups, say E and $E^{\prime }$, to be equivalent if there is an $\alpha \in {\mathbb{F}}^{\times }:=\mathbb{F}?\{0\}$ such that $E=\alpha E^{\prime }$. In this paper we show that rational functions can be used to distinguish equivalence classes of subgroups and, for subgroups of prime rank or rank less than twelve, we give explicit finite sets of separating invariants.     

A rigidity property of superpositions involving determinantal processes

The main result of this paper states that if $(N,\Pi )$ is a pair of independent point processes on a common ground space with $N$ Poisson and $\Pi$ determinantal induced by a locally trace class (not necessarily self-adjoint) correlation kernel, then their independent superposition $N+\Pi$ determines uniquely the distributions of $N$ and $\Pi$.     

Separable discrete functions: Recognition and sufficient conditions

A discrete function of $n$ variables is a mapping $g:X_1\times \dots \times X_n\to A$, where $X_1,\dots ,X_n$, and $A$ are arbitrary finite sets. Function $g$ is called separable if there exist $n$ functions $g_i:X_i\to A$ for $i=1,\dots ,n$, such that for every input $x_1,\dots ,x_n$ the function $g(x_1,\dots ,x_n)$ takes one of the values $g_1\left(x_1\right),\dots ,g_n\left(x_n\right)$. Given a discrete function $g$, it is an interesting problem to ask whether $g$ is separable or not. Although this seems to be a very basic problem concerning discrete functions, the complexity of recognition of separable discrete functions of $n$ variables is known only for $n=2$. In this paper we will show that a slightly more general recognition problem, when $g$ is not fully but only partially defined, is NP-complete for $n\ge 3$. We will then use this result to show that the recognition of fully defined separable discrete functions is NP-complete for $n\ge 4$.The general recognition problem contains the above mentioned special case for $n=2$. This case is well-studied in the context of game theory, where (separable) discrete functions of $n$ variables are referred to as (assignable) $n$-person game forms. There is a known sufficient condition for assignability (separability) of two-person game forms (discrete functions of two variables) called (weak) total tightness of a game form. This property can be tested in polynomial time, and can be easily generalized both to higher dimension and to partially defined functions. We will prove in this paper that weak total tightness implies separability for (partially defined) discrete functions of $n$ variables for any $n$, thus generalizing the above result known for $n=2$. Our proof is constructive. Using a graph-based discrete algorithm we show how for a given weakly totally tight (partially defined) discrete function $g$ of $n$ variables one can construct separating functions $g_1,\dots ,g_n$ in polynomial time with respect to the size of the input function.     

Branch-depth: Generalizing tree-depth of graphs

We present a concept called the branch-depth of a connectivity function, that generalizes the tree-depth of graphs. Then we prove two theorems showing that this concept aligns closely with the notions of tree-depth and shrub-depth of graphs as follows. For a graph $G=(V,E)$ and a subset $A$ of $E$ we let ${\lambda }_G\left(A\right)$ be the number of vertices incident with an edge in $A$ and an edge in $E\setminus A$. For a subset $X$ of $V$, let ${\rho }_G\left(X\right)$ be the rank of the adjacency matrix between $X$ and $V\setminus X$ over the binary field. We prove that a class of graphs has bounded tree-depth if and only if the corresponding class of functions ${\lambda }_G$ has bounded branch-depth and similarly a class of graphs has bounded shrub-depth if and only if the corresponding class of functions ${\rho }_G$ has bounded branch-depth, which we call the rank-depth of graphs.Furthermore we investigate various potential generalizations of tree-depth to matroids and prove that matroids representable over a fixed finite field having no large circuits are well-quasi-ordered by restriction.