相关论文: A congruence identity satisfied by m-permutable va…
The MacWilliams identity for linear time-invariant convolutional codes that has recently been found by Gluesing-Luerssen and Schneider is proved concisely, and generalized to arbitrary group codes on graphs. A similar development yields a…
Let $B_{l,m}(n)$ denote the number of $(l,m)$-regular bipartitions of $n$. Recently, many authors proved several infinite families of congruences modulo $3$, $5$ and $11$ for $B_{l,m}(n)$. In this paper, using theta function identities to…
The aim of this paper is to present new upper bounds for the distance between a properly normalized permanent of a rectangular complex matrix and the product of the arithmetic means of the entries of its columns. It turns out that the…
We prove an invariance of plurigenera for some foliated surface pairs of general type.
The aim of the present note is to enhance groups $G_{n}^{3}$ and to construct new invariants of classical braids. In particular, we construct invariants valued in $G_{N}^{2}$ groups. In groups $G_{n}^{2}$, the identity problem is solved,…
The notion of a $v$-palindrome is recently introduced by the author. Later, the author defined the notion of the type of a $v$-palindrome $n$ with respect to a number $m$ which can be repeatedly concatenated to form $n$. We prove that this…
We give two congruence properties of Hermitian modular forms of degree 2 over $\mathbb{Q}(\sqrt{-1})$ and $\mathbb{Q}(\sqrt{-3})$. The one is a congruence criterion for Hermitian modular forms which is generalization of Sturm's theorem.…
We continue our studies on semilattice ordered algebras. This time we accept constants in the type of algebras. We investigate identities satisfied by such algebras and describe the free objects in varieties of semilattice ordered algebras…
Some simple nonlinear recursions which can be completely managed are identified and the behaviour of all their solutions is ascertained.
In this note, we provide a conceptual explanation of a well-known polynomial identity used in algebraic number theory.
In this paper we introduce the notion of m-irreducibility that extends the standard concept of irreducibility of a numerical semigroup when the multiplicity is fixed. We analyze the structure of the set of m-irreducible numerical…
In the second edition of the congruence lattice book, Problem 22.1 asks for a characterization of subsets $Q$ of a finite distributive lattice $D$ such that there is a finite lattice $L$ whose congruence lattice is isomorphic to $D$ and…
Peirce-evanescent baric identities are polynomial identities verified by baric algebras such that their Peirce polynomials are the null polynomial. In this paper procedures for constructing such homogeneous and non homogeneous identities…
The aim of the paper is the proof of new identities for the constant in the Mertens product for arithmetic progressions. We deal with the problem of the numerical computation of these constants in another paper.
In this paper, we modify the proof methods of some previously weakly consistent variants of random forests into strongly consistent proof methods, and improve the data utilization of these variants in order to obtain better theoretical…
In this paper we obtained several properties that the characteristic polynomials of the unit-primitive matrix satisfy. In addition, using these properties we have shown that the recurrence relation given as in the formula (1) is true. In…
We prove the vanishing of certain low degree cohomologies of some induced representations. As an application, we determine certain low degree cohomologies of congruence groups.
We obtain upper bounds on the number of solutions to congruences of the type $$ (x_1+s)...(x_{\nu}+s)\equiv (y_1+s)...(y_{\nu}+s)\not\equiv0 \pmod p $$ modulo a prime $p$ with variables from some short intervals. We give some applications…
For a sequence $M=(m_{i})_{i=0}^{\infty}$ of integers such that $m_{0}=1$, $m_{i}\geq 2$ for $i\geq 1$, let $p_{M}(n)$ denote the number of partitions of $n$ into parts of the form $m_{0}m_{1}\cdots m_{r}$. In this paper we show that for…
In this article, we provide a new algorithm for solving constraint satisfaction problems with Maltsev constraints, based on the new notion of Maltsev consistency.