The strength of multi-row aggregation cuts for sign-pattern integer programs

Sign-pattern IPs are a generalization of packing IPs, where for a given column all coefficients are either non-negative or non-positive. We show that the aggregation closure for such sign-pattern IPs can be 2-approximated by the original 1-row closure. This generalizes a result for packing IPs. On the other hand, unlike in the case of packing IPs, we show that the multi-row aggregation closure cannot be well approximated by the original multi-row closure.     

On the complete set packing and set partitioning polytopes: Properties and rank 1 facets

This paper studies two polytopes: the complete set packing and set partitioning polytopes, which are both associated with a binary $n$-row matrix having all possible columns. Cuts of rank 1 for the latter polytope play a central role in recent exact algorithms for many combinatorial problems, such as vehicle routing. We show the precise relation between the two polytopes studied, characterize the multipliers that induce rank 1 clique facets and give several families of multipliers that yield other facets.     

Analogies of Dedekind sums in function fields

The classical Dedekind sums were found in transformation formulae of η-functions. It is known that these sums have some properties, especially a reciprocity law

     

Odd‐sized partitions of Russell‐sets

In the setting of ZF, i.e., Zermelo–Fraenkel set theory without the Axiom of Choice (AC), we study partitions of Russell‐sets into sets each with exactly n elements (called n ‐ary partitions), for some integer n. We show that if n is odd, then a Russell‐set X has an n ‐ary partition if and only if |X | is divisible by n. Furthermore, we establish that it is relative consistent with ZF that there exists a Russell‐set X such that |X | is not divisible by any finite cardinal n > 1 (© 2010 WILEY‐VCH Verlag GmbH & Co. KGaA, Weinheim)     

On Semiprime Multiplication Modules over Pullback Rings

We classify all those indecomposable semiprime multiplication modules with finite-dimensional top over pullback of two Dedekind domains. We extend the definition and results given in [9 Ebrahimi Atani , S. , Farzalipour , F. ( 2009 ). Weak multiplication modules over a pullback of Dedekind domains . Colloquium Math. 114 : 99 – 112 .[Crossref] , [Google Scholar]] to a more general semiprime multiplication modules case.     

Groups with Certain Normality Conditions

We classify two types of finite groups with certain normality conditions, namely SSN groups and groups with all noncyclic subgroups normal. These conditions are key ingredients in the study of the multiplicative Jordan decomposition problem for group rings.     

Reverse Order Law for the Group Inverse in Semigroups and Rings

In this paper, we provide equivalent conditions for the two-sided reverse order law for the group inverse (ab)^# = b ^# a ^# and (ba)^# = a ^# b ^#, in semigroups and rings. Moreover, we prove that, under finiteness conditions, these conditions are also equivalent with the one-sided reverse order law (ab)^# = b ^# a ^#.     

On Dedekind Modules

In this article the authors give the relation between a finitely-generated torsionfree Dedekind module M over a domain R and prime submodules of the 𝒪(M)-module M and the ring 𝒪(M). They also prove that M is a finitely-generated torsionfree Dedekind module over a domain R if and only if every semi-maximal submodule of R-module M is invertible.     

Zeros of Dedekind zeta functions in the critical strip

In this paper, we describe a computation which established the GRH to height (resp. ) for cubic number fields (resp. quartic number fields) with small discriminant. We use a method due to E. Friedman for computing values of Dedekind zeta functions, we take care of accumulated roundoff error to obtain results which are mathematically rigorous, and we generalize Turing's criterion to prove that there is no zero off the critical line. We finally give results concerning the GRH for cubic and quartic fields, tables of low zeros for number fields of degree and , and statistics about the smallest zero of a number field.