Results 51 to 60 of about 146,061 (197)
Local polynomials are polynomials [PDF]
Studia Mathematica, 1995 Summary: We prove that a function \(f\) is a polynomial if \(G\circ f\) is a polynomial for every bounded linear functional \(G\). We also show that an operator-valued function is a polynomial if it is locally a polynomial.
Fong, C. K. +4 more
openaire +1 more source
Adaptive Polynomial Method for Solving Third-Order ODE With Application in Thin Film Flow
IEEE Access, 2021 Differential equations are commonly used to model several engineering, science, and biological applications. Unfortunately, finding analytical solutions for solving higher-order Ordinary Differential Equations (ODEs) is a challenge.
Mohammad T. Haweel +2 more
doaj +1 more source
The Electronic Journal of Combinatorics, 1998 Let ${\bf F}(n)$ be a family of partitions of $n$ and let ${\bf F}(n,d)$ denote the set of partitions in ${\bf F}(n)$ with Durfee square of size $d$. We define the Durfee polynomial of ${\bf F}(n)$ to be the polynomial $P_{{\bf F},n}= \sum |{\bf F}(n,d)|y^d$, where $ 0 \leq d \leq \lfloor \sqrt{n} \rfloor.$ The work in this paper is motivated by ...
E. Rodney Canfield +2 more
openaire +2 more sources
Extremal Polynomials Connected with Zolotarev Polynomials [PDF]
Vestnik St. Petersburg University, Mathematics, 2020 In this paper, the authors deal with the following extremal problem: Using the notation \(P_{n}(x,t)=x_{0}t^{n}+x_{1}t^{n-1}+\dotsb+x_{n}\) for a polynomial of degree not greater than \(n\), \(n\ge 2\) and given real parameters \[ a>1,\quad b0,\quad A \] maximize the magnitude of \(P_{n}(x,b)\) at the following constraints \[ |P_{n}(x,t)|\le M\quad ...
Agafonova, I. V., Malozemov, V. N.
openaire +2 more sources
IET Information Security, 2021 Three closely related polynomial‐based group key pre‐distribution schemes have recently been proposed, aimed specifically at wireless sensor networks.
Chris J Mitchell
doaj +1 more source
A Unique Representation of Cyclic Codes over GR(pn,r)
Axioms, 2022 Let R be a Galois ring, GR(pn,r), of characteristic pn and of order pnr. In this article, we study cyclic codes of arbitrary length, N, over R. We use discrete Fourier transform (DFT) to determine a unique representation of cyclic codes of length, N, in ...
Sami Alabiad, Yousef Alkhamees
doaj +1 more source
Memory‐constrained implementation of lattice‐based encryption scheme on standard Java Card platform
IET Information Security, 2021 The lattice‐based encryption scheme has high efficiency and reliability, and it can be run on small devices with limited memory capacity and computational resources such as sensor nodes or smart cards.
Ye Yuan +4 more
doaj +1 more source
Mathematics, 2023 In order to propose a deeper analysis of the general quartic equation with real coefficients, the analytical solutions for all cubic and quartic equations were reviewed here; then, it was found that there can only be one form of the resolvent cubic that ...
Mauricio Chávez-Pichardo +4 more
doaj +1 more source
Chain polynomials and Tutte polynomials
Discrete Mathematics, 2002 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +1 more source
Stanley's character polynomials and coloured factorisations in the symmetric group [PDF]
, 2008 In Stanley [R.P. Stanley, Irreducible symmetric group characters of rectangular shape, Sém. Lothar. Combin. 50 (2003) B50d, 11 p.] the author introduces polynomials which help evaluate symmetric group characters and conjectures that the coefficients of ...
Rattan, Amarpreet
core +1 more source