On the Arithmetic of Strongly Primary Monoids

In this paper we study the arithmetic of strongly primary monoids. Numerical monoids and the multiplicative monoids of one-dimensional local Mori domains are main examples of strongly primary monoids. Our investigations focus on local tameness, a basic finiteness property in the theory of non-unique factorizations. It is well-known that locally tame strongly primary monoids have finite catenary degree and finite set of distances.     

Sets of arithmetical invariants in transfer Krull monoids

Transfer Krull monoids are a recently introduced class of monoids and include the multiplicative monoids of all commutative Krull domains as well as of wide classes of non-commutative Dedekind domains. We show that transfer Krull monoids are fully elastic (i.e., every rational number between 1 and the elasticity of the monoid can be realized as the elasticity of an element). In commutative Krull monoids which have sufficiently many prime divisors in all classes of their class group, the set of catenary degrees and the set of tame degrees are intervals. Without the assumption on the distribution of prime divisors, arbitrary finite sets can be realized as sets of catenary degrees and as sets of tame degrees.     

The Extraction Degree of Cale Monoids

The extraction degree measures commonality of factorization between any two elements in a commutative, cancellative monoid. Additional properties of the extraction degree are developed for monoids possessing a Cale basis. For block monoids, the complete set of extraction degrees is calculated between any two elements, between any two irreducible elements, and between any irreducible element and any general element.     

The Catenary and Tame Degree in Finitely Generated Commutative Cancellative Monoids

Problems involving chains of irreducible factorizations in atomic integral domains and monoids have been the focus of much recent literature. If S is a commutative cancellative atomic monoid, then the catenary degree of S (denoted c(S)) and the tame degree of S (denoted t(S)) are combinatorial invariants of S which describe the behavior of chains of factorizations. In this note, we describe methods to compute both c(S) and t(S) when M is a finitely generated commutative cancellative monoid.     

Face numbers of Engström representations of matroids

A classic problem in the theory of matroids is to find a subspace arrangement, such as a hyperplane or pseudosphere arrangement, whose intersection poset is isomorphic to a prescribed geometric lattice. Engström gave an explicit construction for an infinite family of such arrangements, indexed by the set of finite regular CW complexes. In this paper, we compute the face numbers of these topological representations in terms of the face numbers of the indexing complexes and give upper bounds on the total number of faces in these objects. Moreover, for a fixed rank, we show that the total number of faces in the Engström representation corresponding to a codimension one homotopy sphere arrangement is bounded above by a polynomial in the number of elements of the matroid, whose degree is one less than the matroid’s rank.     

A characterization of arithmetical invariants by the monoid of relations

The investigation and classification of non-unique factorization phenomena have attracted some interest in recent literature. For finitely generated monoids, S.T. Chapman and P. García-Sánchez, together with several co-authors, derived a method to calculate the catenary and tame degree from the monoid of relations, and they applied this method successfully in the case of numerical monoids. In this paper, we investigate the algebraic structure of this approach. Thereby, we dispense with the restriction to finitely generated monoids and give applications to other invariants of non-unique factorizations, such as the elasticity and the set of distances.     

Computation of the <Emphasis Type="Italic">ω</Emphasis>-primality and asymptotic <Emphasis Type="Italic">ω</Emphasis>-primality with applications to numerical semigroups

We give an algorithm to compute the ω-primality of finitely generated atomic monoids. Asymptotic ω-primality is also studied and a formula to obtain it in finitely generated quasi-Archimedean monoids is proven. The formulation is applied to numerical semigroups, obtaining an expression of this invariant in terms of its system of generators.     

Minimal length elements of Thompson’s groups <Emphasis Type="Italic">F</Emphasis>(<Emphasis Type="Italic">p</Emphasis>)

We describe a method for determining the minimal length of elements in the generalized Thompson’s groups F(p). We compute the length of an element by constructing a tree pair diagram for the element, classifying the nodes of the tree and summing associated weights from the pairs of node classifications. We use this method to effectively find minimal length representatives of an element.      

Thek-in-a-row procedure in selection theory

Summary Ak-in-a-row procedure is proposed to select the most demanded element in a set ofn elements. We show that the least favorable configuration of the proposed procedure which always selects the element when the same element has been demanded (or observed)k times in a row has a simple form similar to those of classical selection procedures. Moreover, numerical evidences are provided to illustrate the fact thatk-in-a-row procedure is better than the usual inverse sampling procedure and fixed sample size procedure when the distance between the most demanded element and the other elements is large and when the number of elements is small.     

The lattice of closure relations on a poset

In this paper we show that the set of closure relations on a finite posetP forms a supersolvable lattice, as suggested by Rota. Furthermore this lattice is dually isomorphic to the lattice of closed sets in a convex geometry (in the sense of Edelman and Jamison [EJ]). We also characterize the modular elements of this lattice (whenP has a greatest element) and compute its characteristic polynomial.Presented by R. W. Quackenbush.     

Error estimates for the combinedh andp versions of the finite element method

Summary In theh-version of the finite element method, convergence is achieved by refining the mesh while keeping the degree of the elements fixed. On the other hand, thep-version keeps the mesh fixed and increases the degree of the elements. In this paper, we prove estimates showing the simultaneous dependence of the order of approximation on both the element degrees and the mesh. In addition, it is shown that a proper design of the mesh and distribution of element degrees lead to a better than polynomial rate of convergence with respect to the number of degrees of freedom, even in the presence of corner singularities. Numerical results comparing theh-version,p-version, and combinedh-p-version for a one dimensional problem are presented.     

In response to the article by Ivan Kausz: A discriminant and an upper bound for w 2 for hyperelliptic arithmetic surfaces

We define a natural discriminant for a hyperelliptic curve X of genus g over a field K as a canonical element of the (8g+4)th tensor power of the maximal exterior product of the vectorspace of global differential forms on X. If v is a discrete valuation on K and X has semistable reduction at v, we compute the order of vanishing of the discriminant at v in terms of the geometry of the reduction of X over v. As an application, we find an upper bound for the Arakelov self-intersection of the relative dualizing sheaf on a semistable hyperelliptic arithmetic surface.     

A canonical restricted version of van der waerden’s theorem

It is shown that there is a subsetS of integers containing no (k+1)-term arithmetic progression such that if the elements ofS are arbitrarily colored (any number of colors),S will contain ak-term arithmetic progression for which all of its terms have the same color, or all have distinct colors.     

Arithmetic of Mori domains and monoids

In this paper we introduce weakly C-monoids as a new class of v-noetherian monoids. Weakly C-monoids generalize C-monoids and make it possible to study multiplicative properties of a wide class of Mori domains, e.g., rings of generalized power series with coefficients in a field and exponents in a finitely generated monoid. The main goal of the paper is to study the question when a weakly C-monoid is locally tame. After having proved a classification theorem for local tameness, we use it to show that every locally tame weakly C-monoid whose complete integral closure has finite class group has finite catenary degree and finite set of distances.     

On the galois number and the minimal degree of doubly transitive groups

Consider the action of a finite group G on a set M. Then the Galois number is defined to be 1 + f, where fis the maximal number of fixed points of an element in G, which does not act as the identity on M. We determine the Galois number and the minimal degree of all doubly transitive permutation groups.     

The X-Class and Almost-Increasing Permutations

In this paper we give a bijection between the class of permutations that can be drawn on an X-shape and a certain set of permutations that appears in Knuth [4] in connection to sorting algorithms. A natural generalization of this set leads us to the definition of almost-increasing permutations, which is a one-parameter family of permutations that can be characterized in terms of forbidden patterns. We find generating functions for almost-increasing permutations by using their cycle structure to map them to colored Motzkin paths. We also give refined enumerations with respect to the number of cycles, fixed points, excedances, and inversions.     

On rational approximations with denominators from thin sets, ii

In the general case a real irrational number cannot be approximated by infinitely many rationalsp/q involving error terms less than q^-2 when the denominatorsq are taken from a given thin set of positive integers. The distribution of irrationals which are situated in close neighborhoods of infinitely many fractionsp/q, whereq is restricted to the elements of a thin set, depends on the asymptotic behaviour of theq’s and on their arithmetic properties.     

Elasticity in certain block monoids via the Euclidean table

This paper continues the study begun in [GEROLDINGER, A.: On non-unique factorizations into irreducible elements II, Colloq. Math. Soc. János Bolyai 51 (1987), 723–757] concerning factorization properties of block monoids of the form ℬ(ℤ _n , S) where S = (hereafter denoted ℬ _a (n)). We introduce in Section 2 the notion of a Euclidean table and show in Theorem 2.8 how it can be used to identify the irreducible elements of ℬ _a (n). In Section 3 we use the Euclidean table to compute the elasticity of ℬ _a (n) (Theorem 3.4). Section 4 considers the problem, for a fixed value of n, of computing the complete set of elasticities of the ℬ _a (n) monoids. When n = p is a prime integer, Proposition 4.12 computes the three smallest possible elasticities of the ℬ _a (p). Part of this work was completed while the second author was on an Academic Leave granted by the Trinity University Faculty Development Committee.     

Endotypes of partial equivalence relations

We classify all partial equivalence relations according to their endotype with respect to endotopisms and compute the cardinalities of endotopism semigroups (strong endotopism monoids, autotopism groups) of partial equivalence relations on a finite set.