English
Related papers

Related papers: Simerka - Quadratic Forms and Factorization

200 papers

G.L. Watson \cite{watson1, watson2} introduced a set of transformations, called Watson transformations by most recent authors, in his study of the arithmetic of integral quadratic forms. These transformations change an integral quadratic…

Number Theory · Mathematics 2013-04-23 Wai Kiu Chan , Byeong-Kweon Oh

A formula for the number of monic irreducible self-reciprocal polynomials, of a given degree over a finite field, was given by Carlitz in 1967. In 2011 Ahmadi showed that Carlitz's formula extends, essentially without change, to a count of…

Number Theory · Mathematics 2023-02-21 Sandro Mattarei , Marco Pizzato

The scalar difference equation $x_{n+1}=f_{n}(x_{n},x_{n-1},...,x_{n-k})$ may exhibit symmetries in its form that allow for reduction of order through substitution or a change of variables. Such form symmetries can be defined generally…

Dynamical Systems · Mathematics 2008-05-28 H. Sedaghat

We study and compare two factorisation systems for surjective homomorphisms in the category of quandles. The first one is induced by the adjunction between quandles and trivial quandles, and a precise description of the two classes of…

Category Theory · Mathematics 2014-12-31 Valérian Even , Marino Gran

Motivated by a question in Schubert calculus, we study the interplay of quasisymmetric polynomials with the divided symmetrization operator, which was introduced by Postnikov in the context of volume polynomials of permutahedra. Divided…

Combinatorics · Mathematics 2020-05-05 Philippe Nadeau , Vasu Tewari

We offer multiplication method for factoring big natural numbers which extends the group of the Fermat's and Lehman's factorization algorithms and has run-time complexity $O(n^{1/3})$. This paper is argued the finiteness of proposed…

Data Structures and Algorithms · Computer Science 2019-04-01 Igor Nesiolovskiy , Artem Nesiolovskiy

The present paper formulates and solves a problem of dividing coins. The basic form of the problem seeks the set of the possible ways of dividing coins of face values 1,2,4,8,... between three people. We show that this set possesses a…

Combinatorics · Mathematics 2014-06-17 Ken Yamamoto

The $(-1)$-Jacobi, Bannai-Ito, and $(-1)$-Meixner-Pollaczek polynomials are studied in [Trans. Amer. Math. Soc. 364 (2012), 5491-5507], [Adv. Math. 229 (2012), 2123-2158], and [Stud. Appl. Math. 153 (2024), e12728], respectively, through…

Classical Analysis and ODEs · Mathematics 2026-05-29 K. Castillo , G. Gordillo-Núñez

We present a proof of a conjecture of Goh and Wildberger on the factorization of the spread polynomials. We indicate how the factors can be effectively calculated and exhibit a connection to the factorization of Fibonacci numbers into…

Number Theory · Mathematics 2024-12-30 Johann Cigler , Hans-Christian Herbig

Let there be given a probability measure $\mu$ on the unit circle $\TT$ of the complex plane and consider the inner product induced by $\mu$. In this paper we consider the problem of orthogonalizing a sequence of monomials $\{z^{r_k}\}_k$,…

Classical Analysis and ODEs · Mathematics 2012-12-07 Ruyman Cruz Barroso , Steven Delvaux

We give a new characterization of the set $\mathcal{C}$ of Carmichael numbers in the context of $p$-adic theory, independently of the classical results of Korselt and Carmichael. The characterization originates from a surprising link to the…

Number Theory · Mathematics 2024-06-26 Bernd C. Kellner , Jonathan Sondow

The sieved Jacobi polynomials have been introduced by Askey. These can be obtained from conveniently taking $q$ to be a root of unity in the Askey-Wilson polynomials. The question of determining if they are eigenfunctions of some operator…

Classical Analysis and ODEs · Mathematics 2025-07-08 Luc Vinet , Alexei Zhedanov

Let $f$ be a monic quadratic polynomial over a finite field of odd characteristic. In 2012, Boston and Jones constructed a Markov process based on the post-critical orbit of $f$, and conjectured that its limiting distribution explains the…

Number Theory · Mathematics 2023-10-16 Vefa Goksel

The N distinct prime numbers that make up a composite number M allow $2^{N-1}$ bi partioning into two relatively prime factors. Each such pair defines a pair of conjugate representations. These pairs of conjugate representations, each of…

Quantum Physics · Physics 2007-05-23 M. Revzen , A. Mann , J. Zak

This paper addresses an investigation on a factorization method for difference equations. It is proved that some classes of second order linear difference operators, acting in Hilbert spaces, can be factorized using a pair of mutually…

Mathematical Physics · Physics 2017-09-25 Alina Dobrogowska , Mahouton Norbert Hounkonnou

We classify the pairs of polynomials $f,g$ over a field $K$, such that $f(X)-g(Y)$ has a factor of total degree at most 2. This was done by Y. Bilu for characteristic 0 fields $K$. As his method does not work in positive characteristic, we…

Number Theory · Mathematics 2019-07-30 Manisha Kulkarni , Peter Müller , B. Sury

Ikeda-Mihalcea-Naruse's double Schubert polynomials represent the equivariant cohomology classes of Schubert varieties in the type C flag varieties. The goal of this paper is to obtain a new tableau formula of these polynomials associated…

Combinatorics · Mathematics 2019-09-02 Tomoo Matsumura

In this paper we give an additive representation of the factorial, which can be proven by a simple quick analytical argument. We also present some generalizations, which are linked, on the one hand to an arithmetical theorem proven by Euler…

History and Overview · Mathematics 2007-05-23 Roberto Anglani , Margherita Barile

The centre of the symmetric group algebra $\mathbb{C}[\mathfrak{S}_n]$ has been used successfully for studying important problems in enumerative combinatorics. These include maps in orientable surfaces and ramified covers of the sphere by…

Combinatorics · Mathematics 2011-08-23 David M. Jackson , Craig A. Sloss

We give a modern computational introduction to the S,K combinators invented by Moses Sch\"onfinkel in 1920, and present a variety of new results and ideas about combinators. We explore the spectrum of behavior obtained with small combinator…

Logic in Computer Science · Computer Science 2021-03-25 Stephen Wolfram
‹ Prev 1 4 5 6 7 8 10 Next ›