{"paper":{"title":"Riordan arrays and generalized Euler polynomials","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.NT","authors_text":"E. Burlachenko","submitted_at":"2017-09-07T13:40:46Z","abstract_excerpt":"Generalization of the Euler polynomials ${{A}_{n}}\\left( x \\right)={{\\left( 1-x \\right)}^{n+1}}\\sum\\nolimits_{m=0}^{\\infty }{{{m}^{n}}{{x}^{m}}}$ are the polynomials ${{\\alpha }_{n}}\\left( x \\right)={{\\left( 1-x \\right)}^{n+1}}\\sum\\nolimits_{m=0}^{\\infty }{{{u}_{n}}}\\left( m \\right){{x}^{m}}$, where ${{u}_{n}}\\left( x \\right)$ is the polynomial of degree $n$. These polynomials appear in various fields of mathematics, which causes a variety of methods for their study. In present paper we will consider generalized Euler polynomials as an attribute of the theory of Riordan arrays. From this point"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1709.02229","kind":"arxiv","version":2},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"references":{"count":0,"sample":[],"resolved_work":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","internal_anchors":0},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"}