Related papers: A Generalization of the Digital Binomial Theorem
As a generalization of polyominoes we consider edge-to-edge connected nonoverlapping unions of regular $k$-gons. For $n\le 4$ we determine formulas for the number $a_k(n)$ of generalized polyominoes consisting of $n$ regular $k$-gons.…
A generalized numerical semigroup is a submonoid of $\mathbb{N}^d$ with finite complement in it. In this work we study some properties of three different classes of generalized numerical semigroups. In particular, we prove that the first…
We generalize Bourgain's discretized sum-product theorem to matrix algebras.
We introduce a large class of Sobolev bi-orthogonal polynomial sequences arising from a $LU$-factorizable moment matrix and associated with a suitable measure matrix that characterizes the Sobolev bilinear form. A theory of deformations of…
In this paper, we investigated properties of Tribonacci-Lucas polynomials which generalized Tribonacci-Lucas numbers. From this generalization, we also obtain some new algebraic properties on these numbers and polynomials as Binet formula,…
This paper reexamines univariate reduction from a toric geometric point of view. We begin by constructing a binomial variant of the $u$-resultant and then retailor the generalized characteristic polynomial to fully exploit sparsity in the…
We introduce a class of graphs called compound graphs, generalizing rectangles, which are constructed out of copies of a planar bipartite base graph. The main result is that the number of perfect matchings of every compound graph is…
Using Newton polygons, a key factorization result for polynomials over discrete valuation domains is proved, which in particular yields new irreducibility criteria including a generalization of the classical irreducibility criterion of…
We consider the problem of computing matrix polynomials $p(X)$, where $X$ is a large dense matrix, with as few matrix-matrix multiplications as possible. More precisely, let $\Pi_{2^{m}}^*$ represent the set of polynomials computable with…
As is well-known, a generalization of the classical concept of the factorial $n!$ for a real number $x\in {\mathbb R}$ is the value of Euler's gamma function $\Gamma(1+x)$. In this connection, the notion of a binomial coefficient naturally…
This paper introduces a reformulation of the classical convergence theorem for spectral sequences of filtered complexes which provides an algorithm to effectively compute the induced filtration on the total (co)homology, as soon as the…
Following Lucas and then other Fibonacci people Kwasniewski had introduced and had started ten years ago the open investigation of the overall F-nomial coefficients which encompass among others Binomial, Gaussian and Fibonomial coefficients…
A generalization of recent group-theoretic matrix multiplication algorithms to an analogue of the theory of partial matrix multiplication is presented. We demonstrate that the added flexibility of this approach can in some cases improve…
A generalized numerical semigroup is a submonoid $S$ of $\mathbb{N}^d$ with finite complement in it. We characterize isomorphisms between these monoids in terms of permutation of coordinates. Considering the equivalence relation that…
This work is in a stream initiated by a paper of Killip and Simon [Ann. of Math. (2003)]. Using methods of Functional Analysis and the classical Szeg\"o Theorem we prove sum rule identities in a very general form. Then, we apply the result…
The separately continuity topology is considered and some its properties are investigated. With help of these properties a generalization of Sierpinski theorem on determination of real separately continuous function by its values on an…
A generalization of the classical Lipschitz summation formula is proposed. It involves new polylogarithmic rational functions constructed via the Fourier expansion of certain sequences of Bernoulli--type polynomials. Related families of…
In this paper, we obtain a generalization of an identity due to Carlitz on Bernoulli polynomials. Then we use this generalized formula to derive two symmetric identities which reduce to some known identities on Bernoulli polynomials and…
We compute bifunctors cohomology for matrix polynomials under conjugation and detect candidates for universal classes in higher invariant theory.
In this paper, we establish an identity for Bernoulli's generalized polynomials. We deduce generalizations for many relations involving classical Bernoulli numbers or polynomials. In particular, we generalize a recent Gessel identity.