Related papers: Multicast Networks Solvable over Every Finite Fiel…
In this paper we survey a new criteria for solvability of finite groups in terms of number of supersolvable (also known as polycyclic) and non-supersolvable subgroups. In particular, we present original examples of supersolvable groups such…
We provide a geometric solution to the problem of optimal relay positioning to maximize the multicast rate for low-SNR networks. The networks we consider, consist of a single source, multiple receivers and the only intermediate and…
Network enrichment analysis methods allow to identify active modules without being biased towards a priori defined pathways. One of mathematical formulations of such analysis is a reduction to a maximum-weight connected subgraph problem. In…
For every finite field F and every positive integer r, there exists a finite extension F' of F such that either SO(2r+1,F') or its simple derived group can be realized as a Galois group over Q. If the characteristic of F is 3 or 5 (mod 8),…
Let $d$ and $n$ be positive integers, and $E/F$ be a separable field extension of degree $m=\binom{n+d}{n}$. We show that if $|F| > 2$, then there exists a point $P\in \mathbb{P}^n(E)$ which does not lie on any degree $d$ hypersurface…
This paper proposes a highly efficient global coded-multiplexing scheme, conceptualized as Orthogonal Frequency Division Multiplexing over a finite field (FF-OFDM), for reliable multiuser communications. By utilizing a prime length cyclic…
We show that the presentation of affine $\mathbb{T}$-varieties of complexity one in terms of polyhedral divisors holds over an arbitrary field. We also describe a class of multigraded algebras over Dedekind domains. We study how the algebra…
Multicasting is the general method of conveying the same information to multiple users over a broadcast channel. In this work, the Gaussian MIMO broadcast channel is considered, with multiple users and any number of antennas at each node. A…
Non-linear polynomial systems over finite fields are used to model functional behavior of cryptosystems, with applications in system security, computer cryptography, and post-quantum cryptography. Solving polynomial systems is also one of…
Galois images of polycyclic codes over a finite chain ring $S$ and their annihilator dual are investigated. The case when a polycyclic codes is Galois-disjoint over the ring $S,$ is characterized and, the trace codes and restrictions of…
In this paper we give an algorithm to determine all finite matrix groups over a number field. Our algorithm is based on the representation theory of finite groups.
Given an arbitrary field $F$, we describe all Galois extensions $L/F$ whose Galois groups are isomorphic to the group of upper triangular unipotent 4-by-4 matrices with entries in the field of two elements.
We show that the number of lines in an $m$--homogeneous supersolvable line arrangement is upper bounded by $3m-3$ and we classify the $m$--homogeneous supersolvable line arrangements with two modular points up-to lattice-isotopy. A lower…
Multicast device-to-device (D2D) transmission is important for applications like local file transfer in commercial networks and is also a required feature in public safety networks. In this paper we propose a tractable baseline multicast…
Random linear network coding is a particularly decentralized approach to the multicast problem. Use of random network codes introduces a non-zero probability however that some sinks will not be able to successfully decode the required…
A new Efficient-bandwidth code-division-multiple-access (CDMA) for band-limited channels is introduced which is based on finite field transforms. A multilevel code division multiplex exploits orthogonality properties of nonbinary sequences…
The computation of stationary distributions of Markov chains is an important task in the simulation of stochastic models. The linear systems arising in such applications involve non-symmetric M-matrices, making algebraic multigrid methods a…
We provide a direct proof that a finite graded lattice with a maximal chain of left modular elements is supersolvable. This result was first established via a detour through EL-labellings in [McNamara-Thomas] by combining results of…
For each integer $m \geq 2$, a network is constructed which is solvable over an alphabet of size $m$ but is not solvable over any smaller alphabets. If $m$ is composite, then the network has no vector linear solution over any $R$-module…
A finite group $G$ is said to be admissible over a field $F$ if there exists a division algebra $D$ central over $F$ with a maximal subfield $L$ such that $L/F$ is Galois with group $G$. In this paper we give a complete characterization of…