English
Related papers

Related papers: Compositions that are palindromic modulo $m$

200 papers

The probability that the commutator of two group elements is equal to a given element has been introduced in literature few years ago. Several authors have investigated this notion with methods of the representation theory and with…

Group Theory · Mathematics 2013-02-19 Ahmad M. A. Alghamdi , Francesco G. Russo

We investigate compositions of a positive integer with a fixed number of parts, when there are several types of each natural number. These compositions produce new relationships among binomial coefficients, Catalan numbers, and numbers of…

Combinatorics · Mathematics 2010-12-20 Milan Janjic

We consider colored compositions where only some parts are allowed different colors, depending on their locations in the composition. The counting sequences are obtained through generating functions. Connections to many other combinatorial…

Combinatorics · Mathematics 2025-11-12 Andrew Li , Hua Wang

We introduce a generalization of semistandard composition tableaux called permuted composition tableaux. These tableaux are intimately related to permuted basement semistandard augmented fillings studied by Haglund, Mason and Remmel. Our…

Combinatorics · Mathematics 2018-09-20 Vasu Tewari , Stephanie van Willigenburg

In a recent article, Apagodu and Zeilberger (http://arxiv.org/abs/1606.03351)discuss some applications of an algorithm for finding and proving congruence identities (modulo primes) of indefinite sums of many combinatorial sequence. At the…

Number Theory · Mathematics 2016-07-11 Tewodros Amdeberhan , Roberto Tauraso

In this paper we introduce a class of sequences connected with the $m$--ary partition function and investigate their congruence properties. In particular, we get facts about the sequences of $m$--ary partitions $(b_{m}(n))_{m\in\mathbb{N}}$…

Number Theory · Mathematics 2017-10-13 Błażej Żmija

We present a framework for the construction of linearizations for scalar and matrix polynomials based on dual bases which, in the case of orthogonal polynomials, can be described by the associated recurrence relations. The framework…

Numerical Analysis · Mathematics 2016-07-06 Leonardo Robol , Raf Vandebril , Paul Van Dooren

We study compositions of a positive integer $n$ in which the occurrence of even parts larger than a fixed threshold $k$ is controlled. More precisely, for each composition $m=(m_1,\dots,m_r)$ we consider the number of even parts strictly…

Combinatorics · Mathematics 2026-02-25 Mahdi Koutchoukali

The set of idempotents of a regular semigroup is given an abstract characterization as a regular biordered set in [2], and in [4] it is shown how a biordered set can be associated with a complemented modular lattice. Von Neumann has shown…

Rings and Algebras · Mathematics 2020-10-20 James Alexander , E. Krishnan

Many generating series of combinatorially interesting numbers have the property that the sum of the terms of order $<p$ at some suitable point is congruent to a zero of a zeta-function modulo infinitely many primes $p$. Surprisingly, very…

Number Theory · Mathematics 2025-06-17 Frits Beukers

Many combinatorial sequences (for example, the Catalan and Motzkin numbers) may be expressed as the constant term of $P(x)^k Q(x)$, for some Laurent polynomials $P(x)$ and $Q(x)$ in the variable $x$ with integer coefficients. Denoting such…

Combinatorics · Mathematics 2015-10-01 William Y. C. Chen , Qing-Hu Hou , Doron Zeilberger

The purpose of this paper is to introduce basic concepts that are fundamental in the examination of composite moduli, while avoiding the notoriously difficult problem of prime-factorization. We introduce a new class of numbers, called…

Rings and Algebras · Mathematics 2016-10-31 József Vass

Recently, Drema and N. Saikia (2023) and M. P. Saikia, Sarma, and Sellers (2023) proved several congruences modulo powers of $2$ for overpartition triples with odd parts. In this paper, we study further divisibility properties of…

Number Theory · Mathematics 2026-04-29 Hirakjyoti Das , Manjil P. Saikia , Abhishek Sarma

A two-dimensional ($2$D) word is a $2$D palindrome if it is equal to its reverse and it is an HV-palindrome if all its columns and rows are $1$D palindromes. We study some combinatorial and structural properties of HV-palindromes and its…

Discrete Mathematics · Computer Science 2019-09-18 Kalpana Mahalingam , Palak Pandoh

This article explores a relationship between inconsistency in the pairwise comparisons method and conditions of order preservation. A pairwise comparisons matrix with elements from an alo-group is investigated. This approach allows for a…

Discrete Mathematics · Computer Science 2019-03-29 Konrad Kulakowski , Jiri Mazurek , Jaroslav Ramik , Michael Soltys

Recently, Andrews and El Bachraoui (2024) proved three very interesting $q$-series identities, from which three simple looking identities involving certain restricted partitions into distinct even parts and $4$-regular partitions follow. In…

Combinatorics · Mathematics 2024-10-22 Pankaj Jyoti Mahanta , Manjil P. Saikia

The fundamental theorem of symmetric polynomials over rings is a classical result which states that every unital commutative ring is fully elementary, i.e. we can express symmetric polynomials with elementary ones in a unique way. The…

Commutative Algebra · Mathematics 2026-03-03 Sara Kališnik , Davorin Lešnik

We study $n$-homomorphisms in the sense of Khudaverdian--Voronov, but generalized to maps from arbitrary rings to arbitrary commutative rings. We show that the sum of an $n$-homomorphism and an $m$-homomorphism is an $\left( n+m\right)…

Rings and Algebras · Mathematics 2026-04-16 Darij Grinberg

Given two symmetric and positive semidefinite square matrices $A, B$, is it true that any matrix given as the product of $m$ copies of $A$ and $n$ copies of $B$ in a particular sequence must be dominated in the spectral norm by the ordered…

Functional Analysis · Mathematics 2020-07-03 Rima Alaifari , Xiuyuan Cheng , Lillian B. Pierce , Stefan Steinerberger

We study a composition operation on monads, equivalently presented as large equational theories. Specifically, we discuss the existence of tensors, which are combinations of theories that impose mutual commutation of the operations from the…

Logic in Computer Science · Computer Science 2015-07-01 Nathan Bowler , Sergey Goncharov , Paul Blain Levy , Lutz Schröder