Related papers: On Cobweb Admissible Sequences - The Production Th…

The present article is a review of recent developments concerning the notion of F{\o}lner sequences both in operator theory and operator algebras. We also give a new direct proof that any essentially normal operator has an increasing…

A sequence $s_1,s_2,\ldots, s_k$ of elements of a group $G$ is called a valid ordering if the partial products $s_1, s_1 s_2, \ldots, s_1\cdots s_k$ are all distinct. A long-standing problem in combinatorial group theory asks whether, for a…

Synthesis for a type $\tau$ of Petri nets is the following search problem: For a transition system $A$, find a Petri net $N$ of type $\tau$ whose state graph is isomorphic to $A$, if there is one. To determine the computational complexity…

We present a method to prove the decidability of provability in several well-known inference systems. This method generalizes both cut-elimination and the construction of an automaton recognizing the provable propositions.

It is known that there are infinitely-many prime numbers which take the form of a polynomial of degree one with integer coefficients, this is Dirichlet's theorem. We use an elementary sieving argument together with bounds on the prime…

We develop the foundations of a general framework for producing optimal upper and lower bounds on the sum $\sum_p a_p$ over primes $p$, where $(a_n)_{x/2<n\le x}$ is an arbitrary non-negative sequence satisfying Type I and Type II…

In this paper we develop a method to transfer density results for primitive automatic sequences to logarithmic-density results for general automatic sequences. As an application we show that the logarithmic densities of any automatic…

In this paper; we prove that all sequences can be broken up in cycles. Each cycle follows the same pattern: 1) Upward trajectory. Odd and even numbers alternate until the cycle reaches an upper bound 2) Downward trajectory. Two or more…

By the Telescope Conjecture for Module Categories, we mean the following claim: "Let R be any ring and (A, B) be a hereditary cotorsion pair in Mod-R with A and B closed under direct limits. Then (A, B) is of finite type." We prove a…

Even though Zaremba's conjecture remains open, Bourgain and Kontorovich solved the problem for a full density subset. Nevertheless, there are only a handful of explicit sequences known to satisfy the strong version of the conjecture, all of…

Let $m$ be a positive integer larger than $1$, let $w$ be a finite word over $\left\{0,1,...,m-1\right\}$ and let $a_{m;w}(n)$ be the number of occurrences of the word $w$ in the $m$-expansion of $n$ mod $p$ for any non-negative integer…

We show that the common theory of all modules over a tubular algebra (over a recursive algebraically closed field) is decidable. This result supports a long standing conjecture of Mike Prest which says that a finite-dimensional algebra…

To determine whether a number is congruent or not is an old and difficult topic and progress is slow. The paper presents a new theorem when a prime number is a congruent number or not. The proof is not necessarily any simpler or shorter…

This paper proves a new general K-network constrained energy reliability global factorization theorem. As in the unconstrained case, beside its theoretical mathematical importance the theorem shows how to do parallel processing in exact…

One of the phenomena peculiar in the theory of $p$-adic differential equations is that solutions $f$ of $p$-adic differential equations defined on open discs may satisfy growth conditions at the boundaries. This phenomenon is first studied…

In this paper we study the behavior of the first Zassenhaus conjecture (ZC1) under direct products as well as the General Bovdi Problem (Gen-BP) which turns out to be a slightly weaker variant of (ZC1). Among others we prove that (Gen-BP)…

The Collatz conjecture, which posits that any positive integer will eventually reach 1 through a specific iterative process, is a classic unsolved problem in mathematics. This research focuses on designing an efficient algorithm to compute…

We introduce Fermi Sets, a universal and physically interpretable neural architecture for fermionic many-body wavefunctions. Building on a ``parity-graded'' representation [1], we prove that any continuous fermionic wavefunction on a…

We complete the proof of a theorem we announced and partly proved in [Math. Nachr. 271 (2004), 69-90, math.AG/0111299]. The theorem concerns a family of curves on a family of surfaces. It has two parts. The first was proved in that paper.…

Let \(d_k(p)\) denote the natural density of positive integers whose \(k\)-th smallest prime divisor is \(p\). Erd\H{o}s asked whether, for each fixed \(k\), the sequence \(p\mapsto d_k(p)\) is unimodal as \(p\) ranges over the primes.…