English
Related papers

Related papers: Power sum polynomials in a discrete tomography per…

200 papers

Let $\UT_n(q)$ denote the group of unipotent $n\times n$ upper triangular matrices over a field with $q$ elements. The degrees of the complex irreducible characters of $\UT_n(q)$ are precisely the integers $q^e$ with $0\leq e\leq \lfloor…

Representation Theory · Mathematics 2011-09-13 Eric Marberg

The intrinsic presence of ghosts in the symmetric teleparallel framework is elucidated. We illustrate our general arguments in $f(\mathbb{Q})$ theories by studying perturbations in the three inequivalent spatially flat cosmologies. Two of…

General Relativity and Quantum Cosmology · Physics 2024-03-15 Débora Aguiar Gomes , Jose Beltrán Jiménez , Alejandro Jiménez Cano , Tomi S. Koivisto

Let G be a connected unipotent group over a finite field F_q with q elements. In this article we propose a definition of L-packets of complex irreducible representations of the finite group G(F_q) and give an explicit description of…

Representation Theory · Mathematics 2010-11-24 Mitya Boyarchenko

Let $\mathbb F_q$ be the finite field with $q$ elements, where $q$ is a power of a prime. We discuss recursive methods for constructing irreducible polynomials over $\mathbb F_q$ of high degree using rational transformations. In particular,…

Number Theory · Mathematics 2019-05-21 Daniel Panario , Lucas Reis , Qiang Wang

In this paper we construct $q$-Genocchi numbers and polynomials. By using these numbers and polynomials, we investigate the $q$-analogue of alternating sums of powers of consecutive integers due to Euler.

Number Theory · Mathematics 2007-05-23 Taekyun Kim

The main object of this paper is to find closed form expressions for finite and infinite sums that are weighted by $\omega(n)$, where $\omega(n)$ is the number of distinct prime factors of $n$. We then derive general convergence criteria…

History and Overview · Mathematics 2017-02-28 Tanay Wakhare

We continue to explore cyclotomic factors in the descent set polynomial $Q_{n}(t)$, which was introduced by Chebikin, Ehrenborg, Pylyavskyy and Readdy. We obtain large classes of factors of the form $\Phi_{2s}$ or $\Phi_{4s}$ where $s$ is…

Combinatorics · Mathematics 2014-11-04 Richard Ehrenborg , N. Bradley Fox

In terms of the creative microscoping method recently introduced by Guo and Zudilin and the Chinese remainder theorem for coprime polynomials, we establish a $q$-supercongruence with two parameters modulo $[n]\Phi_n(q)^3$. Here…

Combinatorics · Mathematics 2020-09-17 Chuanan Wei

Research on power values of power sums has gained much attention of late, partially due to the explosion of refinements in multiple advanced tools in (computational) Number Theory in recent years. In this survey, we present the key tools…

Number Theory · Mathematics 2023-07-28 Nirvana Coppola , Mar Curcó-Iranzo , Maleeha Khawaja , Vandita Patel , Özge Ülkem

For positive integers $p$ and $q$ let $G:=\textrm{PSO}(p,q)$ be the projective indefinite special-orthogonal group of signature $(p,q)$. We study counting problems in the Riemannian symmetric space $X_G$ of $G$ and in the pseudo-Riemannian…

Group Theory · Mathematics 2019-09-27 León Carvajales

We give two applications of our earlier work "Exponential sums on A^n, II" (math.AG/9909009). We compute the p-adic cohomology of certain exponential sums on A^n involving a polynomial whose homogeneous component of highest degree defines a…

Algebraic Geometry · Mathematics 2007-05-23 Alan Adolphson , Steven Sperber

We present a modification of the Berkovits superparticle. This is firstly in order to covariantly quantize the pure spinor ghosts, and secondly to covariantly calculate matrix elements of a generic operator between two states. We proceed by…

High Energy Physics - Theory · Physics 2010-02-03 Michael Chesterman

Sum of powers 1^p+...+n^p, with n and p being natural numbers and n>=1, can be expressed as a polynomial function of n of degree p+1. Such representations are often called Faulhaber formulae. A simple recursive algorithm for computing…

Discrete Mathematics · Computer Science 2009-03-26 M. Torabi Dashti

One of the generalizations of multiple zeta values is the $q$-version, and in the case of finite sums, they may be expressed explicitly in polynomial form. Several results have been found when the powers of the factors in the denominator…

Number Theory · Mathematics 2025-12-09 Yuri Bilu , Hideaki Ishikawa , Takao Komatsu

In this paper some properties of the irreducible multiplets of representation for the N = (p, q) - extended supersymmetry in one dimension are discussed. Essentially two results are here presented. At first a peculiar property of the one…

High Energy Physics - Theory · Physics 2009-10-31 A. Pashnev , F. Toppan

We study the problem of computing an ensemble of multiple sums where the summands in each sum are indexed by subsets of size $p$ of an $n$-element ground set. More precisely, the task is to compute, for each subset of size $q$ of the ground…

Data Structures and Algorithms · Computer Science 2012-08-03 Petteri Kaski , Mikko Koivisto , Janne H. Korhonen

We consider binomial and inverse binomial sums at infinity and rewrite them in terms of a small set of constants, such as powers of $\pi$ or $\log(2)$. In order to perform these simplifications, we view the series as specializations of…

Number Theory · Mathematics 2015-10-30 Jakob Ablinger

Let $f(q)=a_rq^r+\cdots+a_sq^s$, with $a_r\neq 0$ and $a_s\neq 0$, be a real polynomial. It is a palindromic polynomial of darga $n$ if $r+s=n$ and $a_{r+i}=a_{s-i}$ for all $i$. Polynomials of darga $n$ form a linear subspace…

Combinatorics · Mathematics 2016-01-22 Hua Sun , Yi Wang , Hai-Xia Zhang

In 2008, M. Marshall settled a long-standing open problem by showing that if f(x,y) is a polynomial that is non-negative on the strip [0,1] x R, then there exist sums of squares s(x,y) and t(x,y) such that f(x,y) = s(x,y) + (x - x^2)…

Algebraic Geometry · Mathematics 2010-09-21 Ha Nguyen , Victoria Powers

Linearized polynomials appear in many different contexts, such as rank metric codes, cryptography and linear sets, and the main issue regards the characterization of the number of roots from their coefficients. Results of this type have…

Combinatorics · Mathematics 2020-05-07 Olga Polverino , Ferdinando Zullo
‹ Prev 1 8 9 10 Next ›