Related papers: Covering modules by proper submodules
In this paper it is proven that if the group of covering translations of the covering space of a compact, connected, $P^2$-irreducible 3-manifold corresponding to a non-trivial, finitely-generated subgroup of its fundamental group is…
A module over a ring $R$ is pure projective provided it is isomorphic to a direct summand of a direct sum of finitely presented modules. We develop tools for the classification of pure projective modules over commutative noetherian rings.…
The main result of the paper is motivated by the following two, apparently unrelated graph optimization problems: (A) as an extension of Edmonds' disjoint branchings theorem, characterize digraphs comprising $k$ disjoint branchings $B_i$…
We give an algorithm to compute representatives of the conjugacy classes of semisimple square integral matrices with given minimal and characteristic polynomials. We also give an algorithm to compute the $\mathbb{F}_q$-isomorphism classes…
For any finite abelian group G, we study the moduli space of abelian $G$-covers of elliptic curves, in particular identifying the irreducible components of the moduli space. We prove that, in the totally ramified case, the moduli space has…
We analyze cyclic cell modules over walled Brauer algebra in terms of a certain normal form. The latter allows us to decompose the algebra into the generating set and annihilator ideal of a certain cyclic vector. In addition, we show that…
In this paper, we investigate a class of submodular problems which in general are very hard. These include minimizing a submodular cost function under combinatorial constraints, which include cuts, matchings, paths, etc., optimizing a…
The main result is Theorem: Let A be an R-algebra, mu, lambda be cardinals such that |A|<=mu=mu^{aleph_0}<lambda<=2^mu. If A is aleph_0-cotorsion-free or A is countably free, respectively, then there exists an aleph_0-cotorsion-free or a…
In this article, we study the classification of some natural numbers related to the combinatorics of congruence subgroups of the modular group. More precisely, we will focus here on the notion of minimal monomial solutions. These are the…
The covering number of a group $G$, denoted by $\sigma(G)$, is the size of a minimal collection of proper subgroups of $G$ whose union is $G$. We investigate which integers are covering numbers of groups. We determine which integers $129$…
Submodular function minimization (SFM) is a fundamental and efficiently solvable problem class in combinatorial optimization with a multitude of applications in various fields. Surprisingly, there is only very little known about constraint…
We study a shift action defined on multipartitions and on residue multisets of their Young diagrams. We prove that the minimal orbit cardinality among all multipartitions associated to a given multiset depends only on the orbit cardinality…
We give a survey on the theory of representation-finite and certain minimal representation-infinite algebras.The main goals are the existence of multiplicative bases and of coverings with good properties. Both are attained via…
We study covering codes of permutations with the $\ell_\infty$-metric. We provide a general code construction, which uses smaller building-block codes. We study cyclic transitive groups as building blocks, determining their exact covering…
We discuss some well-known compactness principles for uncountable structures of small regular sizes ($\omega_n$ for $2 \le n<\omega$, $\aleph_{\omega+1}$, $\aleph_{\omega^2+1}$, etc.), consistent from weakly compact (the size-restricted…
In 1952, H. Davenport posed the problem of determining a condition on the minimum modulus $m_{0}$ in a finite distinct covering system that would imply that the sum of the reciprocals of the moduli in the covering system is bounded away…
A covering code is a set of codewords with the property that the union of balls, suitably defined, around these codewords covers an entire space. Generally, the goal is to find the covering code with the minimum size codebook. While most…
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 consider the problem of deciding the satisfiability of quantifier-free formulas in the theory of finite sets with cardinality constraints. Sets are a common high-level data structure used in programming; thus, such a theory is useful for…
In this paper, by using functor rings and functor categories, we study finiteness and purity of subcategories of the module categories. We give a characterisation of contravariantly finite resolving subcategories of the module category of…