English
Related papers

Related papers: A Generalization of Fueter's Theorem in Dunkl-Clif…

200 papers

We quantize a generalized electromagnetism in 2 + 1 dimensions which contains a higher-order derivative term by using Dirac's method. By introducing auxiliary fields we transform the original theory in a lower-order derivative one which can…

High Energy Physics - Theory · Physics 2007-05-23 A. de Souza Dutra , Marcelo Hott

It is pointed out that, for the fractional Fokker-Planck equation for subdiffusion proposed by Metzler, Barkai, and Klafter [Phys. Rev. Lett. 82 (1999) 3563], there are four types of infinitely many exact solutions associated with the newly…

Statistical Mechanics · Physics 2020-04-29 C. -L. Ho

New and old results on closed polynomials, i.e., such polynomials f in K[x_1,...,x_n] that the subalgebra K[f] is integrally closed in K[x_1,...,x_n], are collected. Using some properties of closed polynomials we prove the following…

Commutative Algebra · Mathematics 2009-08-22 Ivan V. Arzhantsev , Anatoliy P. Petravchuk

This is the revised version of the second paper in a series introducing a generalized Fredholm theory in a new class of smooth spaces called polyfolds. The theory will be illustrated in upcoming papers by applications to Floer Theory,…

Functional Analysis · Mathematics 2008-04-15 Helmut Hofer , Kris Wysocki , Eduard Zehnder

Functional iterations such as Newton's are a popular tool for polynomial root-finding. We consider realistic situation where some (e.g., better-conditioned) roots have already been approximated and where further computations is directed to…

Numerical Analysis · Mathematics 2019-07-09 Remi Imbach , Victor Y. Pan , Chee Yap , Ilias S. Kotsireas , Vitaly Zaderman

In this paper, we obtain several new factorization results for certain classes of polynomials having integer coefficients. In doing so, we use the information about prime factorization of the value taken up by such polynomials and their…

Number Theory · Mathematics 2025-12-24 Rishu Garg , Jitender Singh

We introduce a new generalization of Euler's $\varphi$-function associated with a system of polynomials of several variables. We reprove by a short direct approach certain known related identities, and study some other special cases that do…

Number Theory · Mathematics 2025-08-27 Norbert Csizmazia , László Tóth

The paper contains a combinatorial theorem (the sequence of Newton polygons of a reccurent sequence of polynomials is quasi-linear) and two applications of it in classical and quantum topology, namely in the behavior of the $A$-polynomial…

Geometric Topology · Mathematics 2012-10-26 Stavros Garoufalidis

Our approach to higher order Fourier analysis is to study the ultra product of finite (or compact) Abelian groups on which a new algebraic theory appears. This theory has consequences on finite (or compact) groups usually in the form of…

Combinatorics · Mathematics 2009-11-09 Balazs Szegedy

In this paper we prove several inequalities by means of diagrammatic expansions, a technique already used in [BG13]. This time we show that iterations of the folding of a probability leads to the proof of some in- equalities by means of a…

Probability · Mathematics 2018-01-03 Alberto Gandolfi

We extend results of Boros and Menzer on the alternative equation $f(x)f(y)=0$ for generalized polynomials $f$, and their theorems on the conditional inequality $f(x)f(y)\ge 0$ for generalized monomials $f$ of even degree. We use similar…

Classical Analysis and ODEs · Mathematics 2026-03-27 Marek Balcerzak , Michał Popławski

In the present paper, we prove for the Dunkl transform which generalizes the Fourier transform, weighted inequalities when the weights belong to the well known class Bp. As application, we obtain for power weights Pitt's inequality.

Functional Analysis · Mathematics 2015-05-19 Chokri Abdelkefi , Mongi Rachdi

We introduce a generalization $\pounds_{d}^{(\alpha)}(X)$ of the finite polylogarithms $\pounds_{d}^{(0)}(X)=\pounds_d(X)=\sum_{k=1}^{p-1}X^k/k^d$, in characteristic $p$, which depends on a parameter $\alpha$. The special case…

Number Theory · Mathematics 2023-02-21 Marina Avitabile , Sandro Mattarei

The Cholesky factorization of the moment matrix is considered for the generalized Charlier, generalized Meixner, and Gauss hypergeometric discrete orthogonal polynomials. For the generalized Charlier, we present an alternative derivation of…

Classical Analysis and ODEs · Mathematics 2023-07-14 Itsaso Fernández-Irisarri , Manuel Mañas

In this work we define operator-valued Fourier transforms for suitable integrable elements with respect to the Plancherel weight of a (not necessarily Abelian) locally compact group. Our main result is a generalized version of the Fourier…

Functional Analysis · Mathematics 2009-03-26 Alcides Buss

Let $k \geq 2$, $q$ be an odd prime power, and $F \in \mathbb{F}_q[x_1, \ldots, x_k]$ be a polynomial. An $F$-Diophantine set over a finite field $\mathbb{F}_q$ is a set $A \subset \mathbb{F}_q^*$ such that $F(a_1, a_2, \ldots, a_k)$ is a…

Number Theory · Mathematics 2025-05-09 Chi Hoi Yip , Semin Yoo

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

An alternative treatment is proposed for the calculations carried out within the frame of Nikiforov-Uvarov method, which removes a drawback in the original theory and by pass some difficulties in solving the Schrodinger equation. The…

Quantum Physics · Physics 2007-05-23 B. Gonul , K. Koksal

In this paper, we prove a new generalized Mikhlin multiplier theorem whose conditions are given with respect to fractional derivatives in integral forms with two different integration intervals. We also discuss the connection between…

Probability · Mathematics 2018-06-27 Deniz Karli

We propose and rigorously analyze two randomized algorithms to factor univariate polynomials over finite fields using rank $2$ Drinfeld modules. The first algorithm estimates the degree of an irreducible factor of a polynomial from…

Computational Complexity · Computer Science 2016-07-12 Anand Kumar Narayanan