Searcharxiv⌕ Search

arXiv subjects

Ján Mináč

Publications and source records attributed to Ján Mináč.

At least 19 recordsLinked to original sources

A septic covariant and the Hermite--Joubert problem in degree seven

We prove the degree-seven case of the Hermite--Joubert problem in characteristic zero: if $F$ is a field of characteristic zero and $E/F$ is a field extension of degree seven, then $E$ is generated by an element $a$ with $\text{tr}_{E/F}(a)=\text{tr}_{E/F}(a^{3})=0$, that is, with minimal polynomial of the form $λ^{7}+c_{2}λ^{5}+c_{4}λ^{3}+c_{5}λ^{2}+c_{6}λ+c_{7}$, where the $c_i$'s belong to $F$. This is given by an explicit formula: a covariant of the binary septic of coefficient degree seven and order five, evaluated at a generator $θ$ and divided by the derivative of its minimal polynomial evaluated at $θ$. We also announce the general theorem, which will be proved in a companion paper in preparation: over every infinite field, in every characteristic, every étale algebra of degree seven contains a primitive element $a$ with $c_{1}(a)=c_{3}(a)=0$. Moreover, every field extension of degree seven of an arbitrary field has a generator $a$ with $c_{1}(a)=c_{3}(a)=0$.

math.NT↗

Isomorphic gcd-graphs over polynomial rings

Gcd-graphs over the ring of integers modulo $n$ are a simple and elegant class of integral graphs. The study of these graphs connects multiple areas of mathematics, including graph theory, number theory, and ring theory. In a recent work, inspired by the analogy between number fields and function fields, we define and study gcd-graphs over polynomial rings with coefficients in finite fields. We discover that, in both cases, gcd-graphs share many similar and analogous properties. In this article, we extend this line of research further. Among other topics, we explore an analog of a conjecture of So and a weaker version of Sander-Sander, concerning the conditions under which two gcd-graphs are isomorphic or isospectral. We also provide several constructions showing that, unlike the case over $\mathbb{Z}$, it is not uncommon for two gcd-graphs over polynomial rings to be isomorphic.

math.NT↗

Sums of units in finite rings and applications to Cayley graphs

The question of whether a ring is additively generated by its units has been studied from several perspectives in ring theory and algebraic graph theory. In this paper, we investigate this problem for finite rings, not necessarily commutative, and relate it to the connectedness of gcd-graphs, the existence of perfect state transfer, and the solvability of certain equations over finite fields. Additionally, we discuss a generalization of this question in which only certain normalized units are allowed in the generating set. Our work intersects algebra, number theory, and graph theory, and may be of interest to a broad audience.

math.RA↗

Exact expression for maximum Lyapunov exponent during transients in computationally powerful dynamical networks

We study a network whose rich spatiotemporal dynamics have recently been shown to enable dynamics-based computation, including logic gates, short-term memory, and simple encryption. The network's time dynamics can be exactly solved through a nonlinear coordinate transformation. Here, we derive an exact analytical expression for the network's time-dependent maximum Lyapunov exponent (MLE). We demonstrate, both numerically and analytically, that the network exhibits positive MLEs during the transients that are useful for computation. Our framework enables algebraic manipulation of transient lifetimes through network connectivity and initial conditions, providing a rigorous theoretical foundation for understanding and controlling computation with transients.

nlin.CD↗

Analytic Properties of Necklace Polynomials

The necklace polynomials \[ M_n(x)=\frac1n\sum_{d\mid n}μ(d)x^{n/d} \] play a central role in discrete mathematics: they count aperiodic necklaces, enumerate monic irreducible polynomials over finite fields, and give the dimensions of homogeneous components of free Lie algebras. Despite their inherently discrete origins, we show that treating $M_n(x)$ as a function of a real variable $x$ unlocks surprising structural properties that answer natural enumerative questions. In this paper, we study $M_n(x)$ as a real-variable function and establish several new analytical and monotonicity properties. We prove that the normalized functions $M_n(x)/x^n$ and their higher normalized derivatives are strictly increasing on $[1,\infty)$. As a consequence, we show that the proportion of irreducible polynomials of fixed degree over $\mathbf F_q$ increases with $q$. We also establish strict growth with respect to the degree $n$ for $x\ge2$. In addition, we determine a sharp threshold for log-convexity: the sequence $\{M_n(x)\}_{n\ge2}$ is uniformly log-convex if and only if $x>8$. These results reveal unexpected analytic structure underlying necklace polynomials and show how real-variable methods can yield new information about discrete enumeration problems. For instance, it is shown that adding one more bead to a sufficiently long necklace will approximately increase the total number of primitive, rotationally distinct configurations by a factor of the number of available colors.

math.CO↗

An explicit operator explains end-to-end computation in the modern neural networks used for sequence and language modeling

We establish a mathematical correspondence between state space models, a state-of-the-art architecture for capturing long-range dependencies in data, and an exactly solvable nonlinear oscillator network. As a specific example of this general correspondence, we analyze the diagonal linear time-invariant implementation of the Structured State Space Sequence model (S4). The correspondence embeds S4D, a specific implementation of S4, into a ring network topology, in which recent inputs are encoded, as waves of activity traveling over the one-dimensional spatial layout of the network. We then derive an exact operator expression for the full forward pass of S4D, yielding an analytical characterization of its complete input-output map. This expression reveals that the nonlinear decoder in the system induces interactions between these information-carrying waves that enable classifying real-world sequences. These results generalize across modern SSM architectures, and show that they admit an exact mathematical description with a clear physical interpretation. These insights enable a new level of interpretability for these systems in terms of nonlinear oscillator networks.

cs.NE↗

On the arithmetic of the join rings over finite fields

Given a collection $\{ G_i\}_{i=1}^d$ of finite groups and a ring $R$, we have previously introduced and studied certain foundational properties of the join ring $\mathcal{J}_{G_1, G_2, \ldots, G_d}(R)$. This ring bridges two extreme worlds: matrix rings $M_n(R)$ on one end, and group rings $R[G]$ on the other. The construction of this ring was motivated by various problems in graph theory, network theory, nonlinear dynamics, and neuroscience. In this paper, we continue our investigations of this ring, focusing more on its arithmetic properties. We begin by constructing a generalized augmentation map that gives a structural decomposition of this ring. This decomposition allows us to compute the zeta function of the join of group rings. We show that the join of group rings is a natural home for studying the concept of simultaneous primitive roots for a given set of primes. This concept is related to the order of the unit group of the join of group rings. Finally, we characterize the join of group rings over finite fields with the property that the order of every unit divides a fixed number. Remarkably, Mersenne and Fermat primes unexpectedly emerge within the context of this exploration.

math.RA↗

The Bloch--Kato conjecture, decomposing fields, and generating cohomology in degree one

The famous Bloch--Kato conjecture implies that for a field $F$ containing a primitive $p$th root of unity, the cohomology ring of the absolute Galois group $G_F$ of $F$ with $\mathbb{F}_p$ coefficients is generated by degree one elements. We investigate other groups with this property and characterize all such groups that are finite. Restricting to the case of $p$-groups, our work answers a question of Quadrelli, Snopce and Vanacci posed in 2022. As a further step in this program, we study implications of the Bloch--Kato conjecture to cohomological invariants of finite field extensions. Conversely, these cohomological invariants have implications for refining the Bloch--Kato conjecture. In service of such a refinement, we define the notion of a decomposing field for a cohomology class of a finite field extension and study minimal decomposing fields of degree two cohomology classes arising from degree $p$ extensions. We illustrate this refinement by explicitly computing the cohomology rings of superpythagorean fields and $p$-rigid fields. Finally, we construct nontrivial examples of cohomology classes and their decomposing fields, which rely on computations by David Benson in the appendix.

math.NT↗

Maximal $2$-extensions of Pythagorean fields and Right Angled Artin Groups

In this paper, we describe minimal presentations of maximal pro-$2$ quotients of absolute Galois groups of formally real Pythagorean fields of finite type. For this purpose, we introduce a new class of pro-$2$ groups: $Δ$-Right Angled Artin groups. We show that maximal pro-$2$ quotients of absolute Galois groups of formally real Pythagorean fields of finite type are $Δ$-Right Angled Artin groups. Conversely, let us assume that a maximal pro-$2$ quotient of an absolute Galois group is a $Δ$-Right Angled Artin group. We then show that the underlying field must be Pythagorean, formally real and of finite type. As an application, we provide an example of a pro-$2$ group which is not a maximal pro-$2$ quotient of an absolute Galois group, although it has Koszul cohomology and satisfies both the Kernel Unipotent and the strong Massey Vanishing properties. We combine tools from group theory, filtrations and associated Lie algebras, profinite version of the Kurosh Theorem on subgroups of free products of groups, as well as several new techniques developed in this work.

math.GR↗

On the gcd graphs over polynomial rings

Gcd-graphs over the ring of integers modulo $n$ are a natural generalization of unitary Cayley graphs. The study of these graphs has foundations in various mathematical fields, including number theory, ring theory, and representation theory. Using the theory of Ramanujan sums, it is known that these gcd-graphs have integral spectra; i.e., all their eigenvalues are integers. In this work, inspired by the analogy between number fields and function fields, we define and study gcd-graphs over polynomial rings with coefficients in finite fields. We establish some fundamental properties of these graphs, emphasizing their analogy to their counterparts over $\mathbb{Z}.$

math.NT↗

On divisibility relation graphs

For each positive integer $n$, we define the divisibility relation graph $D_n$ whose vertex set is the set of divisors of $n$, and in which two vertices are adjacent if one is a divisor of the other. This type of graph is a special case of graphs associated with a partial order, which have been widely studied in the literature. In this work, we determine various graph-theoretic invariants of divisibility relation graphs, such as their clique and independence numbers, and their planarity. We also discuss various spectral properties that are discovered by our numerical experiments.

math.CO↗

Geometric perspective of linear stability in finite networks of nonlinear oscillators

We use a complex-valued transformation of the Kuramoto model to develop an operator-description of the linear stability in finite networks of nonlinear oscillators. This mathematical approach offers analytical predictions for the linear stability of $q$-states, which include phase synchronization ($q = 0$) and waves with different spatial frequencies ($|q| > 0$). This approach seamlessly incorporates the presence of time delays (represented by phase-lags in the coupling). With this, we are able to analytically determine the specific combination of connectivity and time delays (phase-lags) that leads to any given $q$-state to be linearly stable. This approach offers a geometric perspective of linear stability in finite networks in terms of the connectivity and delays (phase-lag), and it opens a path to designing and controlling the spatiotemporal dynamics of individual oscillator networks.

math.DS↗

A mathematical language for linking fine-scale structure in spikes from hundreds to thousands of neurons with behaviour

Recent advances in neural recording technology allow simultaneously recording action potentials from hundreds to thousands of neurons in awake, behaving animals. However, characterizing spike patterns in the resulting data, and linking these patterns to behaviour, remains a challenging task. The lack of a rigorous mathematical language for variable numbers of events (spikes) emitted by multiple agents (neurons) is an important limiting factor. We introduce a new mathematical operation to decompose complex spike patterns into a set of simple, structured elements. This creates a mathematical language that allows comparing spike patterns across trials, detecting sub-patterns, and making links to behaviour via a clear distance measure. We apply the method to dual Utah array recordings from macaque prefrontal cortex, where this technique reveals previously unseen structure that can predict both memory-guided decisions and errors in a virtual-reality working memory task. These results demonstrate that this technique provides a powerful new approach to understand structure in the spike times of neural populations, at a scale that will continue to grow more and more rapidly in upcoming years.

q-bio.QM↗

A complete classification of perfect unitary Cayley graphs

Due to their elegant and simple nature, unitary Cayley graphs have been an active research topic in the literature. These graphs are naturally connected to several branches of mathematics, including number theory, finite algebra, representation theory, and graph theory. In this article, we study the perfectness property of these graphs. More precisely, we provide a complete classification of perfect unitary Cayley graphs associated with finite rings.

math.CO↗

On the strong Massey property for number fields

Let $n\geq 3$. We show that for every number field $K$ with $ζ_p \notin K$, the absolute and tame Galois groups of $K$ satisfy the strong $n$-fold Massey property relative to $p$. Our work is based on an adapted version of the proof of the Theorem of Scholz-Reichardt.

math.NT↗

On prime Cayley graphs

The decomposition of complex networks into smaller, interconnected components is a central challenge in network theory with a wide range of potential applications. In this paper, we utilize tools from group theory and ring theory to study this problem when the network is a Cayley graph. In particular, we answer the following question: Which Cayley graphs are prime?

math.CO↗

Fekete polynomials of principal Dirichlet characters

Fekete polynomials associated to quadratic Dirichlet characters have interesting arithmetic properties, and have been studied in many works. In this paper, we study a seemingly simpler yet rich variant: the Fekete polynomial $F_n(x) = \sum_{a=1}^n χ_n(a) x^a$ associated to a principal Dirichlet character $χ_n$ of modulus $n$. We investigate the cyclotomic factors of $F_n$ and conjecturally describe all of them. One interesting observation from our computations is that the non-cyclotomic part $f_n$ of $F_n(x)/x$ seems to be always irreducible. We study this factor closely in the special case that $n$ is a product of two odd primes, proving separability in specific cases, and studying its coefficients and special values. Combining these theoretical results with computational evidence lets us identify the Galois group of $f_n$ for small $n$, and raises precise questions in general.

math.NT↗

On the Paley graph of a quadratic character

Paley graphs form a nice link between the distribution of quadratic residues and graph theory. These graphs possess remarkable properties which make them useful in several branches of mathematics. Classically, for each prime number $p$ we can construct the corresponding Paley graph using quadratic and non-quadratic residues modulo $p$. Therefore, Paley graphs are naturally associated with the Legendre symbol at $p$ which is a quadratic Dirichlet character of conductor $p$. In this article, we introduce the generalized Paley graphs. These are graphs that are associated with a general quadratic Dirichlet character. We will then provide some of their basic properties. In particular, we describe their spectrum explicitly. We then use those generalized Paley graphs to construct some new families of Ramanujan graphs. Finally, using special values of $L$-functions, we provide an effective upper bound for their Cheeger number.

math.CO↗