English
Related papers

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

200 papers

The aim of this sequence of work is to investigate polynomial equations satisfied by additive functions. As a result of this, new characterization theorems for homomorphisms and derivations can be given. More exactly, in this paper the…

Classical Analysis and ODEs · Mathematics 2023-08-31 Eszter Gselmann , Gergely Kiss

We present a simple, natural #P-complete problem. Let G be a directed graph, and let k be a positive integer. We define q(G;k) as follows. At each vertex v, we place a k-dimensional complex vector x_v. We take the product, over all edges…

Computational Complexity · Computer Science 2010-01-15 Cristopher Moore , Alexander Russell

Let $G$ be a split connected reductive group over $\mathbb{F}_q$ and let $\mathbb{P}^1$ be the projective line over $\mathbb{F}_q$. Firstly, we give an explicit formula for the number of $\mathbb{F}_{q}$-rational points of generalized…

Algebraic Geometry · Mathematics 2025-04-24 Rahul Singh

The radical solution of polynomials with rational coefficients is a famous solved problem. This paper found that it is a $\mathbb{NP}$ problem. Furthermore, this paper found that arbitrary $ \mathscr{P} \in \mathbb{P}$ shall have a one-way…

Computational Complexity · Computer Science 2024-05-28 Bojin Zheng , Weiwu Wang

A Grobner basis-based algorithm for solving the Frobenius Instance Problem is presented, and this leads to an algorithm for solving the Frobenius Problem that can handle numbers with thousands of digits. Connections to irreducible…

Combinatorics · Mathematics 2009-03-03 Bjarke Hammersholt Roune

We take a fresh look at the classical problem of runs in a sequence of i.i.d.\ coin tosses and derive a general identity/recursion which can be used to compute (joint) distributions of functionals of run types. This generalizes and unifies…

Probability · Mathematics 2014-07-28 Lars Holst , Takis Konstantopoulos

Let $a,b$ be positive, relatively prime, integers. Our goal is to characterize, in an elementary way, all positive integers $c$ that can be expressed as a linear combination of $a,b$ with non-negative integer coefficients and discuss the…

History and Overview · Mathematics 2023-08-09 Giorgos Kapetanakis , Ioannis Rizos

We prove a chain rule for the Goodwillie calculus of functors from spectra to spectra. We show that the (higher) derivatives of a composite functor $FG$ at a base object $X$ are given by taking the composition product (in the sense of…

Algebraic Topology · Mathematics 2008-03-23 Michael Ching

We define an overpartition analogue of Gaussian polynomials (also known as $q$-binomial coefficients) as a generating function for the number of overpartitions fitting inside the $M \times N$ rectangle. We call these new polynomials over…

Combinatorics · Mathematics 2014-12-30 Jehanne Dousse , Byungchan Kim

Let G be a connected, semisimple Lie group with finite center and let K be a maximal compact subgroup. We investigate a method to compute multiplicities of K-types in the discrete series using a rational expression for a generating function…

Representation Theory · Mathematics 2007-05-23 Jeb F. Willenbring , Gregg J. Zuckerman

In 1993 Delest and F\'edou showed that a generating function for connected skew shapes is given as a ratio $J_{\nu+1}/J_{\nu}$ of the Hahn--Exton $q$-Bessel functions when a parameter $\nu$ is zero. They conjectured that when $\nu$ is a…

Combinatorics · Mathematics 2021-05-25 Jang Soo Kim , Dennis Stanton

QCD equations for generating functionals are solved at coinciding momenta of particles. As a result, the relations for $q$-particle correlation functions at equal momenta are obtained. They are directly connected to previously derived…

High Energy Physics - Phenomenology · Physics 2016-09-01 I. M. DREMIN

In this paper new algorithm for calculating power indices is described. The complexity class of the problem is #P-complete and even calculating power index of the biggest player is NP-hard task. Constructed algorithm is a mix of ideas of…

Computer Science and Game Theory · Computer Science 2011-01-25 Bartosz Meglicki

Up-down permutations are counted by tangent resp. secant numbers. Considering words instead, where the letters are produced by independent geometric distributions, there are several ways of introducing this concept; in the limit they all…

Combinatorics · Mathematics 2007-05-23 Helmut Prodinger

Let $k$ and $n$ be positive integers. Let $c\phi_{k}(n)$ denote the number of $k$-colored generalized Frobenius partitions of $n$ and $\mathrm{C}\Phi_k(q)$ be the generating function of $c\phi_{k}(n)$. In this article, we study…

Number Theory · Mathematics 2021-06-02 Heng Huat Chan , Liuquan Wang , Yifan Yang

We consider heuristic algorithm for solving graph isomorphism problem. The algorithm based on a successive splitting of the eigenvalues of the matrices which are modifications (to positive defined) of graphs' adjacency matrices.…

General Mathematics · Mathematics 2007-05-23 R. T. Faizullin , A. V. Prolubnikov

A linearized function field $F$ can be viewed as a Galois extension of a rational function field $K(x)$. For a totally ramified place $Q$ of degree one in $F/K(x)$, we give a unified description of the set $G(Q)$ of gaps at $Q$. As a…

Number Theory · Mathematics 2026-05-29 Huachao Zhang , Chang-An Zhao

q-Supernomial coefficients are generalizations of the q-binomial coefficients. They can be defined as the coefficients of the Hall-Littlewood symmetric function in a product of the complete symmetric functions or the elementary symmetric…

Combinatorics · Mathematics 2007-05-23 Anne Schilling

For a finite group $G$, Frobenius found a formula for the values of the function $\sum_{\mathrm{Irr} G} (\dim\, \pi)^{-s}$ for even integers $s$, where $\mathrm{Irr} G$ is the set of irreducible representations of $G$. We generalize this…

Representation Theory · Mathematics 2016-03-22 Avraham Aizenbud , Nir Avni , Yoav Krauz

It turns out that all instances of the diophantine Frobenius problem for three coprime a_i have a common geometric structure which is independent of arithmetic coincidences among the a_i. By exploiting this structure we easily obtain…

Number Theory · Mathematics 2010-07-13 Christian Blatter
‹ Prev 1 3 4 5 6 7 10 Next ›