Related papers: Small primitive roots and malleability of RSA modu…

This paper approaches, using structural complexity theory, the question of whether there is a chasm between knowing an object exists and getting one's hands on the object or its properties. In particular, we study the nontransparency of…

Let $A$ be a quasi-hereditary algebra. We prove that in many cases, a tilting module is rigid (i.e. has identical radical and socle series) if it does not have certain subquotients whose composition factors extend more than one layer in the…

In this work, we consider the almost-sure termination problem for probabilistic programs that asks whether a given probabilistic program terminates with probability 1. Scalable approaches for program analysis often rely on modularity as…

In this study, all rings are commutative with non-zero identity and all modules are considered to be unital. Let $M$ be a left $R$-module. A proper submodule $N$ of $M$ is called an $S$-$weakly$ $prime$ submodule if $0_{M}\neq f(m)\in N$…

Formal explainability guarantees the rigor of computed explanations, and so it is paramount in domains where rigor is critical, including those deemed high-risk. Unfortunately, since its inception formal explainability has been hampered by…

We recently formulated important Modular Bourgain-Tzafriri Restricted Invertibility Conjectures and Modular Johnson-Lindenstrauss Flattening Conjecture in the Appendix of \textit{[arXiv: 2207.12799.v1]}. For the sake of wide accessibility…

We present four combinatorial proofs of Morgado's formula for the number $\varrho(n)$ of non-congruent regular integers modulo $n$, corresponding to sequence A055653 in the On-Line Encyclopedia of Integer Sequences (OEIS), where an integer…

Numerous modern optimization and machine learning algorithms rely on subgradient information being trustworthy and hence, they may fail to converge when such information is corrupted. In this paper, we consider the setting where subgradient…

We explore the connection between the factorisation of virtual corrections to multi-particle massless gauge theory amplitudes and the problem of subtraction at NNLO and beyond. Taking inspiration from virtual factorisation, we provide a set…

We describe a straightforward construction of the pseudo-split absolutely pseudo-simple groups of minimal type with irreducible root systems of type $BC_n$; these exist only in characteristic $2$. We also give a formula for the dimensions…

Let $a > 1$. Then $a^n < n!$ for some positive integer $n$. We show that the smallest such $n$ is one of a pair of possibilities, or is one possibility, which we show how to calculate. There are three interesting numerical sequences which…

It was proved in [3] that every h-divisible modules admits an strongly flat cover over all integral domains; and every divisible module over an integral domain R admits a strongly flat cover if and only if R is a Matlis domain. In this…

Let n be a positive integer, and let R be a finitely presented (but not necessarily finite dimensional) associative algebra over a computable field. We examine algorithmic tests for deciding (1) if every n-dimensional representation of R is…

Recent work have demonstrated that robustness (to "corruption") can be at odds with generalization. Adversarial training, for instance, aims to reduce the problematic susceptibility of modern neural networks to small data perturbations.…

This work investigates the algorithmic complexity of non-classical logics, focusing on superintuitionistic and modal systems. It is shown that propositional logics are usually polynomial-time reducible to their fragments with at most two…

A factorization of a permutation into transpositions is called "primitive" if its factors are weakly ordered. We discuss the problem of enumerating primitive factorizations of permutations, and its place in the hierarchy of previously…

We introduce and study several notions of computability-theoretic reducibility between subsets of $\omega$ that are "robust" in the sense that if only partial information is available about the oracle, then partial information can be…

This paper partly settles a conjecture of Costa on (n,d)-rings, i.e., rings in which n-presented modules have projective dimension at most d. For this purpose, a theorem studies the transfer of the (n,d)-property to trivial extensions of…

We present a special-purpose algorithm for factoring semiprimes $N = pq$ in which one prime factor satisfies $p \approx c\,(a/b)^n$ for positive integers $a, b, c, n$ with $a > b$ and $\gcd(a,b) = 1$. Given the correct parameters $(a, b)$,…

We investigate whether every computable member of a given class of structures admits a fully primitive recursive (also known as punctual) or fully P-TIME copy. A class with this property is referred to as punctually robust or P-TIME robust,…