Related papers: Strong Medvedev reducibilities and the KL-randomne…
In this paper we give a short, elementary proof of the following too extreme cases of the Leopoldt conjecture: the case when $\K/\Q$ is a solvable extension and the case when it is a totally real extension in which $p$ splits completely.…
The rapid escalation from elementary school-level to frontier problems of the difficulty for LLM benchmarks in recent years have weaved a miracle for researchers that we are only inches away from surpassing human intelligence. However, is…
While LLMs have revolutionized the field of machine learning due to their high performance on a strikingly wide range of problems, they are also known to hallucinate false answers and underperform on less canonical versions of the same…
Based on the discovery of the duality between Jackiw-Teitelboim quantum gravity and a double-scaled matrix ensemble by Saad, Shenker and Stanford in 2019, we show how consistency between the two theories in the universal Random Matrix…
If in a given rank $r$, there is an irreducible complex local system with torsion determinant and quasi-unipotent monodromies at infinity on a smooth quasi-projective variety, then for every prime number $\ell$, there is an absolutely…
We give a new simple characterization of the set of Kleshchev multipartitions, and more generally of the set of Uglov multipartitions. These combinatorial objects play an important role in various areas of representation theory of quantum…
The main aim of the present paper is to disprove the Cohen--Lenstra--Martinet heuristics in two different ways and to offer possible corrections. We also recast the heuristics in terms of Arakelov class groups, giving an explanation for the…
Large Language Models (LLMs) excel in natural language tasks, but less is known about their reasoning capabilities over tabular data. Prior analyses devise evaluation strategies that poorly reflect an LLM's realistic performance on tabular…
Reasoning encompasses two typical types: deductive reasoning and inductive reasoning. Despite extensive research into the reasoning capabilities of Large Language Models (LLMs), most studies have failed to rigorously differentiate between…
We consider an elliptic Kolmogorov equation $\lambda u - Ku = f$ in a separable Hilbert space $H$. The Kolmogorov operator $K$ is associated to an infinite dimensional convex gradient system: $dX = (AX - DU(X))dt + dW (t)$, where $A $ is a…
Cameron-Liebler line classes and Cameron-Liebler k-classes in PG(2k+1,q) are currently receiving a lot of attention. Links with the Erd\H{o}s-Ko-Rado results in finite projective spaces occurred. We introduce here in this article the…
We answer a question posed by Hirschfeldt and Jockusch by showing that whenever $k > \ell$, Ramsey's theorem for singletons and $k$-colorings, $\mathsf{RT}^1_k$, is not strongly computably reducible to the stable Ramsey's theorem for…
We develop a scattering theory for CMV matrices, similar to the Faddeev--Marchenko theory. A necessary and sufficient condition is obtained for the uniqueness of the solution of the inverse scattering problem. We also obtain two sufficient…
Let $\mathfrak g$ be a reductive Lie algebra, and $m$ a positive integer. There is a natural density of irreducible representations of $\mathfrak g$, whose degrees are not divisible by $m$. For $\mathfrak g=\mathfrak{gl}_n$, this density…
We study the problem of nonnegative rank-one approximation of a nonnegative tensor, and show that the globally optimal solution that minimizes the generalized Kullback-Leibler divergence can be efficiently obtained, i.e., it is not NP-hard.…
Lehmer's totient problem asks if there exists a composite number $d$ such that its totient divide $d-1$. In this article we generalize the Lehmer's totient problem in algebraic number fields. We introduce the notion of a Lehmer number.…
We prove that for any prime $\ell$, any finite group has as many irreducible complex characters of degree prime to $\ell$ as the normalizers of its Sylow $\ell$-subgroups. This equality was conjectured by John McKay. The conjecture was…
Large Language Models (LLMs) have demonstrated impressive generalization capabilities across various tasks, but their claim to practical relevance is still mired by concerns on their reliability. Recent works have proposed examining the…
We study finite dimensional almost and quasi-effective prolongations of nilpotent Z-graded Lie algebras, especially focusing on those having a decomposable reductive structural subalgebra. Our assumptions generalize effectiveness and…
The purpose of this note is to provide a transparent and unified retelling of both Skvortsov's proof of the structural completeness of Medvedev's logic of finite problems, which is a classical result originally due to Prucnal, and of…