Show newer

Scattered polynomials: an overview on their properties, connections and applications arxiv.org/abs/2411.11855

Scattered polynomials: an overview on their properties, connections and applications

The aim of this survey is to outline the state of the art in research on a class of linearized polynomials with coefficients over finite fields, known as scattered polynomials. These have been studied in several contexts, such as in [A. Blokhuis, M. Lavrauw. Scattered spaces with respect to a spread in $\mathrm{PG}(n, q)$. Geometriae Dedicata 81(1) (2000), 231-243] and [G. Lunardon, O. Polverino. Blocking sets and derivable partial spreads. J. Algebraic Combin. 14 (2001), 49-56]. Recently, their connection to maximum rank-metric codes was brought to light in [J. Sheekey. MRD codes: Constructions and connections. In K.-U. Schmidt and A. Winterhof, editors, Combinatorics and Finite Fields, De Gruyter (2019), 255-286]. This link has significantly advanced their study and investigation, sparking considerable interest in recent years. Here, we will explore their relationship with certain subsets of the finite projective line $\mathrm{PG}(1, q^n)$ known as maximum scattered linear sets, as well as with codes made up of square matrices of order $n$ equipped with the rank metric. We will review the known examples of scattered polynomials up to date and discuss some of their key properties. We will also address the classification of maximum scattered linear sets of the finite projective line $\mathrm{PG}(1, q^n)$ for small values of $n$ and discuss characterization results for the examples known so far. Finally, we will retrace how each scattered polynomial gives rise to a translation plane, as discussed in [V. Casarino, G. Longobardi, C. Zanella. Scattered linear sets in a finite projective line and translation planes, Linear Algebra Appl. 650 (2022), 286-298] and in [G. Longobardi, C. Zanella, A standard form for scattered linearized polynomials and properties of the related translation planes, J. Algebr. Comb. 59(4) (2024), 917-937].

arXiv.org

Reducing the Large Set Threshold for the Basu-Oertel Conjecture arxiv.org/abs/2411.11864

Reducing the Large Set Threshold for the Basu-Oertel Conjecture

In 1960, Grünbaum proved that for any convex body $C\subset\mathbb{R}^d$ and every halfspace $H$ containing the centroid of $C$, one has that the volume of $H\cap C$ is at least a $\frac{1}{e}$-fraction of the volume of $C$. Recently, in 2017, Basu and Oertel conjectured that a similar result holds for mixed-integer convex sets. Concretely, they proposed that for any convex body $C\subset \mathbb{R}^{n+d}$, there should exist a point $\mathbf{x} \in S=C\cap(\mathbb{Z}^{n}\times\mathbb{R}^d)$ such that for every halfspace $H$ containing $\mathbf{x}$, one has that \[ \mathcal{H}_d(H\cap S) \geq \frac{1}{2^n}\frac{1}{e}\mathcal{H}_d(S), \] where $\mathcal{H}^d$ denotes the $d$-dimensional Hausdorff measure. While the conjecture remains open, Basu and Oertel proved that the above inequality holds true for sufficiently large sets, in terms of a measure known as the \emph{lattice width} of a set. In this work, by following a geometric approach, we improve this result by substantially reducing the threshold at which a set can be considered large. We reduce this threshold from an exponential to a polynomial dependency on the dimension, therefore significantly enlarging the family of mixed-integer convex sets over which the Basu-Oertel conjecture holds true.

arXiv.org

A Course of Algebra (PART I) arxiv.org/abs/2411.11873

A Course of Algebra (PART I)

The following is an exposition of a course of algebra that Prof. Aleksandr Aleksandrovich Zykov (1922-2013) distributed among the participants of his seminar in graph theory not far away from Odessa, Ukraine, on September, 1991. It is a privilege for me to be able to reproduce, with some good additions, the English version of this remarkable course that he designed carefully over several years with the help of other colleagues and with the only purpose of making the science of algebra more accessible to the less gifted student. Prof. Zykov was an admirable person and a very clever mathematician and scientist. His scientific interests were wide: from the mathematical sciences at any level and in any of their branches to the theory of relativity as I recall. He kindly wrote a review recommending the results of my doctoral dissertation, which was necessary for the approval to obtain a Ph.D. degree during the meeting of my defense. In that meeting, I was very nervous because I had in front of me fifteen professors all of them doctors of technical or mathematical sciences asking all sort of questions and whom I had to convince of the fact that my results were true. I am sure this algebra course played the role that Prof. Zykov, with his deepness of thought, had primarily intended, that is, one course designed with the right approach to help out many of his students.

arXiv.org

Robust Communication Design in RIS-Assisted THz Channels arxiv.org/abs/2411.10524 .SP .IT

Robust Communication Design in RIS-Assisted THz Channels

Terahertz (THz) communication offers the necessary bandwidth to meet the high data rate demands of next-generation wireless systems. However, it faces significant challenges, including severe path loss, dynamic blockages, and beam misalignment, which jeopardize communication reliability. Given that many 6G use cases require both high data rates and strong reliability, robust transmission schemes that achieve high throughput under these challenging conditions are essential for the effective use of high-frequency bands. In this context, we propose a novel mixed-criticality superposition coding scheme for reconfigurable intelligent surface (RIS)-assisted THz systems. This scheme leverages both the strong but intermittent direct line-of-sight link and the more reliable, yet weaker, RIS path to ensure robust delivery of high-criticality data while maintaining high overall throughput. We model a mixed-criticality queuing system and optimize transmit power to meet reliability and queue stability constraints. Simulation results show that our approach significantly reduces queuing delays for critical data while sustaining high overall throughput, outperforming conventional time-sharing methods. Additionally, we examine the impact of blockage, beam misalignment, and beamwidth adaptation on system performance. These results demonstrate that our scheme effectively balances reliability and throughput under challenging conditions, while also underscoring the need for robust beamforming techniques to mitigate the impact of misalignment in RIS-assisted channels.

arXiv.org
Show older
Qoto Mastodon

QOTO: Question Others to Teach Ourselves
An inclusive, Academic Freedom, instance
All cultures welcome.
Hate speech and harassment strictly forbidden.