Related papers: Jacobi's bound and normal forms computations. A hi…
The focus of this note is to formulate the algorithms and give the examples used by Fibonacci in Liber Abaci to expand any fraction into a sum of unit fractions. The description in Liber Abaci is all verbal and the examples are numbers…
We obtain various versions of classical Lieb--Thirring bounds for one- and multi-dimensional complex Jacobi matrices. Our method is based on Fan-Mirski Lemma and seems to be fairly general.
Let $\mathbb{M}$ be the group of multiplicative characters of a finite field $\mathbb{F}$, and let $\mathbb{J}(\alpha, \beta)$ be the Jacobi sum, for $\alpha, \beta \in \mathbb{M}$. We observe that the function $\mathbb{J} \colon \mathbb{M}…
We present a constructive proof of Jacobi's identity for the sum of two squares. We present a combinatorial proof of the Jacobi Triple Product and combine with a proof of Hirschhorn to define an algorithm. The input is a factorization…
We prove new bounds for the Fourier coefficients of Jacobi forms using a method of Iwaniec. In view of the Fourier-Jacobi expansion of degree two Siegel modular forms, we can use these to obtain strong bounds on fundamental Fourier…
Let ${\bf P}_k^{(\alpha, \beta)} (x)$ be an orthonormal Jacobi polynomial of degree $k.$ We will establish the following inequality \begin{equation*} \max_{x \in [\delta_{-1},\delta_1]}\sqrt{(x- \delta_{-1})(\delta_1-x)}…
This work is in a stream initiated by a paper of Killip and Simon [Ann. of Math. (2003)]. Using methods of Functional Analysis and the classical Szeg\"o Theorem we prove sum rule identities in a very general form. Then, we apply the result…
We give an analogy of Jacobi's formula, which relates the hypergeometric function with parameters $(1/4,1/4,1)$ and theta constants. By using this analogy and twice formulas of theta constants, we obtain a transformation formula for this…
We present a method devised by Jacobi to derive Lagrangians of any second-order differential equation: it consists in finding a Jacobi Last Multiplier. We illustrate the easiness and the power of Jacobi's method by applying it to several…
We apply the methods of classical approximation theory (extreme properties of polynomials) to study the essential support $\Sigma_{ac}$ of the absolutely continuous spectrum of Jacobi matrices. First, we prove an upper bound on the measure…
The two different approaches - K\"{a}llen's and Brandt's methods - for the calculations of the Schwinger terms in the 1+1 dimensional Abelian and non-Abelian free current algebras are discussed. These methods are applied to calculation of…
Recent developments of affine algebraic geometry, especially the theory of open algebraic surfaces, provide means to systematically explore geometric and topological properties of polynomials in two variables. Nevertheless, there is one…
The classical transformation of Jacobi's theta function admits a simple proof by producing an integral representation that yields this invariance apparent. This idea seems to have first appeared in the work of S. Ramanujan. Several examples…
This article gives an introduction for mathematicians interested in numerical computations in algebraic geometry and number theory to some recent progress in algorithmic number theory, emphasising the key role of approximate computations…
Classical Jacobi polynomials $P_{n}^{(\alpha,\beta)}$, with $\alpha, \beta>-1$, have a number of well-known properties, in particular the location of their zeros in the open interval $(-1,1)$. This property is no longer valid for other…
We explore an (unpublished) approach to the famous Jacobian Conjecture by means of identities of algebras, discovered by the brilliant deceased mathematician, Alexander Vladimirovich Yagzhev (1951{2001). This approach also indicates some…
An important invariant of a polynomial $f$ is its Jacobian algebra defined by its partial derivatives. Let $f$ be invariant with respect to the action of a finite group of diagonal symmetries $G$. We axiomatically define an orbifold…
Many problems give rise to polynomial systems. These systems often have several parameters and we are interested to study how the solutions vary when we change the values for the parameters. Using predictor-corrector methods we track the…
Singular equations with rank-deficient Jacobians arise frequently in algebraic computing applications. As shown in case studies in this paper, direct and intuitive modeling of algebraic problems often results in nonisolated singular…
We study the bit complexity of two methods, related to the Euclidean algorithm, for computing cubic and quartic analogs of the Jacobi symbol. The main bottleneck in such procedures is computation of a quotient for long division. We give…