Related papers: Introenumerability, autoreducibility, and randomne…
Assume that the Riemann hypothesis holds for Dedekind zeta functions. Under this assumption, we prove that a degree $d$ polynomial with random multiplicative $\pm1$ coefficients is irreducible in $\mathbb{Z}[x]$ with probability…
The advent of modern data collection and processing techniques has seen the size, scale, and complexity of data grow exponentially. A seminal step in leveraging these rich datasets for downstream inference is understanding the…
On a stack of stable maps, the psi classes are modified by subtracting certain boundary divisors. These modified psi classes are compatible with forgetful morphisms, and are well-suited to enumerative geometry: tangency conditions allow…
In this article we calculate the minimal faithful permutation degree for all of the irreducible Coxeter groups. We also exhibit new examples of finite groups that possess a quotient whose minimal degree is strictly greater than that of the…
Amenable groups are those admitting an invariant mean -- a finitely additive probability mean that assigns equal ``weight'' to any two translates of the same set. We introduce coset correct means (CCMs), a class of finitely additive means…
We consider suitable weak solutions of 2-dimensional Euler equations on bounded domains, and show that the class of completely random measures is infinitesimally invariant for the dynamics. Space regularity of samples of these random fields…
In this short note we show that every connected reductive simply-connected algebraic group of rank $>1$ over the complex numbers has infinitely many pairs of irreducible representations which are not related by an automorphism of the…
The sum theorem and its corollaries are proved for a countable family of zero-dimensional (in the sense of small and large inductive bidimensions) p-closed sets, using a new notion of relative normality whose topological correspondent is…
We relate the computational complexity of finite strings to universal representations of their underlying symmetries. First, Boolean functions are classified using the universal covering topologies of the circuits which enumerate them. A…
We show that diagrammatic sets, a topologically sound alternative to polygraphs and strict $\omega$-categories, admit an internal notion of equivalence in the sense of coinductive weak invertibility. We prove that equivalences have the…
We study a coarse moduli space of irreducible representations of the group of unipotent matrices of order $\mathbb{4}$ over the ring of integers which have finite weight. All such representations are known to be monomial. To describe a…
A classical theorem of Lusin states that all analytic sets are Lebesgue-measurable. In this article we established the reverse mathematical strength of Lusin's theorem, which depends on how precisely it is formalized. By doing so, we answer…
A tensor category is multiplicity-free if for any objects $A,B,C$ we have that $\mathrm{Hom}(A\otimes B\otimes C,\mathbb{C})$ is either $0$ or $1$ dimensional. It is known that $Rep^{uni}(U_q(\mathfrak{sp}(4)))$ is not multiplicty-free. We…
Godel's First Incompleteness Theorem is generalized to definable theories, which are not necessarily recursively enumerable, by using a couple of syntactic-semantic notions, one is the consistency of a theory with the set of all true…
Infinite words, also known as streams, hold significant interest in computer science and mathematics, raising the natural question of how their complexity should be measured. We introduce cellular automaton reducibility as a measure of…
We tested Rousseau's (in press) recent proposal to define percentile classes in the case of the Integrated Impact Indicator (I3) so that the largest number in a set always belongs to the highest (100th) percentile rank class. In the case a…
Given a prime power $q$ and positive integers $m,t,e$ with $e > mt/2$, we determine the number of all monic irreducible polynomials $f(x)$ of degree $m$ with coefficients in $\mathbb{F}_q$ such that $f(x^t)$ contains an irreducible factor…
We study the polynomial-time autoreducibility of NP-complete sets and obtain separations under strong hypotheses for NP. Assuming there is a p-generic set in NP, we show the following: - For every $k \geq 2$, there is a $k$-T-complete set…
A computable structure A is x-computably categorical for some Turing degree x, if for every computable structure B isomorphic to A there is an isomorphism f:B -> A with f computable in x. A degree x is a degree of categoricity if there is a…
Neural networks achieve outstanding accuracy in classification and regression tasks. However, understanding their behavior still remains an open challenge that requires questions to be addressed on the robustness, explainability and…