相关论文: Is it possible to compute the Moebius function wit…

Changes of variables giving the dual model are constructed explicitly for sigma-models without isotropy. In particular, the jacobian is calculated to give the known results. The global aspects of the abelian case as well as some of those of…

Collatz Conjecture is one of the most famous, for its simple form, proposed more than eighty years ago. This paper presents a full attempt to prove the affirmative answer to the question proposed by the conjecture. In the first section, we…

For a phenomenon $\boldsymbol{f}$ that is a function of $n$ factors, defined on a finite abelian group $G$, we derive its population statistics solely from its Fourier transform $\hat{\boldsymbol{f}}$. Our main result is an…

Conjecturing formulas and other symbolic relations occurs frequently in number theory and combinatorics. If we could automate conjecturing, we could benefit not only from speeding up, but also from finding conjectures previously out of our…

Given a subset of $\mathbb C$ containing $x,y$, one can add $x + y,\,x - y,\,xy$ or (when $y\ne0$) $x/y$ or any $z$ such that $z^2=x$. Let $p$ be a prime Fermat number. We prove that it is possible to obtain from $\{1\}$ a set containing…

In this note we prove positivity of Maclaurin coefficients of polynomials written in terms of rising factorials and arbitrary log-concave sequences. These polynomials arise naturally when studying log-concavity of rising factorial series.…

This note is about using computational effects for scalability. With this method, the specification gets more and more complex while its semantics gets more and more correct. We show, from two fundamental examples, that it is possible to…

Based on Stokes' theorem we derive a non-holomorphic functional calculus for matrices, assuming sufficient smoothness near eigenvalues, corresponding to the size of related Jordan blocks. It is then applied to the complex conjugation…

In this paper, the formal derivative operator defined with respect to context-free grammars is used to prove some properties about binomial coefficients and multifactorial numbers. In addition, we extend the formal derivative operator to…

We give a short proof of "Pellet's Formula" for the M\"{o}bius Function on $\mathbb{F}_q[T]$, deriving an intermediate formula (which we call "Proto-Pellet's Formula") along the way. We then construct and prove an analogous "Proto-Pellet's…

We describe an algorithm for the factorization of non-commutative polynomials over a field. The first sketch of this algorithm appeared in an unpublished manuscript (literally hand written notes) by James H. Davenport more than 20 years…

The product of any number of Legendre functions, under a restricted domain, can be expanded by the corresponding Legendre polynomials, with the coefficient being the sinc function. While an analogous expansion can be made for any number of…

In this paper, we show how a construction of an implicit complexity model can be implemented using concepts coming from the core of von Neumann algebras. Namely, our aim is to gain an understanding of classical computation in terms of the…

The Mertens function is defined as $M(x) = \sum_{n \leq x} \mu(n)$, where $\mu(n)$ is the M\"obius function. The Mertens conjecture states $|M(x)/\sqrt{x}| < 1$ for $x > 1$, which was proven false in 1985 by showing $\liminf M(x)/\sqrt{x} <…

For a transcendental entire function, a partial affirmative answer to Baker's question on the boundedness of its Fatou components is given. In addition, we have addressed Wang's question on Fej\'er gaps. Certain results about functions with…

Let $A$ be a finite-dimensional algebra over an algebraically closed field $\Bbbk$. For any finite-dimensional $A$-module $M$ we give a general formula that computes the indecomposable decomposition of $M$ without decomposing it, for which…

In this article, using generalized derivations, we obtain a simple idea to prove the non-commutative Newton binomial formula in unital algebras and then, we extend that formula to non-unital algebras. Additionally, we establish the…

We prove that all Mathieu groups, some linear, and unitary groups are factorizable.

The Frobenius Coin Problem is a classic question in mathematics: given coins of specified denominations, what is the largest amount that cannot be formed using only those coins? This brief work covers a variation of such question, posing a…

It is a classical problem to compute a minimal set of invariant polynomial generating the invariant ring of a finite group as an algebra. We present here an algorithm for the computation of minimal generating sets in the non-modular case.…