English
Related papers

Related papers: Appell polynomial sequences with respect to some d…

200 papers

Local convergence analysis of the augmented Lagrangian method (ALM) is established for a large class of composite optimization problems with nonunique Lagrange multipliers under a second-order sufficient condition. We present a new…

Optimization and Control · Mathematics 2023-10-23 Nguyen T. V. Hang , Ebrahim Sarabi

New approach to systems of polynomial recursions is developed based on the Carleman linearization procedure. The article is divided into two main sections: firstly, we focus on the case of uni-variable depth-one polynomial recurrences.…

Dynamical Systems · Mathematics 2021-12-16 Mikołaj Myszkowski

This paper provides analogues of the results of [G.Walker and R.M.W. Wood, Linking first occurrence polynomials over F_2 by Steenrod operations, J. Algebra 246 (2001), 739--760] for odd primes p. It is proved that for certain irreducible…

Algebraic Topology · Mathematics 2014-10-01 Pham Anh Minh , Grant Walker

We give new sufficient conditions for a sequence of polynomials to have only real zeros based on the method of interlacing zeros. As applications we derive several well-known facts, including the reality of zeros of orthogonal polynomials,…

Combinatorics · Mathematics 2010-08-17 Lily L. Liu , Yi Wang

To cater to the needs of (Zero Knowledge) proofs for (mathematical) proofs, we describe a method to transform formal sentences in 2x2-matrices over multivariate polynomials with integer coefficients, such that usual proof-steps like…

Logic · Mathematics 2025-09-17 Mihai Prunescu

The aim of this paper is to give some combinatorial relations linked polynomials generalizing those of Appell type to the partial r-Bell polynomials. We give an inverse relation, recurrence relations involving some family of polynomials and…

Combinatorics · Mathematics 2018-03-13 Miloud Mihoubi , Yamina Saidi

We introduce a novel generalization of deranged Bell numbers by defining the partial deranged Bell numbers $w_{n,r}$, which count the number of set partitions of $\left[ n\right] $ with exactly $r$ fixed blocks, while the remaining blocks…

Combinatorics · Mathematics 2025-07-30 Yahia Djemmada , Levent Kargın , Mümün Can

This work continues the research of generalized Heisenberg algebras connected with several orthogonal polynomial systems. The realization of the annihilation operator of the algebra corresponding to a polynomial system by a differential…

Quantum Algebra · Mathematics 2007-05-23 Vadim V. Borzov , Eugene V. Damaskinsky

The lambda calculus with constructors is an extension of the lambda calculus with variadic constructors. It decomposes the pattern-matching a la ML into a case analysis on constants and a commutation rule between case and application…

Logic in Computer Science · Computer Science 2012-03-06 Barbara Petit

A notion of probabilistic lambda-calculus usually comes with a prescribed reduction strategy, typically call-by-name or call-by-value, as the calculus is non-confluent and these strategies yield different results. This is a break with one…

Logic in Computer Science · Computer Science 2020-02-21 Ugo Dal Lago , Giulio Guerrieri , Willem Heijltjes

An Artin algebra $\Lambda$ is said to be of finite Cohen-Macaulay type, $\rm{CM}$-finite for short, if the full subcategory $\rm{Gprj}\mbox{-} \Lambda$ of finitely generated Gorenstein projective $\Lambda$-modules is of finite…

Representation Theory · Mathematics 2019-02-21 Rasool Hafezi

The theory of Touchard polynomials is generalized using a method based on the definition of exponential operators, which extend the notion of the shift operator. The proposed technique, along with the use of the relevant operational…

Category Theory · Mathematics 2010-10-29 G. Dattoli , B. Germano , M. R. Martinelli , P. E. Ricci

In this paper, we prove the pointwise convergence and the rate of pointwise convergence for a family of singular integral operators in two-dimensional setting in the following form: \begin{equation*} L_{\lambda }\left( f;x,y\right)…

Functional Analysis · Mathematics 2017-01-26 Mine Menekse Yilmaz , Lakshmi Narayan Mishra , Gumrah Uysal

Proving super-polynomial size lower bounds for syntactic multilinear Algebraic Branching Programs(smABPs) computing an explicit polynomial is a challenging problem in Algebraic Complexity Theory. The order in which variables in…

Computational Complexity · Computer Science 2019-01-15 C. Ramya , B. V. Raghavendra Rao

This paper explores the operational principles and monomiality principle that significantly shape the development of various special polynomial families. We argue that applying the monomiality principle yields novel results while remaining…

General Mathematics · Mathematics 2024-12-30 Awatif Muflih Alqahtani , Saleem Yousuf , Shahid Ahmad Wani , Roberto S. Costas-Santos

A new $q$-analogue of Appell polynomial sequences and their generalizations are introduced and their main characterizations are proved. As consequences new $q$-analogue of Bernoulli and Euler polynomials and numbers is introduced, their…

Classical Analysis and ODEs · Mathematics 2018-01-29 P. Njionou Sadjang

Let $\eps >0$. We prove that there exists an operator $T_\eps:\ell_2\to\ell_2$, such that for any polynomial $P$ we have $\|{P(T)}\| \leq(1+\eps)\|{P}\|_\infty$, but which is not similar to a contraction, {\it i.e.} there does not exist an…

Functional Analysis · Mathematics 2016-09-06 Gilles Pisier

In this paper we study a generalization of the class of orthogonal polynomials on the real line. These polynomials satisfy the following relation: $(J_5 - \lambda J_3) \vec p(\lambda) = 0$, where $J_3$ is a Jacobi matrix and $J_5$ is a…

Classical Analysis and ODEs · Mathematics 2015-08-10 Sergey M. Zagorodnyuk

This research is aimed to give a determinantal definition for the $q$-Appell polynomials and show some classical properties as well as find some interesting properties of the mentioned polynomials in the light of the new definition.

Number Theory · Mathematics 2014-12-11 Marzieh Eini Keleshteri , Nazim I. Mahmudov

We designed a superposition calculus for a clausal fragment of extensional polymorphic higher-order logic that includes anonymous functions but excludes Booleans. The inference rules work on $\beta\eta$-equivalence classes of…

Logic in Computer Science · Computer Science 2021-02-02 Alexander Bentkamp , Jasmin Blanchette , Sophie Tourret , Petar Vukmirović , Uwe Waldmann