English
Related papers

Related papers: A new Rational Generating Function for the Frobeni…

200 papers

We introduce a notion of $q$-deformed rational numbers and $q$-deformed continued fractions. A $q$-deformed rational is encoded by a triangulation of a polygon and can be computed recursively. The recursive formula is analogous to the…

Combinatorics · Mathematics 2020-03-11 Sophie Morier-Genoud , Valentin Ovsienko

This work concerns generators for the bounded derived category of coherent sheaves over a noetherian scheme $X$ of prime characteristic. The main result is that when the Frobenius map on $X$ is finite, for any compact generator $G$ of…

Algebraic Geometry · Mathematics 2026-01-28 Matthew R. Ballard , Srikanth B. Iyengar , Pat Lank , Alapan Mukhopadhyay , Josh Pollitz

By using definition of Golden derivative, corresponding Golden exponential function and Fibonomial coefficients, we introduce generating functions for Bernoulli-Fibonacci polynomials and related numbers. Properties of these polynomials and…

Combinatorics · Mathematics 2020-10-29 Oktay K. Pashaev , Merve Ozvatan

In the quantum theory, using the notion of partial supersymmetry, in which some, but not all, operators have superpartners we derive the Euler theorem in partition theory. The paraferminic partition function gives another identity in…

High Energy Physics - Theory · Physics 2007-05-23 Noureddine Chair

The generating function and an explicit expression is derived for the (colored) Motzkin numbers of higher rank introduced recently. Considering the special case of rank one yields the corresponding results for the conventional colored…

Combinatorics · Mathematics 2007-10-06 Toufik Mansour , Matthias Schork , Yidong Sun

The main aim of this paper is to provide a unified approach to deriving identities for the Bernstein polynomials using a novel generating function. We derive various functional equations and differential equations using this generating…

Classical Analysis and ODEs · Mathematics 2018-11-19 Yilmaz Simsek

The famous linear diophantine problem of Frobenius is the problem to determine the largest integer (Frobenius number) whose number of representations in terms of $a_1,\dots,a_k$ is at most zero, that is not representable. In other words,…

Number Theory · Mathematics 2022-07-20 Takao Komatsu

This work investigates the Frobenius morphism on derived categories associated with algebraic stacks in positive characteristic. Particularly, we show that in many cases sufficiently many Frobenius pushforwards of a compact generator…

Algebraic Geometry · Mathematics 2025-12-19 Pat Lank , Fei Peng

Let $\mathbb{F}_q$ be the finite field of $q$ elements, for a given subset $D\subset \mathbb{F}_q$, $m\in \mathbb{N}$, an integer $k\leq |D|$ and $\boldsymbol{b}\in \mathbb{F}_q^m$ we are interested in determining the existence of a subset…

Number Theory · Mathematics 2024-01-17 Juan Francisco Gottig , Mariana Pérez , Melina Privitelli

Given n polynomials in n variables with a finite number of complex roots, for any of their roots there is a local residue operator assigning a complex number to any polynomial. This is an algebraic, but generally not rational, function of…

alg-geom · Mathematics 2015-06-30 Eduardo Cattani , Alicia Dickenstein , Bernd Sturmfels

We introduce a general class of generating functionals for the calculation of quantum-mechanical expectation values of arbitrary functionals of fluctuating paths with fixed end points in configuration or momentum space. The generating…

Quantum Physics · Physics 2009-10-31 Hagen Kleinert , Axel Pelster , Michael Bachmann

We prove a new formula for the generating function of polynomials counting absolutely stable representations of quivers over finite fields. The case of irreducible representations is studied in more detail.

Representation Theory · Mathematics 2007-08-10 Sergey Mozgovoy , Markus Reineke

This paper resolves an open problem raised by Ekhad and Zeilberger for computing $\omega(10000)$, which is related to Stern's triangle. While $\nu(n)$, defined as the sum of squared coefficients in $\prod_{i=0}^{n-1} (1 + x^{2^i} +…

Combinatorics · Mathematics 2025-06-17 Jinlong Tang , Guoce Xin

In the recent paper arXiv:0710.4085 was shown that any solution of "the polynomial moment problem", which asks to describe polynomials Q orthogonal to all powers of a given polynomial P on a segment, may be obtained as a sum of some…

Dynamical Systems · Mathematics 2010-06-28 F. Pakovich

Given a semigroup $S$ generated by its squares, we determine the complex-valued solutions of the following system of cosine-sine functional equations \begin{align*} f(xy)=f(x)g_{1}(y)+g_{1}(x)f(y)+\lambda_{1}^{2}\,h(x)h(y),\; x,y\in S,\\…

Functional Analysis · Mathematics 2022-09-21 Omar Ajebbar , Elhoucien Elqorachi

In this work we define a unified generating functions for 9 different kinds of set partitions including cyclically ordered set partitions. Such generating function depends on 4 parameters. We consider property of this function and provide…

Combinatorics · Mathematics 2022-08-29 Orli Herscovici

Let G be a graph. The black-white polynomial W_G(t) enumerates colorings of the vertices of G with two colors (black and white), where the power of t keeps track of how many white vertices have an even number of black neighbors. Such…

Combinatorics · Mathematics 2026-04-14 Kenneth Goodenough , Paul E. Gunnells

In [Frobenius1896] it was shown that many important properties of a finite group could be examined using formulas involving the character ratios of group elements, i.e., the trace of the element acting in a given irreducible representation,…

Representation Theory · Mathematics 2021-07-07 Shamgar Gurevich , Roger Howe

In this note we investigate mixed partitions with extra condition on the sizes of the blocks. We give a general formula and the generating function. We consider in more details a special case, determining the generating functions, some…

Combinatorics · Mathematics 2018-12-10 Somaya Barati , Beáta Bényi , Abbas Jafarzadeh , Daniel Yaqubi

Linear reversible circuits represent a subclass of reversible circuits with many applications in quantum computing. These circuits can be efficiently simulated by classical computers and their size is polynomially bounded by the number of…