Related papers: Covering systems with odd moduli
In an award-winning expository article, V. Pozdnyakov and J.M. Steele gave a beautiful demonstration of the ramifications of a basic bijection for permutations. The aim of this note is to connect this correspondence to a seemingly unrelated…
The modeling of complex systems such as ecological or socio-economic systems can be very challenging. Although various modeling approaches exist, they are generally not compatible and mutually consistent, and empirical data often do not…
Let R be a commutative ring with identity. The concept of second submodule of an R-module (as a dual notion of prime submodules) was introduced and studied by S.Yassemi in 2001. This notion has obtained a great attention by many authors and…
Submanifolds of finite type were introduced by the author during the late 1970s. The first results on this subject had been collected in author's book [Total mean curvature and sub manifolds of finite type, World Scientific, NJ, 1984]. A…
We introduce an algorithm that conjectures the structure of a permutation class in the form of a disjoint cover of "rules"; similar to generalized grid classes. The cover is usually easily verified by a human and translated into an…
We study the modular representation theory of the symmetric and alternating groups. One of the most natural ways to label the irreducible representations of a given group or algebra in the modular case is to show the unitriangularity of the…
The ternary Goldbach conjecture, or three-primes problem, states that every odd number $n$ greater than $5$ can be written as the sum of three primes. The conjecture, posed in 1742, remained unsolved until now, in spite of great progress in…
A classical problem in the literature seeks the minimal number of proper subgroups whose union is a given finite group. A different question, with applications to error-correcting codes and graph colorings, involves covering vector spaces…
A formula for the irregularity of abelian coverings of the projective plane is established and some applications are presented.
Given a finite dimensional algebra over a perfect field the text introduces covering functors over the mesh category of any modulated Auslander-Reiten component of the algebra. This is applied to study the composition of irreducible…
We give a comprehensive treatment on how $F$-signatures, splitting primes, splitting ratios, and test modules behave under finite covers. To this end, we expand on the notion of transposability along a section section of the relative…
Covering model provides a general framework for granular computing in that overlapping among granules are almost indispensable. For any given covering, both intersection and union of covering blocks containing an element are exploited as…
Polymer materials have the characteristic feature that they are multiscale systems by definition. Already the description of a single molecules involves a multitude of different scales, and cooperative processes in polymer assemblies are…
Given a binary dominance relation on a set of alternatives, a common thread in the social sciences is to identify subsets of alternatives that satisfy certain notions of stability. Examples can be found in areas as diverse as voting theory,…
Among topological modular forms with level structure, $TMF_0(7)$ at the prime $3$ is the first example that had not been understood yet. We provide a splitting of $TMF_0(7)$ at the prime 3 as $TMF$-module into two shifted copies of $TMF$…
Ring puzzles are tessellations of the Euclidean plane respecting local constraints around vertices. Such puzzles may arise in geometric group theory, for example, as embedded flat planes in certain CAT(0) complexes of dimension 2. In the…
In this paper, we mainly focus on formal deformation theory of module homomorphisms. We first introduce the cohomology of module homomorphisms and study formal one-parameter deformation. We obtain some properties about obstructions. Then we…
Results of research of possibility of transformation of a difference equation into a system of the first-order difference equation are presented. In contrast to the method used previously, an unknown grid function is split into two new…
Results of Sierpinski and others have shown that certain finite-dimensional product sets can be written as unions of subsets, each of which is "narrow" in a corresponding direction; that is, each line in that direction intersects the subset…
We study the maximum set coverage problem in the massively parallel model. In this setting, $m$ sets that are subsets of a universe of $n$ elements are distributed among $m$ machines. In each round, these machines can communicate with each…