Facets of the <Emphasis Type="Italic">r</Emphasis>-Stable (<Emphasis Type="Italic">n</Emphasis>, <Emphasis Type="Italic">k</Emphasis>)-Hypersimplex

Let k, n, and r be positive integers with k < n and \({r \leq \lfloor \frac{n}{k} \rfloor}\). We determine the facets of the r-stable n, k-hypersimplex. As a result, it turns out that the r-stable n, k-hypersimplex has exactly 2n facets for every \({r < \lfloor \frac{n}{k} \rfloor}\). We then utilize the equations of the facets to study when the r-stable hypersimplex is Gorenstein. For every k > 0 we identify an infinite collection of Gorenstein r-stable hypersimplices, consequently expanding the collection of r-stable hypersimplices known to have unimodal Ehrhart \({\delta}\)-vectors.     

On the Second Parameter of an (<Emphasis Type="Italic">m</Emphasis>, <Emphasis Type="Italic">p</Emphasis>)-Isometry

A bounded linear operator T on a Banach space X is called an (m, p)-isometry if it satisfies the equation \({\sum_{k=0}^{m}(-1)^{k} {m \choose k}\|T^{k}x\|^{p}=0}\) , for all \({x \in X}\) . In this paper we study the structure which underlies the second parameter of (m, p)-isometric operators. We concentrate on determining when an (m, p)-isometry is a (μ, q)-isometry for some pair (μ, q). We also extend the definition of (m, p)-isometry, to include p = ∞ and study basic properties of these (m, ∞)-isometries.     

On a new property of <Emphasis Type="Italic">n</Emphasis>-poised and <Emphasis Type="Italic">G</Emphasis><Emphasis Type="Italic">C</Emphasis><Subscript><Emphasis Type="Italic">n</Emphasis></Subscript> sets

In this paper we consider n-poised planar node sets, as well as more special ones, called G C _n sets. For the latter sets each n-fundamental polynomial is a product of n linear factors as it always holds in the univariate case. A line ? is called k-node line for a node set \(\mathcal X\) if it passes through exactly k nodes. An (n + 1)-node line is called maximal line. In 1982 M. Gasca and J. I. Maeztu conjectured that every G C _n set possesses necessarily a maximal line. Till now the conjecture is confirmed to be true for n ≤ 5. It is well-known that any maximal line M of \(\mathcal X\) is used by each node in \(\mathcal X\setminus M, \)meaning that it is a factor of the fundamental polynomial. In this paper we prove, in particular, that if the Gasca-Maeztu conjecture is true then any n-node line of G C _n set \(\mathcal {X}\) is used either by exactly \(\binom {n}{2}\) nodes or by exactly \(\binom {n-1}{2}\) nodes. We prove also similar statements concerning n-node or (n ? 1)-node lines in more general n-poised sets. This is a new phenomenon in n-poised and G C _n sets. At the end we present a conjecture concerning any k-node line.     

<Emphasis Type="Italic">n</Emphasis>-Abelian and <Emphasis Type="Italic">n</Emphasis>-exact categories

We introduce n-abelian and n-exact categories, these are analogs of abelian and exact categories from the point of view of higher homological algebra. We show that n-cluster-tilting subcategories of abelian (resp. exact) categories are n-abelian (resp. n-exact). These results allow to construct several examples of n-abelian and n-exact categories. Conversely, we prove that n-abelian categories satisfying certain mild assumptions can be realized as n-cluster-tilting subcategories of abelian categories. In analogy with a classical result of Happel, we show that the stable category of a Frobenius n-exact category has a natural \((n+2)\)-angulated structure in the sense of Geiß–Keller–Oppermann. We give several examples of n-abelian and n-exact categories which have appeared in representation theory, commutative algebra, commutative and non-commutative algebraic geometry.     

<Emphasis Type="Italic">C</Emphasis>*-simplicity of <Emphasis Type="Italic">n</Emphasis>-periodic products

The C*-simplicity of n-periodic products is proved for a large class of groups. In particular, the n-periodic products of any finite or cyclic groups (including the free Burnside groups) are C*-simple. Continuum-many nonisomorphic 3-generated nonsimple C*-simple groups are constructed in each of which the identity xⁿ = 1 holds, where n ≥ 1003 is any odd number. The problem of the existence of C*-simple groups without free subgroups of rank 2 was posed by de la Harpe in 2007.     

On (<Emphasis Type="Italic">m</Emphasis>, <Emphasis Type="Italic">n</Emphasis>)-absorbing ideals of commutative rings

Let R be a commutative ring with 1 ≠ 0 and U(R) be the set of all unit elements of R. Let m, n be positive integers such that m > n. In this article, we study a generalization of n-absorbing ideals. A proper ideal I of R is called an (m, n)-absorbing ideal if whenever a ₁?a _m ∈I for a ₁,…, a _m ∈R?U(R), then there are n of the a _i ’s whose product is in I. We investigate the stability of (m, n)-absorbing ideals with respect to various ring theoretic constructions and study (m, n)-absorbing ideals in several commutative rings. For example, in a Bézout ring or a Boolean ring, an ideal is an (m, n)-absorbing ideal if and only if it is an n-absorbing ideal, and in an almost Dedekind domain every (m, n)-absorbing ideal is a product of at most m ? 1 maximal ideals.     

Exponentially Many Monochromatic <Emphasis Type="Italic">n</Emphasis>-Matchings in <Emphasis Type="Italic">K</Emphasis><Subscript>3<Emphasis Type="Italic">n</Emphasis>-1</Subscript>

Erdös et al and Gerencsér et al had shown that in any 2-edge-coloring of K _3n-1, there is a n-matching containing edges with the same color(we call such matching monochromatic matching). In this paper we show that for any 2-edge-coloring of K _3n-1 there exists a monochromatic subgraph H of K _3n-1 which contains exponentially many monochromatic n-matchings.     

Cocyclic <Emphasis Type="Italic">n</Emphasis>-groups

We describe all cocyclic n-groups and the structure of (n, 2)-rings of endomorphisms of cocyclic n-groups. We prove that a cocyclic n-group is defined uniquely by its (n, 2)-ring of endomorphisms.     

<Emphasis Type="Italic">X</Emphasis>-decomposable finite groups for <Emphasis Type="Italic">X</Emphasis>={1, <Emphasis Type="Italic">m</Emphasis>, <Emphasis Type="Italic">m</Emphasis> + 1, <Emphasis Type="Italic">m</Emphasis> + 2}

A normal subgroup N of a finite group G is called n-decomposable in G if N is the union of n distinct G-conjugacy classes. We study the structure of nonperfect groups in which every proper nontrivial normal subgroup is m-decomposable, m+1-decomposable, or m+2-decomposable for some positive integer m. Furthermore, we give classification for the soluble case.     

The Center of <Emphasis Type="Italic">Dist</Emphasis> (<Emphasis Type="Italic">GL</Emphasis>(<Emphasis Type="Italic">m</Emphasis>|<Emphasis Type="Italic">n</Emphasis>)) in Positive Characteristic

The purpose of this paper is to investigate central elements in distribution algebras D i s t(G) of general linear supergroups G = G L(m|n). As an application, we compute explicitly the center of D i s t(G L(1|1)) and its image under Harish-Chandra homomorphism.     

On Linear Preservers of Two-Sided Gut-Majorization On <Emphasis Type="Bold">M</Emphasis><Subscript><Emphasis Type="Italic">n</Emphasis>,<Emphasis Type="Italic">m</Emphasis></Subscript>

For X, Y ∈ M_n,m it is said that X is gut-majorized by Y, and we write X ?_gutY, if there exists an n-by-n upper triangular g-row stochastic matrix R such that X = RY. Define the relation ~_gut as follows. X ~_gutY if X is gut-majorized by Y and Y is gut-majorized by X. The (strong) linear preservers of ?_gut on ?ⁿ and strong linear preservers of this relation on M_n,m have been characterized before. This paper characterizes all (strong) linear preservers and strong linear preservers of ~_gut on ?ⁿ and M_n,m.     

The characterization problem for designs with the parameters of AG<Subscript>d</Subscript>(<Emphasis Type="Italic">n</Emphasis>, <Emphasis Type="Italic">q</Emphasis>)

We start a new characterization of the geometric 2-design AG _d (n,q) among all simple 2-designs with the same parameters by handling the cases d ∈ {1,2,3,n — 2}. For d ≠ 1, our characterization is in terms of line sizes, and for d = 1 in terms of the number of affine hyperplanes. We also show that the number of non-isomorphic resolvable designs with the parameters of AG₁(n,q) grows exponentially with linear growth of n.     

Free <Emphasis Type="Italic">n</Emphasis>-Tuple Semigroups

The present paper is devoted to the study of n-tuple semigroups. A free n-tuple semigroup of arbitrary rank is constructed and, as a consequence, singly generated free n-tuple semigroups are characterized. Moreover, examples of n-tuple semigroups are presented, the independence of the n-tuple semigroup axioms is proved, and it is shown that the natural semigroups of the constructed free n-tuple semigroup are isomorphic and the automorphism group of this n-tuple semigroup is isomorphic to a symmetric group.     

Note edge-colourings of <Emphasis Type="Italic">K</Emphasis><Subscript><Emphasis Type="Italic">n,n</Emphasis></Subscript> with no long two-coloured cycles

Consider the set of all proper edge-colourings of a graph G with n colours. Among all such colourings, the minimum length of a longest two-coloured cycle is denoted L(n, G). The problem of understanding L(n, G) was posed by Häggkvist in 1978 and, specifically, L(n, K _n,n ) has received recent attention. Here we construct, for each prime power q ≥ 8, an edge-colouring of K _n,n with n colours having all two-coloured cycles of length ≤ 2q ², for integers n in a set of density 1 ? 3/(q ? 1). One consequence is that L(n, K _n,n ) is bounded above by a polylogarithmic function of n, whereas the best known general upper bound was previously 2n ? 4.     

On <Emphasis Type="Italic">n</Emphasis>-cubic Pyramid Algebras

In this paper we study a class of algebras having n-dimensional pyramid shaped quiver with n-cubic cells, which we called n-cubic pyramid algebras. This class of algebras includes the quadratic dual of the basic n-Auslander absolutely n-complete algebras introduced by Iyama. We show that the projective resolutions of the simples of n-cubic pyramid algebras can be characterized by n-cuboids, and prove that they are periodic. So these algebras are almost Koszul and (n?1)-translation algebras. We also recover Iyama’s cone construction for n-Auslander absolutely n-complete algebras using n-cubic pyramid algebras and the theory of n-translation algebras.     

Uncountable equilateral sets in Banach spaces of the form <Emphasis Type="Italic">C</Emphasis>(<Emphasis Type="Italic">K</Emphasis>)

The paper is concerned with the problem whether a nonseparable Banach space must contain an uncountable set of vectors such that the distances between every two distinct vectors of the set are the same. Such sets are called equilateral. We show that Martin’s axiom and the negation of the continuum hypothesis imply that every nonseparable Banach space of the form C(K) has an uncountable equilateral set. We also show that one cannot obtain such a result without an additional set-theoretic assumption since we construct an example of nonseparable Banach space of the form C(K) which has no uncountable equilateral set (or equivalently no uncountable (1+ε)-separated set in the unit sphere for any ε > 0) making another consistent combinatorial assumption. The compact K is a version of the split interval obtained from a sequence of functions which behave in an anti-Ramsey manner. It remains open if there is an absolute example of a nonseparable Banach space of the form different than C(K) which has no uncountable equilateral set. It follows from the results of S. Mercourakis and G. Vassiliadis that our example has an equivalent renorming in which it has an uncountable equilateral set. It remains open if there are consistent examples of nonseparable Banach spaces which have no uncountable equilateral sets in any equivalent renorming but it follows from the results of S. Todorcevic that it is consistent that every nonseparable Banach space has an equivalent renorming in which it has an uncountable equilateral set.     

Approximating the Distribution of Customers in <Emphasis Type="Italic">M/E</Emphasis><Subscript><Emphasis Type="Italic">n</Emphasis></Subscript><Emphasis Type="Italic">/s</Emphasis> Queues

Approximation formulae are suggested for the mean and variance of customers in M/E _n /s queues. It is shown that the distributions can be approximated by using the mean and variance to fit Gamma functions. A brief comment on the more general E _m /E _n /s case is given.     

Universal Cycle Packings and Coverings for <Emphasis Type="Italic">k</Emphasis>-Subsets of an <Emphasis Type="Italic">n</Emphasis>-Set

A cyclic sequence of elements of [n] is an (n, k)-Ucycle packing (respectively, (n, k)-Ucycle covering) if every k-subset of [n] appears in this sequence at most once (resp. at least once) as a subsequence of consecutive terms. Let \(p_{n,k}\) be the length of a longest (n, k)-Ucycle packing and \(c_{n,k}\) the length of a shortest (n, k)-Ucycle covering. We show that, for a fixed \(k,p_{n,k}={n\atopwithdelims ()k}-O(n^{\lfloor k/2\rfloor })\). Moreover, when k is not fixed, we prove that if \(k=k(n)\le n^{\alpha }\), where \(0<\alpha <1/3\), then \(p_{n,k}={n\atopwithdelims ()k}-o({n\atopwithdelims ()k}^\beta )\) and \(c_{n,k}={n\atopwithdelims ()k}+o({n\atopwithdelims ()k}^\beta )\), for some \(\beta <1\). Finally, we show that if \(k=o(n)\), then \(p_{n,k}={n\atopwithdelims ()k}(1-o(1))\).     

Properties of element orders in covers for L<Subscript>n</Subscript>(<Emphasis Type="Italic">q</Emphasis>) and U<Subscript>n</Subscript>(<Emphasis Type="Italic">q</Emphasis>)

We show that if a finite simple group G, isomorphic to PSL_n(q) or PSU_n(q) where either n ≠ 4 or q is prime or even, acts on a vector space over a field of the defining characteristic of G; then the corresponding semidirect product contains an element whose order is distinct from every element order of G. We infer that the group PSL_n(q), n ≠ 4 or q prime or even, is recognizable by spectrum from its covers thus giving a partial positive answer to Problem 14.60 from the Kourovka Notebook.     

The probability that <Emphasis Type="Italic">r</Emphasis> elements of a rank <Emphasis Type="Italic">n</Emphasis> free group generate a rank <Emphasis Type="Italic">r</Emphasis> subgroup

Granted the three integers n ≥ 2, r, and R, consider all ordered tuples of r elements of length at most R in the free group F _n . Calculate the number of those tuples that generate in F _n a rank r subgroup and divide it by the number of all tuples under study. As R → ∞, the limit of the ratio is known to exist and equal 1 (see [1]). We give a simple proof of this result.