English
Related papers

Related papers: Canonical form of modular hyperbolas with an appli…

200 papers

We give formulas for the numbers of type II and type IV hyperbolic components in the space of quadratic rational maps, for all fixed periods of attractive cycles.

Dynamical Systems · Mathematics 2014-02-26 Jan Kiwi , Mary Rees

Modular exponentiation is a common mathematical operation in modern cryptography. This, along with modular multiplication at the base and exponent levels (to different moduli) plays an important role in a large number of key agreement…

Symbolic Computation · Computer Science 2010-12-23 Deepak Kapur , Andrew Marshall , Paliath Narendran

In this article we study the combinatorics of congruence subgroups of the modular group. We consider the notion of minimal monomial solutions. These are the solutions of a matrix equation (also appearing in the study of Coxeter friezes),…

Combinatorics · Mathematics 2021-12-21 Flavien Mabilat

We naturally obtain some combinatorial identities finding the difference analogs of hyperbolic and trigonometric functions of order $n.$ In particular, we obtain the identities connected with the proved in the paper the addition formulas…

Combinatorics · Mathematics 2017-07-19 Vladimir Shevelev

We speculate on the distribution of primes in exponentially growing, linear recurrence sequences $(u_n)_{n\geq 0}$ in the integers. By tweaking a heuristic which is successfully used to predict the number of prime values of polynomials, we…

Number Theory · Mathematics 2024-09-10 Jon Grantham , Andrew Granville

We develop a $D-$module approach to various kinds of solutions to several classes of important differential equations by long divisions of different differential operators. The zeros of remainder maps of such long divisions are handled by…

Classical Analysis and ODEs · Mathematics 2021-11-18 Yik Man Chiang , Avery Ching , Chiu Yin Tsang

We give an overview of combinatoric properties of the number of ordered $k$-factorizations $f_k(n,l)$ of an integer, where every factor is greater or equal to $l$. We show that for a large number $k$ of factors, the value of the cumulative…

Combinatorics · Mathematics 2016-10-18 Jacob Sprittulla

The Canonical Polyadic decomposition (CPD) is a convenient and intuitive tool for tensor factorization; however, for higher-order tensors, it often exhibits high computational cost and permutation of tensor entries, these undesirable…

Numerical Analysis · Computer Science 2018-09-05 Anh-Huy Phan , Andrzej Cichocki , Ivan Oseledets , Salman Ahmadi Asl , Giuseppe Calvi , Danilo Mandic

We consider a special class of binomial sums involving harmonic numbers and we prove three identities by using the elementary method of the partial fraction decomposition. Some applications to infinite series and congruences are given.

Combinatorics · Mathematics 2013-12-06 Helmut Prodinger , Roberto Tauraso

We discuss finite difference techniques for hyperbolic equations in non-trivial domains, as those that arise when simulating black hole spacetimes. In particular, we construct dissipative and difference operators that satisfy the {\it…

General Relativity and Quantum Cosmology · Physics 2009-11-10 Gioel Calabrese , Luis Lehner , Oscar Reula , Olivier Sarbach , Manuel Tiglio

Hyperbolic polynomials are real polynomials whose real hypersurfaces are nested ovaloids, the inner most of which is convex. These polynomials appear in many areas of mathematics, including optimization, combinatorics and differential…

Algebraic Geometry · Mathematics 2016-08-16 Mario Kummer , Daniel Plaumann , Cynthia Vinzant

Let $k$ be a natural number and let $c=2.134693\ldots$ be the unique real solution of the equation $2c=2+\log (5c-1)$ in $[1,\infty)$. Then, when $s\ge ck+4$, we establish an asymptotic lower bound of the expected order of magnitude for the…

Number Theory · Mathematics 2022-11-21 Joerg Bruedern , Trevor D. Wooley

We give solutions of a Diophantine equation containing factorials, which can be written as a cubic form, or as a sum of binomial coefficients. We also give some solutions to higher degree forms and relate some solutions to an unsolvable…

Number Theory · Mathematics 2015-10-19 Geoffrey B. Campbell , Aleksander Zujev

We classify the three-dimensional representations of the modular group that are reducible but indecomposable, and their associated spaces of holomorphic vector-valued modular forms. We then demonstrate how such representations may be…

Number Theory · Mathematics 2017-10-17 Luca Candelori , Tucker Hartland , Christopher Marks , Diego Yepez

We apply the quaternionic Jordan form to classify the hypercomplex nilpotent almost abelian Lie algebras in all dimensions and to carry out the complete classification of 12-dimensional hypercomplex almost abelian Lie algebras. Moreover, we…

Differential Geometry · Mathematics 2024-11-04 Adrián Andrada , María Laura Barberis

We consider a large class of matrix problems, which includes the problem of classifying arbitrary systems of linear mappings. For every matrix problem from this class, we construct Belitskii's algorithm for reducing a matrix to a canonical…

Representation Theory · Mathematics 2007-09-18 Vladimir V. Sergeichuk

We use symbolic expressions for traces of positive integer powers of a Hermitian operator (or, equivalently, coefficients of corresponding characteristic polynomial) to find solutions for the problems as follows: Factorization of…

Rings and Algebras · Mathematics 2017-08-16 Ilia Lomidze , Natela Chachava

We obtain an essentially optimal estimate for the moment of order 32/3 of the exponential sum having argument $\alpha x^3+\beta x^2$. Subject to modest local solubility hypotheses, we thereby establish that pairs of diagonal Diophantine…

Number Theory · Mathematics 2023-05-10 Trevor D. Wooley

The powers of generating functions and its properties are analyzed. A new class of functions is introduced, based on the application of compositions of an integer $n$, called composita. The methods for obtaining reciprocal and reverse…

Combinatorics · Mathematics 2012-11-15 Vladimir Kruchinin

An integer is said to be $y$-friable if its greatest prime factor is less than $y$. In this paper, we obtain estimates for exponential sums over $y$-friable numbers up to $x$ which are non-trivial when $y \geq \exp\{c \sqrt{\log x} \log…

Number Theory · Mathematics 2019-08-15 Sary Drappeau
‹ Prev 1 8 9 10 Next ›