Search

It has been recently observed that fundamental aspects of the classical theory of factorization can be greatly generalized by combining the languages of monoids and preorders. This has led to various theorems on the existence of certain factorizations, herein called $\preceq$-factorizations, for the $\preceq$-non-units of a (multiplicatively written) monoid $H$ endowed with a preorder $\preceq$, where an element $u \in H$ is a $\preceq$-unit if $u \preceq 1_H \preceq u$ and a $\preceq$-non-unit otherwise. The ``building blocks'' of these factorizations are the $\preceq$-irreducibles of $H$ (i.e., the $\preceq$-non-units $a \in H$ that cannot be written as a product of two $\preceq$-non-units each of which is strictly $\preceq$-smaller than $a$); and it is interesting to look for sufficient conditions for the $\preceq$-factorizations of a $\preceq$-non-unit to be bounded in length or finite in number (if measured or counted in a suitable way). This is precisely the kind of questions addressed in the present work, whose main novelty is the study of the interaction between minimal $\preceq$-factorizations (i.e., a refinement of $\preceq$-factorizations used to counter the ``blow-up phenomena'' that are inherent to factorization in non-commutative or non-cancellative monoids) and some finiteness conditions describing the ``local behaviour'' of the pair $(H, \preceq)$. Besides a number of examples and remarks, the paper includes many arithmetic results, a part of which are new already in the basic case where $\preceq$ is the divisibility preorder on $H$ (and hence in the setup of the classical theory)., Comment: 27 pages, 2 figures. Final version to appear in Journal of Algebra

In a 1968 issue of the Proceedings, P. M. Cohn famously claimed that a commutative domain is atomic if and only if it satisfies the ascending chain condition on principal ideals (ACCP). Some years later, a counterexample was however provided by A. Grams, who showed that every commutative domain with the ACCP is atomic, but not vice versa. This has led to the problem of finding a sensible (ideal-theoretic) characterisation of atomicity. The question (explicitly stated on p. 3 of A. Geroldinger and F. Halter–Koch’s 2006 monograph on factorisation) is still open. We settle it here by using the language of monoids and preorders.

We combine the language of monoids with the language of preorders so as to refine some fundamental aspects of the classical theory of factorization and prove an abstract factorization theorem with a variety of applications. In particular, we obtain a generalization, from cancellative to Dedekind-finite (commutative or non-commutative) monoids, of a classical theorem on "atomic factorizations" that traces back to the work of P.M. Cohn in the 1960s; recover a theorem of D.D. Anderson and S. Valdes-Leon on "irreducible factorizations" in commutative rings; improve on a theorem of A.A. Antoniou and the author that characterizes atomicity in certain "monoids of sets" naturally arising from additive number theory and arithmetic combinatorics; and give a monoid-theoretic proof that every module of finite uniform dimension over a (commutative or non-commutative) ring $R$ is a direct sum of finitely many indecomposable modules (this is in fact a special case of a more general decomposition theorem for the objects of certain categories with finite products, where the indecomposable $R$-modules are characterized as the atoms of a suitable "monoid of modules")., Comment: Final version to appear in J. Algebra (24 pages, 1 figure)

An upper quasi-density on $\bf H$ (the integers or the non-negative integers) is a real-valued subadditive function $\mu^\ast$ defined on the whole power set of $\mathbf H$ such that $\mu^\ast(X) \le \mu^\ast({\bf H}) = 1$ and $\mu^\ast(k \cdot X + h) = \frac{1}{k}\, \mu^\ast(X)$ for all $X \subseteq \bf H$, $k \in {\bf N}^+$, and $h \in \bf N$, where $k \cdot X := \{kx: x \in X\}$; and an upper density on $\bf H$ is an upper quasi-density on $\bf H$ that is non-decreasing with respect to inclusion. We say that a set $X \subseteq \bf H$ is small if $\mu^\ast(X) = 0$ for every upper quasi-density $\mu^\ast$ on $\bf H$. Main examples of upper densities are given by the upper analytic, upper Banach, upper Buck, and upper P\'olya densities, along with the uncountable family of upper $\alpha$-densities, where $\alpha$ is a real parameter $\ge -1$ (most notably, $\alpha = -1$ corresponds to the upper logarithmic density, and $\alpha = 0$ to the upper asymptotic density). It turns out that a subset of $\bf H$ is small if and only if it belongs to the zero set of the upper Buck density on $\bf Z$. This allows us to show that many interesting sets are small, including the integers with less than a fixed number of prime factors, counted with multiplicity; the numbers represented by a binary quadratic form with integer coefficients whose discriminant is not a perfect square; and the image of $\bf Z$ through a non-linear integral polynomial in one variable., Comment: 15 pp, no figures. The paper is a sequel of arXiv:1506.04664. Fixed minor details. To appear in The Ramanujan Journal

Recently introduced by the authors in [Proc. Edinb. Math. Soc. 60 (2020), 139-167], quasi-densities form a large family of real-valued functions partially defined on the power set of the integers that serve as a unifying framework for the study of many known densities (including the asymptotic density, the Banach density, the logarithmic density, the analytic density, and the P\'olya density). We further contribute to this line of research by proving that (i) for each $n \in \mathbf N^+$ and $\alpha \in [0,1]$, there is $A \subseteq \mathbf{N}$ with $kA \in \text{dom}(\mu)$ and $\mu(kA) = \alpha k/n$ for every quasi-density $\mu$ and every $k=1,\ldots, n$, where $kA:=A+\cdots+A$ is the $k$-fold sumset of $A$ and $\text{dom}(\mu)$ denotes the domain of definition of $\mu$; (ii) for each $\alpha \in [0,1]$ and every non-empty finite $B\subseteq \mathbf{N}$, there is $A \subseteq \mathbf{N}$ with $A+B \in \mathrm{dom}(\mu)$ and $\mu(A+B)=\alpha$ for every quasi-density $\mu$; (iii) for each $\alpha \in [0,1]$, there exists $A\subseteq \mathbf{N}$ with $2A = \mathbf{N}$ such that $A \in \text{dom}(\mu)$ and $\mu(A) = \alpha$ for every quasi-density $\mu$. Proofs rely on the properties of a little known density first considered by R.C. Buck and the "structure" of the set of all quasi-densities; in particular, they are rather different than previously known proofs of special cases of the same results., Comment: 13 pages, to appear in Monatshefte f\"ur Mathematik. We fixed a gap in the old "proof" of Theorem 3.1, which made it necessary to improve on Proposition 2.4 (that is, Proposition 2.3 in the previous version of the paper)

Given $k, \ell \in {\bf N}^+$, let $x_{i,j}$ be, for $1 \le i \le k$ and $0 \le j \le \ell$, some fixed integers, and define, for every $n \in {\bf N}^+$, $s_n := \sum_{i=1}^k \prod_{j=0}^\ell x_{i,j}^{n^j}$. We prove that the following are equivalent: (a) There are a real $\theta > 1$ and infinitely many indices $n$ for which the number of distinct prime factors of $s_n$ is greater than the super-logarithm of $n$ to base $\theta$. (b) There do not exist non-zero integers $a_0,b_0,\ldots,a_\ell,b_\ell $ such that $s_{2n}=\prod_{i=0}^\ell a_i^{(2n)^i}$ and $s_{2n-1}=\prod_{i=0}^\ell b_i^{(2n-1)^i}$ for all $n$. We will give two different proofs of this result, one based on a theorem of Evertse (yielding, for a fixed finite set of primes $\mathcal S$, an effective bound on the number of non-degenerate solutions of an $\mathcal S$-unit equation in $k$ variables over the rationals) and the other using only elementary methods. As a corollary, we find that, for fixed $c_1, x_1, \ldots,c_k, x_k \in \mathbf N^+$, the number of distinct prime factors of $c_1 x_1^n+\cdots+c_k x_k^n$ is bounded, as $n$ ranges over $\mathbf N^+$, if and only if $x_1=\cdots=x_k$., Comment: 10 pp., no figures. Fixed various mistakes around Lemma 2. To appear in Journal of Number Theory

Let $\mathcal{P}({\bf N})$ be the power set of ${\bf N}$. We say that a function $\mu^\ast: \mathcal{P}({\bf N}) \to \bf R$ is an upper density if, for all $X,Y\subseteq{\bf N}$ and $h, k\in{\bf N}^+$, the following hold: (F1) $\mu^\ast({\bf N}) = 1$; (F2) $\mu^\ast(X) \le \mu^\ast(Y)$ if $X \subseteq Y$; (F3) $\mu^\ast(X \cup Y) \le \mu^\ast(X) + \mu^\ast(Y)$; (F4) $\mu^\ast(k\cdot X) = \frac{1}{k} \mu^\ast(X)$, where $k \cdot X:=\{kx: x \in X\}$; (F5) $\mu^\ast(X + h) = \mu^\ast(X)$. We show that the upper asymptotic, upper logarithmic, upper Banach, upper Buck, upper Polya, and upper analytic densities, together with all upper $\alpha$-densities (with $\alpha$ a real parameter $\ge -1$), are upper densities in the sense of our definition. Moreover, we establish the mutual independence of axioms (F1)-(F5), and we investigate various properties of upper densities (and related functions) under the assumption that (F2) is replaced by the weaker condition that $\mu^\ast(X)\le 1$ for every $X\subseteq{\bf N}$. Overall, this allows us to extend and generalize results so far independently derived for some of the classical upper densities mentioned above, thus introducing a certain amount of unification into the theory., Comment: 26 pp, no figs. Added a 'Note added in proof' at the end of Sect. 7 to answer Question 6. Final version to appear in Proc. Edinb. Math. Soc. (the paper is a prequel of arXiv:1510.07473)

Primary and strongly primary monoids and domains play a central role in the ideal and factorization theory of commutative monoids and domains. It is well-known that primary monoids satisfying the ascending chain condition on divisorial ideals (e.g., numerical monoids) are strongly primary; and the multiplicative monoid of non-zero elements of a one-dimensional local domain is primary and it is strongly primary if the domain is Noetherian. In the present paper, we focus on the study of additive submonoids of the non-negative rationals, called Puiseux monoids. It is easy to see that Puiseux monoids are primary monoids, and we provide conditions ensuring that they are strongly primary. Then we study local and global tameness of strongly primary Puiseux monoids; most notably, we establish an algebraic characterization of when a Puiseux monoid is globally tame. Moreover, we obtain a result on the structure of sets of lengths of all locally tame strongly primary monoids., 25 pages. It will appear in Journal of Algebra

Let $H$ be a transfer Krull monoid over a subset $G_0$ of an abelian group $G$ with finite exponent. Then every non-unit $a\in H$ can be written as a finite product of atoms, say $a=u_1 \cdot \ldots \cdot u_k$. The set $\mathsf L(a)$ of all possible factorization lengths $k$ is called the set of lengths of $a$, and $H$ is said to be half-factorial if $|\mathsf L(a)|=1$ for all $a\in H$. We show that, if $a \in H$ and $|\mathsf L(a^{\lfloor (3\exp(G) - 3)/2 \rfloor})| = 1$, then the smallest divisor-closed submonoid of $H$ containing $a$ is half-factorial. In addition, we prove that, if $G_0$ is finite and $|\mathsf L(\prod_{g\in G_0}g^{2\mathsf{ord}(g)})|=1$, then $H$ is half-factorial.

We introduce the sequence of generalized Goncarov polynomials, which is a basis for the solutions to the Goncarov interpolation problem with respect to a delta operator. Explicitly, a generalized Goncarov basis is a sequence $(t_n(x))_{n \ge 0}$ of polynomials defined by the biorthogonality relation $\varepsilon_{z_i}(\mathfrak d^{i}(t_n(x))) = n! \;\! \delta_{i,n}$ for all $i,n \in \mathbf N$, where $\mathfrak d$ is a delta operator, $\mathcal Z = (z_i)_{i \ge 0}$ a sequence of scalars, and $\varepsilon_{z_i}$ the evaluation at $z_i$. We present algebraic and analytic properties of generalized Goncarov polynomials and show that such polynomial sequences provide a natural algebraic tool for enumerating combinatorial structures with a linear constraint on their order statistics.

Let $H$ be a multiplicatively written monoid with identity $1_H$ (in particular, a group). We denote by $\mathcal P_{\rm fin,\times}(H)$ the monoid obtained by endowing the collection of all finite subsets of $H$ containing a unit with the operation of setwise multiplication $(X,Y) \mapsto \{xy: x \in X, y \in Y\}$; and study fundamental features of the arithmetic of this and related structures, with a focus on the submonoid, $\mathcal P_{\text{fin},1}(H)$, of $\mathcal P_{\text{fin},\times}(H)$ consisting of all finite subsets $X$ of $H$ with $1_H \in X$. Among others, we prove that $\mathcal{P}_{\text{fin},1}(H)$ is atomic (i.e., each non-unit is a product of irreducibles) iff $1_H \ne x^2 \ne x$ for every $x \in H \setminus \{1_H\}$. Then we obtain that $\mathcal{P}_{\text{fin},1}(H)$ is BF (i.e., it is atomic and every element has factorizations of bounded length) iff $H$ is torsion-free; and show how to transfer these conclusions to $\mathcal P_{\text{fin},\times}(H)$. Next, we introduce "minimal factorizations" to account for the fact that monoids may have non-trivial idempotents, in which case standard definitions from Factorization Theory degenerate. Accordingly, we obtain conditions for $\mathcal P_{\text{fin},\times}(H)$ to be BmF (meaning that each non-unit has minimal factorizations of bounded length); and for $\mathcal{P}_{\text{fin},1}(H)$ to be BmF, HmF (i.e., a BmF-monoid where all the minimal factorizations of a given element have the same length), or minimally factorial (i.e., a BmF-monoid where each element has an essentially unique minimal factorization). Finally, we prove how to realize certain intervals as sets of minimal lengths in $\mathcal P_{\text{fin},1}(H)$. Many proofs come down to considering sumset decompositions in cyclic groups, so giving rise to an intriguing interplay with Arithmetic Combinatorics., Comment: 23 pp., 1 figure (on p. 4). Fixed minor details and added Sect. 2.4 and Remarks 4.2 and 4.6. To appear in Pacific Journal of Mathematics

Let $H$ be a multiplicatively written monoid. Given $k\in{\bf N}^+$, we denote by $\mathscr U_k$ the set of all $\ell\in{\bf N}^+$ such that $a_1\cdots a_k=b_1\cdots b_\ell$ for some atoms $a_1,\ldots,a_k,b_1,\ldots,b_\ell\in H$. The sets $\mathscr U_k$ are one of the most fundamental invariants studied in the theory of non-unique factorization, and understanding their structure is a basic problem in the field: In particular, it is known that, in many cases of interest, these sets are almost arithmetic progressions with the same difference and bound for all large $k$, namely, $H$ satisfies the Structure Theorem for Unions. The present paper improves the current state of the art on this problem. More precisely, we show that, under mild assumptions on $H$, not only does the Structure Theorem for Unions hold, but there also exists $\mu\in{\bf N}^+$ such that, for every $M\in{\bf N}$, the sequences $$ \bigl((\mathscr U_k-\inf\mathscr U_k)\cap[\![0,M]\!]\bigr)_{k\ge 1} \quad\text{and}\quad \bigl((\sup\mathscr U_k-\mathscr U_k)\cap[\![0,M]\!]\bigr)_{k\ge 1} $$ are $\mu$-periodic from some point on. The result applies, e.g., to (the multiplicative monoid of) all commutative Krull domains (e.g., Dedekind domains) with finite class group; a variety of weakly Krull commutative domains (including all orders in number fields with finite elasticity); some maximal orders in central simple algebras over global fields; and all numerical monoids. Large parts of the proofs are worked out in a "purely additive model", by inquiring into the properties of what we call a subadditive family, i.e., a collection $\mathscr L$ of subsets of $\bf N$ such that, for all $L_1,L_2\in\mathscr L$, there is $L\in\mathscr L$ with $L_1+L_2\subseteq L$., Comment: 22 pp., no figures. Fixed a few typos and updated statements and definitions after realizing that what is proved in the paper is slighly stronger than what claimed in the previous version. To appear in Israel Journal of Mathematics

Davide Massidda,1 Ines Giorgi,2 Giulio Vidotto,3 Salvatore Tringali,4 Marcello Imbriani,4,5 Paola Baiardi,6 Giorgio Bertolotti7 1Giunti O.S. Organizzazioni Speciali, Firenze, Italy; 2Psychology Unit, ICS Maugeri, IRCCS, Pavia, Italy; 3Department of General Psychology, University of Padova, Padova, Italy; 4ICS Maugeri, IRCCS, UOOML, Pavia, Italy; 5Department of Public Health, Experimental and Forensic Medicine, University of Pavia, Pavia, Italy; 6Scientific Direction, ICS Maugeri, IRCCS, Pavia, Italy; 7Psychology Unit, ICS Maugeri, IRCCS, Tradate, Italy Introduction and objectives: A multidimensional self-report questionnaire to evaluate job-related stress factors is presented. The questionnaire, called Maugeri Stress Index – reduced form (MASI-R), aims to assess the impact of job strain on a team or on a single worker by considering four domains: wellness, resilience, perception of social support, and reactions to stressful situations. Material and methods: The reliability of a first longer version (47 items) of the questionnaire was evaluated by an internal consistency analysis and a confirmatory factor analysis. An item reduction procedure was implemented to obtain a short form of the instrument, and the psychometric properties of the resulting instrument were evaluated using the Rasch measurement model. Results: A total of 14 items from the initial pool were deleted because they were not productive for measurement. The analysis of internal consistency led to the exclusion of eight items, while the analysis performed using structural equation models led to the exclusion of another six items. According to the Rasch model, item properties and the reliability of the instruments appear good, especially for the scales for wellness and resilience. In contrast, the scales for perception of social support and negative coping styles show a lower internal consistency. Conclusions: The Maugeri Stress Index – reduced form provides a reliable and valid measure, useful for early identification of stress levels in workers or in a team along the eustress–vadistress continuum. Keywords: occupational stress, stress, psychometrics, questionnaire, validation

Let $(X, \mathscr{L}, \lambda)$ and $(Y, \mathscr{M}, \mu)$ be finite measure spaces for which there exist $A \in \mathscr{L}$ and $B \in \mathscr{M}$ with $0 < \lambda(A) < \lambda(X)$ and $0 < \mu(B) < \mu(Y)$, and let $I\subseteq \mathbf{R}$ be a non-empty interval. We prove that, if $f$ and $g$ are continuous bijections $I \to \mathbf{R}^+$, then the equation $$ f^{-1}\!\left(\int_X f\!\left(g^{-1}\!\left(\int_Y g \circ h\;d\mu\right)\right)d \lambda\right)\! = g^{-1}\!\left(\int_Y g\!\left(f^{-1}\!\left(\int_X f \circ h\;d\lambda\right)\right)d \mu\right)$$ is satisfied by every $\mathscr{L} \otimes \mathscr{M}$-measurable simple function $h: X \times Y \to I$ if and only if $f=c g$ for some $c \in \mathbf{R}^+$ (it is easy to see that the equation is well posed). An analogous, but essentially different, result, with $f$ and $g$ replaced by continuous injections $I \to \mathbf R$ and $\lambda(X)=\mu(Y)=1$, was recently obtained in [Indag. Math. 27 (2016), 945-953]., Comment: 5 pages, no figures. To appear in Acta Mathematica Hungarica. The paper is a sequel of arXiv:1503.01139

We extend a few fundamental aspects of the classical theory of non-unique factorization, as presented in Geroldinger and Halter-Koch's 2006 monograph on the subject, to a non-commutative and non-cancellative setting, in the same spirit of Baeth and Smertnig's work on the factorization theory of non-commutative, but cancellative monoids [J. Algebra 441 (2015), 475-551]. Then, we bring in power monoids and, applying the abstract machinery developed in the first part, we undertake the study of their arithmetic. More in particular, let $H$ be a multiplicatively written monoid. The set $\mathcal P_{\rm fin}(H)$ of all non-empty finite subsets of $H$ is naturally made into a monoid, which we call the power monoid of $H$ and is non-cancellative unless $H$ is trivial, by endowing it with the operation $(X,Y) \mapsto \{xy: (x,y) \in X \times Y\}$. Power monoids are, in disguise, one of the primary objects of interest in arithmetic combinatorics, and here for the first time we tackle them from the perspective of factorization theory. Proofs lead to consider various properties of finite subsets of $\mathbf N$ that can or cannot be split into a sumset in a non-trivial way, which gives rise to a rich interplay with additive number theory., 34 pp., no figures. Final version to appear in Journal of Algebra

Let $\mathcal{P}({\bf N})$ be the power set of $\bf N$. An upper density (on $\bf N$) is a non\-decreasing and subadditive function $\mu^\ast: \mathcal{P}({\bf N})\to\bf R$ such that $\mu^\ast({\bf N}) = 1$ and $\mu^\ast(k \cdot X + h) = \frac{1}{k} \mu^\ast(X)$ for all $X \subseteq \bf N$ and $h,k \in {\bf N}^+$, where $k \cdot X + h := \{kx + h: x \in X\}$. The upper asymptotic, upper Banach, upper logarithmic, upper Buck, upper P\'olya, and upper analytic densities are examples of upper densities. We show that every upper density $\mu^\ast$ has the strong Darboux property, and so does the associated lower density, where a function $f: \mathcal P({\bf N}) \to \bf R$ is said to have the strong Darboux property if, whenever $X \subseteq Y \subseteq \bf N$ and $a \in [f(X),f(Y)]$, there is a set $A$ such that $X\subseteq A\subseteq Y$ and $f(A)=a$. In fact, we prove the above under the assumption that the monotonicity of $\mu^\ast$ is relaxed to the weaker condition that $\mu^\ast(X) \le 1$ for every $X \subseteq \bf N$., Comment: 10 pages, no figures. Fixed minor details and streamlined the exposition. To appear in Journal of Number Theory

We describe the implementation of a *MATLAB experimental framework for the data conversion of magnetic-resonance (MRI) images to contrast maps. This is done for use in microwave breast cancer detection via the contrast source (CS) model (although the underlying logic can be adapted quite easily to different contexts and applications). The framework is conceived to relieve interested developers from most of the programming burden, and to provide final users with a friendly, consistent approach to the numerical simulations.

In this paper a technique to protect the Method of Moments solution of the E-Field Integral Equation (EFIE) for the scattering by conducting body from effects of its internal resonances, is presented. This method is based on the evaluation of the numerical null space K of the discretized EFIE operator. In order to verify its effectiveness, results for the plane wave scattering from a perfect conducting cube are presented. It is shown that the proposed method is able to give the correct value of the RCS even in presence of the interior resonances.

Classical Gon\v{c}arov polynomials are polynomials which interpolate derivatives. Delta Gon\v{c}arov polynomials are polynomials which interpolate delta operators, e.g., forward and backward difference operators. We extend fundamental aspects of the theory of classical bivariate Gon\v{c}arov polynomials and univariate delta Gon\v{c}arov polynomials to the multivariate setting using umbral calculus. After introducing systems of delta operators, we define multivariate delta Gon\v{c}arov polynomials, show that the associated interpolation problem is always solvable, and derive a generating function (an Appell relation) for them. We show that systems of delta Gon\v{c}arov polynomials on an interpolation grid $Z \subseteq \mathbb{R}^d$ are of binomial type if and only if $Z = A\mathbb{N}^d$ for some $d\times d$ matrix $A$. This motivates our definition of delta Abel polynomials to be exactly those delta Gon\v{c}arov polynomials which are based on such a grid. Finally, compact formulas for delta Abel polynomials in all dimensions are given for separable systems of delta operators. This recovers a former result for classical bivariate Abel polynomials and extends previous partial results for classical trivariate Abel polynomials to all dimensions., Comment: 20 pages, no figures

The Cathedral of Noto partially collapsed on 13 March, 1996. After the removal of the ruins a 1-year experimental investigation and analytical calculation allowed to define the causes of the collapse and the presence of intrinsic weaknesses of the structure and to prepare on this basis a project, which can be called Redesign for improvement of the structure. Some theoretical definitions are given together with the economical and social aspects of the project. A first part of the project description is reported concerning the cross vaults system restoration.

Let $f$ and $g$ be real-valued continuous injections defined on a non-empty real interval $I$, and let $(X, \mathscr{L}, \lambda)$ and $(Y, \mathscr{M}, \mu)$ be probability spaces in each of which there is at least one measurable set whose measure is strictly between $0$ and $1$. We say that $(f,g)$ is a $(\lambda, \mu)$-switch if, for every $\mathscr{L} \otimes \mathscr{M}$-measurable function $h: X \times Y \to \mathbf{R}$ for which $h[X\times Y]$ is contained in a compact subset of $I$, it holds $$ f^{-1}\!\left(\int_X f\!\left(g^{-1}\!\left(\int_Y g \circ h\;d\mu\right)\right)d \lambda\right)\! = g^{-1}\!\left(\int_Y g\!\left(f^{-1}\!\left(\int_X f \circ h\;d\lambda\right)\right)d \mu\right)\!, $$ where $f^{-1}$ is the inverse of the corestriction of $f$ to $f[I]$, and similarly for $g^{-1}$. We prove that this notion is well-defined, by establishing that the above functional equation is well-posed (the equation can be interpreted as a permutation of generalized means and raised as a problem in the theory of decision making under uncertainty), and show that $(f,g)$ is a $(\lambda, \mu)$-switch if and only if $f = ag + b$ for some $a,b \in \mathbf R$, $a \ne 0$., Comment: 9 pages, no figures. Fixed minor details. Final version to appear in Indagationes Mathematicae

Let $H$ be a commutative semigroup with unit element such that every non-unit can be written as a finite product of irreducible elements (atoms). For every $k \in \mathbb N$, let $\mathscr U_k (H)$ denote the set of all $\ell \in \mathbb N$ with the property that there are atoms $u_1, \ldots, u_k, v_1, \ldots, v_{\ell}$ such that $u_1 \cdot \ldots \cdot u_k = v_1 \cdot \ldots \cdot v_{\ell}$ (thus, $\mathscr U_k (H)$ is the union of all sets of lengths containing $k$). The Structure Theorem for Unions states that, for all sufficiently large $k$, the sets $\mathscr U_k (H)$ are almost arithmetical progressions with the same difference and global bound. We present a new approach to this result in the framework of arithmetic combinatorics, by deriving, for suitably defined families of subsets of the non-negative integers, a characterization of when the Structure Theorem holds. This abstract approach allows us to verify, for the first time, the Structure Theorem for a variety of possibly non-cancellative semigroups, including semigroups of (not necessarily invertible) ideals and semigroups of modules. Furthermore, we provide the very first example of a semigroup (actually, a locally tame Krull monoid) that does not satisfy the Structure Theorem., 34 pages, no figures; fixed minor details and made editorial changes; to appear in Journal of Algebra and its Applications

Workplace mobbing represents a severe type of occupational stress. The aim of this study is to evaluate the discriminant validity of the Maugeri Stress Index-Revised questionnaire (MASI-R) for the perceived work stress assessment.A total of 105 patients were enrolled at the Occupational Medicine Uinit of our Institute for mobbing-related issues; they were compared to a control group matched for age, sex and professional category. Work stress perception was assessed in both samples using the self-report questionnaire MASI-R, which is the Maugeri Stress Index short form.Workers who perceived exposure to mobbing scored significantly lower compared to the control group in the four MASI-R scales (p0.001) and in the two visual analogue scales measuring job satisfaction (p0.001) and life satisfaction (p0.001). Further analyses have identified the items which significant discriminate between the two groups of workers.These findings show a good discriminant validity of the MASI-R questionnaire: workers who perceived exposure to workplace mobbing reveal higher work stress levels compared to the control group in all aspects measured.

Given an additively written abelian group $G$ and a set $X\subseteq G$, we let $\mathscr{B}(X)$ denote the monoid of zero-sum sequences over $X$ and $\mathsf{D}(X)$ the Davenport constant of $\mathscr{B}(X)$, namely the supremum of the positive integers $n$ for which there exists a sequence $x_1 \cdots x_n$ of $\mathscr{B}(X)$ such that $\sum_{i \in I} x_i \ne 0$ for each non-empty proper subset $I$ of $\{1, \ldots, n\}$. In this paper, we mainly investigate the case when $G$ is a power of $\mathbb{Z}$ and $X$ is a box (i.e., a product of intervals of $G$). Some mixed sets (e.g., the product of a group by a box) are studied too, and some inverse results are obtained., 23 pages, no figures; fixed minor mistakes; added a new reference

We address the "sums of dilates problem" by looking for non-trivial lower bounds on sumsets of the form $k \cdot X + l \cdot X$, where $k$ and $l$ are non-zero integers and $X$ is a subset of a possibly non-abelian group $G$ (written additively). In particular, we investigate the extension of some results so far known only for the integers to the context of torsion-free or linearly orderable groups, either abelian or not., Comment: 15 pages, no figures; added new references and some comments in Section 2

Let $\mathbb{A} = (A, +)$ be a (possibly non-commutative) semigroup. For $Z \subseteq A$ we define $Z^\times := Z \cap \mathbb A^\times$, where $\mathbb A^\times$ is the set of the units of $\mathbb{A}$, and $$\gamma(Z) := \sup_{z_0 \in Z^\times} \inf_{z_0 \ne z \in Z} {\rm ord}(z - z_0).$$ The paper investigates some properties of $\gamma(\cdot)$ and shows the following extension of the Cauchy-Davenport theorem: If $\mathbb A$ is cancellative and $X, Y \subseteq A$, then $$|X+Y| \ge \min(\gamma(X+Y),|X| + |Y| - 1).$$ This implies a generalization of Kemperman's inequality for torsion-free groups and strengthens another extension of the Cauchy-Davenport theorem, where $\mathbb{A}$ is a group and $\gamma(X+Y)$ in the above is replaced by the infimum of $|S|$ as $S$ ranges over the non-trivial subgroups of $\mathbb{A}$ (Hamidoune-K\'arolyi theorem)., Comment: To appear in Mathematika (12 pages, no figures; the paper is a sequel of arXiv:1210.4203v4; shortened comments and proofs in Sections 3 and 4; refined the statement of Conjecture 6 and added a note in proof at the end of Section 6 to mention that the conjecture is true at least in another non-trivial case)

Given an integer $n \ge 3$, let $u_1, \ldots, u_n$ be pairwise coprime integers $\ge 2$, $\mathcal D$ a family of nonempty proper subsets of $\{1, \ldots, n\}$ with "enough" elements, and $\varepsilon$ a function $ \mathcal D \to \{\pm 1\}$. Does there exist at least one prime $q$ such that $q$ divides $\prod_{i \in I} u_i - \varepsilon(I)$ for some $I \in \mathcal D$, but it does not divide $u_1 \cdots u_n$? We answer this question in the positive when the $u_i$ are prime powers and $\varepsilon$ and $\mathcal D$ are subjected to certain restrictions. We use the result to prove that, if $\varepsilon_0 \in \{\pm 1\}$ and $A$ is a set of three or more primes that contains all prime divisors of any number of the form $\prod_{p \in B} p - \varepsilon_0$ for which $B$ is a finite nonempty proper subset of $A$, then $A$ contains all the primes., 13 pp, to appear in Journal de Th\'eorie des Nombres de Bordeaux. Fixed a number of typos (particularly, in the proof of Theorem 1.3). Abridged the part on the lifting-the-exponent lemma. Slightly simplified the formulation of Question 1. Added a new question (viz., Question 4 in this version). "Generalized" Theorem 1.3 (a hypothesis in the old statement was "evidently" useless)

Let $\mathbb{A} = (A, \cdot)$ be a semigroup. We generalize some recent results by G. A. Freiman, M. Herzog and coauthors on the structure theory of set addition from the context of linearly orderable groups to linearly orderable semigroups, where we say that $\mathbb{A}$ is linearly orderable if there exists a total order $\le$ on $A$ such that $xz < yz$ and $zx < zy$ for all $x,y,z \in A$ with $x < y$. In particular, we find that if $S$ is a finite subset of $A$ generating a non-abelian subsemigroup of $\mathbb{A}$, then $|S^2| \ge 3|S|-2$. On the road to this goal, we also prove a number of subsidiary results, and most notably that for $S$ a finite subset of $A$ the commutator and the normalizer of $S$ are equal to each other., To appear in Semigroup Forum. Fixed a (serious) typo in the statement of the main theorem

Source Type Integral Equations (STIEs) provide interesting alternative formulations for the scattering from dielectric objects. In particular, the underlying operators factor into the composition product of two other linear operators, whose norms can be separately evaluated with the aid of suitable universal diagrams. Then, a specific inequality suggests that the convergence of the formal Neumann series inverting the original integral equation can be established by means of the aforementioned tools. Anyway, such an inequality sometimes provides pessimistic (i.e. stronger than actually needed) conditions in many cases of practical interest. The previous observation motivated the authors to further investigations, so leading to sharper bounds on the relevant norm of the STIEs operators. Numerical examples are reported, confirming the usefulness of the new tools.

It is well established in literature that the rate of convergence of the Generalized Minimum Residual Method (GMRES), when it is applied to the solution of the (generally dense and unstructured) linear systems of equations coming out from the discretization process of the Electrical Field Integral Equation (EFIE) through the Method of Moments (MoM), can be significantly improved by a suitable preconditioning strategy. Along those lines the present paper inquiries the advantages of employing an easy-to-build algebraic preconditioner based on some expected properties of the skew-Hermitian part S of the MoM impedance matrix Z. Some numerical results are presented in order to evaluate its performances and numerically validate the proposed approach.