Related papers: Multicast Networks Solvable over Every Finite Fiel…

For an integer $m\geq 2$, we aim to investigate the realizability of types of metacyclic-nonmodular groups, whose abelianization is $\mathbb{Z}/2 \mathbb{Z}\times\mathbb{Z}/2^m \mathbb{Z}$, as the Galois group of the maximal unramified…

This paper presents a new fast iterative solver for large systems involving kernel matrices. Advantageous aspects of H2 matrix approximations and the multigrid method are hybridized to create the H2-MG algorithm. This combination provides…

This paper deals with the problem of point-to-point reachability in multi-linear systems. These systems consist of a partition of the Euclidean space into a finite number of regions and a constant derivative assigned to each region in the…

In this paper we analyse the convergence properties of V-cycle multigrid algorithms for the numerical solution of the linear system of equations arising from discontinuous Galerkin discretization of second-order elliptic partial…

We study the set of common $\mathbb{F}_q$-rational solutions of "smooth" systems of multivariate symmetric polynomials with coefficients in a finite field $\mathbb{F}_q$. We show that, under certain conditions, the set of common solutions…

We show that if the ground set of a matroid can be partitioned into $k\ge 2$ bases, then for any given subset $S$ of the ground set, there is a partition into $k$ bases such that the sizes of the intersections of the bases with $S$ may…

We propose the first optimal geometric multigrid solver for hybrid high-order discretizations that can handle arbitrary polytopal agglomeration hierarchies in both two and three dimensions. The key ingredient is the use of modified skeleton…

In this paper, we prove new instances of the inverse Galois problem over global function fields for finite groups of Lie type. This is done by constructing compatible systems of $\ell$-adic Galois representations valued in a semisimple…

In this paper, we study the complexity of solving generic over-determined bilinear systems over a finite field $\mathbb{F}$. Given a generic bilinear sequence $B \in \mathbb{F}[\mathbf{x},\mathbf{y}]$, with respect to a partition of…

This paper studies the optimal points in the capacity region of Gaussian multiple access channels (GMACs) with constant fading, multiple antennas and various power constraints. The points of interest maximize general rate objectives that…

We study orbit-finite systems of linear equations, in the setting of sets with atoms. Our principal contribution is a decision procedure for solvability of such systems. The procedure works for every field (and even commutative ring) under…

A fundamental theorem of matroid theory establishes that a transversal matroid is representable over fields of any characteristic. It was proved in 1970 by Piff and Welsh: their proof is elegant and concise and, moveover, constructive.…

Multiplex networks are networks composed of multiple layers such that the number of nodes in all layers is the same and the adjacency matrices between the layers are diagonal. We consider the special class of multiplex networks where the…

This note was prepared as a handout for the MAT401 course ``Polynomial equations and fields", taught at the University of Toronto in Spring 2026. It presents a proof of a necessary condition for the solvability of algebraic equations by…

Let $F$ be a field with characteristic $\neq 2$. We show that $F$ is a nonrigid field if and only if certain small 2-groups occur as Galois groups over $F$. These results provide new "automatic realizability" results for Galois groups over…

Multigrid methods were invented for the solution of discretized partial differential equations in ordered systems. The slowness of traditional algorithms is overcome by updates on various length scales. In this article we discuss…

This paper concerns with the construction of codes over $GF(2)$ which reach the max-flow for single source multicast acyclic networks with delay. The coding is always a bitwise XOR of packets with equal lengths, and is based on highly…

This paper introduces a novel approach to understanding Galois theory, one of the foundational areas of algebra, through the lens of machine learning. By analyzing polynomial equations with machine learning techniques, we aim to streamline…

Additive cyclic codes over Galois rings were investigated in previous works. In this paper, we investigate the same problem but over a more general ring family, finite commutative chain rings. When we focus on non-Galois finite commutative…

Let L be a finite Galois extension of K with Galois group G. We decompose any idempotent 2-cocycle f using finite sequences of descending two-sided ideals of the corresponding weak crossed product algebra A:= (L/k, G, f). We specialise the…