Related papers: Optimal Results on ITRM-recognizability
We relate the singularities of a scheme $X$ to the asymptotics of the number of points of $X$ over finite rings. This gives a partial answer to a question of Mustata. We use this result to count representations of arithmetic lattices. More…
The provability logic of a theory T is the set of modal formulas, which under any arithmetical realization are provable in T . We slightly modify this notion by requiring the arithmetical realizations to come from a specified set $\Gamma$.…
By combining well-known techniques from both noncommutative algebra and computational commutative algebra, we observe that an algorithmic approach can be applied to the study of irreducible representations of finitely presented algebras. In…
The spectrum $\omega(G)$ of a finite group $G$ is the set of element orders of $G$. If $\Omega$ is a non-empty subset of the set of natural numbers, $h(\Omega)$ stands for the number of isomorphism classes of finite groups $G$ with…
We consider the problem of distinguishing human-written creative fiction (excerpts from novels) from similar text generated by an LLM. Our results show that, while human observers perform poorly (near chance levels) on this binary…
The prime graph of a finite group $G$ is denoted by $\ga(G)$. Also $G$ is called recognizable by prime graph if and only if each finite group $H$ with $\ga(H)=\ga(G)$, is isomorphic to $G$. In this paper, we classify all finite groups with…
We make a detailed study of idempotent ideals that are traces of countably generated projective right modules. We associate to such ideals an ascending chain of finitely generated left ideals and, dually, a descending chain of cofinitely…
The logarithmic representation of infinitesimal generators is generalized to the cases when the evolution operator is unbounded. The generalized result is applicable to the representation of infinitesimal generators of unbounded evolution…
This article is Part I in a series of three papers devoted to determining the minimal complexity of scales in the inner model $K(\mathbb{R})$. Here, in Part I, we shall complete our development of a fine structure theory for $K(\mathbb{R})$…
A class of infinite dimensional Galilean conformal algebra in (2+1) dimensional spacetime is studied. Each member of the class, denoted by \alg_{\ell}, is labelled by the parameter \ell. The parameter \ell takes a spin value, i.e., 1/2, 1,…
This is an exposition of our joint work with Kakde, Silliman, and Wang, in which we prove a version of Ribet's Lemma for $\mathrm{GL}_2$ in the residually indistinguishable case. We suppose we are given a Galois representation taking values…
For a finite $\mathbb{Z}$-algebra $R$, i.e., for a $\mathbb{Z}$-algebra which is a finitely generated $\mathbb{Z}$-module, we assume that $R$ is explicitly given by a system of $\mathbb{Z}$-module generators $G$, its relation module ${\rm…
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…
Generalizations of numeration systems in which N is recognizable by a finite automaton are obtained by describing a lexicographically ordered infinite regular language L over a finite alphabet A. For these systems, we obtain a…
Let $M$ be a finitely generated module over a Noetherian ring $R$ and $N$ a submodule. The index of reducibility ir$_M(N)$ is the number of irreducible submodules that appear in an irredundant irreducible decomposition of $N$ (this number…
Schnorr showed that a real is Martin-Loef random if and only if all of its initial segments are incompressible with respect to prefix-free complexity. Fortnow and independently Nies, Stephan and Terwijn noticed that this statement remains…
Retrieval-Augmented Generation (RAG) grounds Large Language Model (LLM) output by leveraging external knowledge sources to reduce factual hallucinations. However, prior work lacks a comprehensive evaluation of different language families,…
Identities of complex irreducible representations of finite groups can be explicitly constructed from character value sets. Among other things, these identities determine representations up to Gassmann equivalency. Some examples of…
Let $S$ be a rational fraction and let $f$ be a polynomial over a finite field. Consider the transform $T(f)=\operatorname{numerator}(f(S))$. In certain cases, the polynomials $f$, $T(f)$, $T(T(f))\dots$ are all irreducible. For instance,…
Identifiability is a desirable property of a statistical model: it implies that the true model parameters may be estimated to any desired precision, given sufficient computational resources and data. We study identifiability in the context…