相关论文: $q$-rious and $q$-riouser

The ascent of scaling in artificial intelligence research has revolutionized the field over the past decade, yet it presents significant challenges for academic researchers, particularly in computational social science and critical…

In this article, using only elementary knowledge of complex numbers, we sketch a proof of the celebrated Abel--Ruffini theorem, which states that the general solution to an algebraic equation of degree five or more cannot be written using…

Let $d_k(n)$ denote the $k$-fold divisor function. For a wide range of large $q$ the expected bound $$\sum_{n\leq x\atop {n\equiv a(q)}}d_k(n)-\text { main term }\approx \sqrt {x/q}$$ is shown to be true in an average sense -- for all $k$.…

The following notes are intended to make a small digression on the topics mentioned in the title of the same, since these were not addressed in the past tribute by the Institute of Physics of the UdeA. We believe more than platitude try to…

Over 300 sequences and many unsolved problems and conjectures related to them are presented herein together with theorems corollaries, formulae, examples, mathematical criteria, etc. (about integer sequences, numbers, quotients, residues,…

The conjecture of Masser-Oesterl\'e, popularly known as $abc$-conjecture have many consequences. We use an explicit version due to Baker to solve a number of conjectures.

This is a survey of the use of Fourier analysis in additive combinatorics, with a particular focus on situations where it cannot be straightforwardly applied, but needs to be generalized first. Sometimes very satisfactory generalizations…

Jacobi is one of the most famous mathematicians of his century. His name is attached to many results in various fields of mathematics and his complete works in seven volumes have been available since the end of the XIXth century and are…

The black hole information problem has been a challenge since Hawking's original 1975 paper. It led to the discovery of AdS/CFT, which gave a partial resolution of the paradox. However, recent developments, in particular the firewall…

The AAA algorithm, introduced in 2018, computes best or near-best rational approximations to functions or data on subsets of the real line or the complex plane. It is much faster and more robust than previous algorithms for such problems…

In 1942 Haskell B.Curry presented what is now called Curry paradox which can be found in a logic independently of its stand on negation.In recent years there has been a revitalised interest in non-classical solutions to the semantic…

The first author introduced a sequence of polynomials (\cite{8}, sequence A174531) defined recursively. One of the main results of this study is proof of the integrality of its coefficients.

Eugene Wigner famously argued for the "unreasonable effectiveness of mathematics" for describing physics and other natural sciences in his 1960 essay. That essay has now led to some 55 years of (sometimes anguished) soul searching ---…

Humor is an important social phenomenon, serving complex social and psychological functions. However, despite being studied for millennia humor is computationally not well understood, often considered an AI-complete problem. In this work,…

We collect here various conjectures on congruences made by the author in a series of papers, some of which involve binary quadratic forms and other advanced theories. Part A consists of 100 unsolved conjectures of the author while…

Ramsey Theorem [6] for pairs is intuitionistically but not classically provable: it is equivalent to a subclassical principle [2]. In this note we show that Ramsey may be restated in an intuitionistically provable form, which is informative…

Let $X= \mathbb{P}^1 \setminus \{0,1,\infty\}$, and let $S$ denote a finite set of prime numbers. In an article of 2005, Minhyong Kim gave a new proof of Siegel's theorem for $X$: the set $X(\mathbb{Z}[S^{-1}])$ of $S$-integral points of…

As a homage to A K Raychaudhuri, I derive in a straightforward way his famous equation and also indicate the problems he was last engaged in.

The main point of this paper is to present a class of equations over integers that one can check if they have a solution by checking a set of inequalities. The prototype of such equations is the equations appearing in the well-known…

In 1967, Schmidt wrote a seminal paper [10] on heights of subspaces of R n or C n defined over a number field K, and diophantine approximation problems. The going-down Theorem -- one of the main theorems he proved in his paper -- remains…