English
Related papers

Related papers: Numerical semigroups, cyclotomic polynomials and B…

200 papers

We develop a new technique for studying monomial ideals in the standard polynomial rings $A[X_1,\ldots,X_d]$ where $A$ is a commutative ring with identity. The main idea is to consider induced ideals in the semigroup ring…

Commutative Algebra · Mathematics 2013-12-30 Zechariah Andersen , Sean Sather-Wagstaff

We present a framework to decompose real multivariate polynomials while preserving invariance and positivity. This framework has been recently introduced for tensor decompositions, in particular for quantum many-body systems. Here we…

Mathematical Physics · Physics 2024-08-08 Gemma De las Cuevas , Andreas Klingler , Tim Netzer

I recent years, many mathematicians studied various degenerate version of some spcial polynomials of which quite a few interesting results were discovered. In this paper, we introduce the type 2 degenerate Bernoulli polynomials of the…

Number Theory · Mathematics 2019-08-20 Taekyun Kim , Lee-Chae jang , Dae San Kim , Han-Young Kim

The aim of this paper is to give an overview of some inequalities about $L^p$-norms ($p= 1$ or $p= 2$) of harmonic (periodic) and non-harmonic trigonometric polynomials. Among the material covered, we mention Ingham's Inequality about 2…

Classical Analysis and ODEs · Mathematics 2023-11-30 Philippe Jaming , Chadi Saba

In this note we recast the Geronimus transformation in the framework of polynomials orthogonal with respect to symmetric bilinear forms. We also show that the double Geronimus transformations lead to non-diagonal Sobolev type inner…

Classical Analysis and ODEs · Mathematics 2013-08-21 Maxim Derevyagin , Francisco Marcellán

Polynomial remainder sequences contain the intermediate results of the Euclidean algorithm when applied to (non-)commutative polynomials. The running time of the algorithm is dependent on the size of the coefficients of the remainders.…

Symbolic Computation · Computer Science 2015-11-05 Maximilian Jaroschek

Polynomial, or Delsarte's, method in coding theory accounts for a variety of structural results on, and bounds on the size of, extremal configurations (codes and designs) in various metric spaces. In recent works of the authors the…

Combinatorics · Mathematics 2007-07-16 A. Ashikhmin , A. Barg , S. Litsyn

It is conjectured that all separable polynomials with integers coefficients, satisfying some local conditions, take infinitely many square free values on integer arguments. But not a single polynomial of degree greater than $3$ is proven to…

Number Theory · Mathematics 2023-03-14 Prem Prakash Pandey

The question whether there exists an integral solution to the system of linear equations with non-negative constraints, $A\x = \b, \, \x \ge 0$, where $A \in \Z^{m\times n}$ and ${\mathbf b} \in \Z^m$, finds its applications in many areas,…

Combinatorics · Mathematics 2019-03-01 Florian Kohl , Yanxi Li , Johannes Rauh , Ruriko Yoshida

We prove an inverse relation and a family of convolution formulas involving partial Bell polynomials. Known and some presumably new combinatorial identities of convolution type are discussed. Our approach relies on an interesting…

Combinatorics · Mathematics 2013-07-23 Daniel Birmajer , Juan B. Gil , Michael D. Weiner

Polycosecant numbers and polycotangent numbers are introduced as level two analogues of poly-Bernoulli numbers. It is shown that polycosecant numbers and polycotangent numbers satisfy many formulas similar to those of poly-Bernoulli…

Number Theory · Mathematics 2022-05-12 Kyosuke Nishibiro

We consider orthogonal polynomials on the unit circle associated with certain semi-classical weight functions. This means that the Pearson-type differential equations satisfied by these weight functions involve two polynomials of degree at…

Complex Variables · Mathematics 2023-10-13 Cleonice F. Bracciali , Karina S. Rampazzi , Luana L. Silva Ribeiro

A numerical semigroup is a co-finite submonoid of the monoid of non-negative integers under addition. Many properties of numerical semigroups rely on some fundamental invariants, such as, among others, the set of gaps (and its cardinality),…

Discrete Mathematics · Computer Science 2025-05-30 Massimo Bartoletti , Stefano Bonzio , Marco Ferrara

In this paper we consider the relationship between monomial-size and bit-complexity in Sums-of-Squares (SOS) in Polynomial Calculus Resolution over rationals (PCR/$\mathbb{Q}$). We show that there is a set of polynomial constraints $Q_n$…

Computational Complexity · Computer Science 2021-05-18 Tuomas Hakoniemi

In the paper, the authors discover an integral representation, some inequalities, and complete monotonicity of Bernoulli numbers of the second kind.

Classical Analysis and ODEs · Mathematics 2015-05-26 Feng Qi , Xiao-Jing Zhang

In this paper I prove a conjecture which gives a lower bound for the largest absolute value of the coefficients of the n-th cyclotomic polynomial for some n. Moreover this estimate is essentially sharp.

Number Theory · Mathematics 2024-03-21 Akos Borsanyi

Recently, the degenerate harmonic and the degenerate hyperharmonic numbers are introduced respectively as degenerate versions of the harmonic and the hyperharmonic numbers. The aim of this paper is to introduce the degenerate…

Number Theory · Mathematics 2023-06-22 Dae San Kim , Taekyun Kim

We establish necessary and sufficient conditions for a polynomial to be divisible by a cyclotomic polynomials and derive new formulas involving Ramanujan sums as an application of our results. Additionally, we provide new insights into the…

Number Theory · Mathematics 2025-08-06 Laura De Carli , Maurizio Laporta

The use of compositions simplifies some aspects of the theory of numerical semigroups. We illustrate this by giving a new proof for the asymptotic number C((1 + $\sqrt$ 5)/2) g of numerical semigroups of genus g and by describing the…

Combinatorics · Mathematics 2021-05-11 Roland Bacher

Let $c_1(x),c_2(x),f_1(x),f_2(x)$ be polynomials with rational coefficients. With obvious exceptions, there can be at most finitely many roots of unity among the zeros of the polynomials $c_1(x)f_1(x)^n+c_2(x)f_2(x)^n$ with $n=1,2\ldots$.…

Number Theory · Mathematics 2020-11-24 Yuri Bilu , Florian Luca
‹ Prev 1 8 9 10 Next ›