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.     

A general method for construction of (<Emphasis Type="Italic">t</Emphasis>, <Emphasis Type="Italic">n</Emphasis>)-threshold visual secret sharing schemes for color images

This paper is concerned with the construction of basis matrices of visual secret sharing schemes for color images under the (t, n)-threshold access structure, where n ≥ t ≥ 2 are arbitrary integers. We treat colors as elements of a bounded semilattice and regard stacking two colors as the join of the two corresponding elements. We generate n shares from a secret image with K colors by using K matrices called basis matrices. The basis matrices considered in this paper belong to a class of matrices each element of which is represented by a homogeneous polynomial of degree n. We first clarify a condition such that the K matrices corresponding to K homogeneous polynomials become basis matrices. Next, we give an algebraic scheme for the construction of basis matrices. It is shown that under the (t, n)-threshold access structure we can obtain K basis matrices from appropriately chosen K − 1 homogeneous polynomials of degree n by using simple algebraic operations. In particular, we give basis matrices that are unknown so far for the cases of t = 2, 3 and n − 1.     

On (<Emphasis Type="Italic">n</Emphasis>,<Emphasis Type="Italic">m</Emphasis>)-semigroups

We generalize Green’s lemma and Green’s theorem for usual binary semigroups to (n,m)-semigroups, define and describe the regularity for an element of an (n,m)-semigroup, give some criteria for an element of an (n,m)-semigroup to be invertible, and further apply the invertibility for (n,m)-semigroups to (n,m)-groups and give some equivalent characterizations for (n,m)-groups. We establish Hosszú-Gluskin theorems for (n,m)-semigroups in two cases, as generalizations of the corresponding theorems for n-groups.     

Cyclotomic Hecke Algebras of <Emphasis Type="Italic">G</Emphasis>(<Emphasis Type="Italic">r</Emphasis>, <Emphasis Type="Italic">p</Emphasis>, <Emphasis Type="Italic">n</Emphasis>)

In this note, we find a monomial basis of the cyclotomic Hecke algebra \({\mathcal{H}_{r,p,n}}\) of G(r,p,n) and show that the Ariki-Koike algebra \({\mathcal{H}_{r,n}}\) is a free module over \({\mathcal{H}_{r,p,n}}\), using the Gröbner-Shirshov basis theory. For each irreducible representation of \({\mathcal{H}_{r,p,n}}\), we give a polynomial basis consisting of linear combinations of the monomials corresponding to cozy tableaux of a given shape.     

On list incidentor (<Emphasis Type="Italic">k</Emphasis>, <Emphasis Type="Italic">l</Emphasis>)-coloring

A proper incidentor coloring is called a (k, l)-coloring if the difference between the colors of the final and initial incidentors ranges between k and l. In the list variant, the extra restriction is added: the color of each incidentor must belong to the set of admissible colors of the arc. In order to make this restriction reasonable we assume that the set of admissible colors for each arc is an integer interval. The minimum length of the interval that guarantees the existence of a list incidentor (k, l)-coloring is called a list incidentor (k, l)-chromatic number. Some bounds for the list incidentor (k, l)-chromatic number are proved for multigraphs of degree 2 and 4.     

(<Emphasis Type="Italic">s</Emphasis>, <Emphasis Type="Italic">t</Emphasis>, <Emphasis Type="Italic">d</Emphasis>)-bi-Koszul algebras

The paper focuses on the 1-generated positively graded algebras with non-pure resolutions and mainly discusses a new kind of algebras called(s,t,d)-bi-Koszul algebras as the generalization of bi-Koszul algebras. An(s,t,d)-bi-Koszul algebra can be obtained from two periodic algebras with pure resolutions. The generation of the Koszul dual of an(s,t,d)-bi-Koszul algebra is discussed. Based on it,the notion of strongly(s,t,d)-bi-Koszul algebras is raised and their homological properties are further discussed.     

On the directions problem in <Emphasis Type="Italic">AG</Emphasis>(<Emphasis Type="Italic">n</Emphasis>, <Emphasis Type="Italic">q</Emphasis>)

We prove that if q = p ^h , p a prime, do not exist sets U í AG(n,q){U {\subseteq} AG(n,q)}, with |U| = q ^k and 1 < k < n, determining N directions where

Clique matchings in the <Emphasis Type="Italic">k</Emphasis>-ary <Emphasis Type="Italic">n</Emphasis>-dimensional cube

A clique matching in the k-ary n-dimensional cube (hypercube) is a collection of disjoint one-dimensional faces. A clique matching is called perfect if it covers all vertices of the hypercube. We show that the number of perfect clique matchings in the k-ary n-dimensional cube can be expressed as the k-dimensional permanent of the adjacency array of some hypergraph. We calculate the order of the logarithm of the number of perfect clique matchings in the k-ary n-dimensional cube for an arbitrary positive integer k as n→∞.     

Eigenvalues of the Manifold Sp（n）/U（n）

In this paper, we give the eigenvalues of the manifold Sp(n)/U(n). We prove that an eigenvalue λ _s (f ₂, f ₂, …, f _n ) of the Lie group Sp(n), corresponding to the representation with label (f ₁, f ₂, ..., f _n ), is an eigenvalue of the manifold Sp(n)/U(n), if and only if f ₁, f ₂, …, f _n are all even.     

<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">n</Emphasis>-Flat and <Emphasis Type="Italic">n</Emphasis>-FP-injective modules

In this paper, we study the existence of the n-flat preenvelope and the n-FP-injective cover. We also characterize n-coherent rings in terms of the n-FP-injective and n-flat modules.     

On the family of diophantine triples {<Emphasis Type="Italic">k</Emphasis> + 1, 4<Emphasis Type="Italic">k</Emphasis>, 9<Emphasis Type="Italic">k</Emphasis> + 3}

We prove that if k is a positive integer and d is a positive integer such that the product of any two distinct elements of the set {k + 1, 4k, 9k + 3, d} increased by 1 is a perfect square, then d = 144k ³ + 192k ² + 76k + 8.      

Continuous <Emphasis Type="Italic">l</Emphasis><Subscript><Emphasis Type="Italic">n</Emphasis>,<Emphasis Type="Italic">p</Emphasis></Subscript>-symmetric distributions

For p > 0, the l _n,p -generalized surface measure on the l _n,p -unit sphere is studied and used for deriving a geometric measure representation for l _n,p -symmetric distributions having a density.     

On the phase transitions of (<Emphasis Type="Italic">k</Emphasis>, <Emphasis Type="Italic">q</Emphasis>)-SAT

Call a sequence of k Boolean variables or their negations a k-tuple. For a set V of n Boolean variables, let T _k (V) denote the set of all 2 ^k n ^k possible k-tuples on V. Randomly generate a set C of k-tuples by including every k-tuple in T _k (V) independently with probability p, and let Q be a given set of q “bad” tuple assignments. An instance I = (C,Q) is called satisfiable if there exists an assignment that does not set any of the k-tuples in C to a bad tuple assignment in Q. Suppose that θ, q > 0 are fixed and ε = ε(n) > 0 be such that εlnn/lnlnn→∞. Let k ≥ (1 + θ) log₂ n and let \({p_0} = \frac{{\ln 2}}{{q{n^{k - 1}}}}\). We prove that

$$\mathop {\lim }\limits_{n \to \infty } P\left[ {I is satisfiable} \right] = \left\{ {\begin{array}{*{20}c} {1,} & {p \leqslant (1 - \varepsilon )p_0 ,} \\ {0,} & {p \geqslant (1 + \varepsilon )p_0 .} \\ \end{array} } \right.$$

     

Reduction for primitive flag-transitive (<Emphasis Type="Italic">v</Emphasis>, <Emphasis Type="Italic">k</Emphasis>, 4)-symmetric designs

It has been shown that if a (v, k, λ)-symmetric design with λ ≤ 3 admits a flag-transitive automorphism group G which acts primitively on points, then G must be of affine or almost simple type. Here we extend the result to λ = 4.     

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.     

Mean First-passage Times for a <Emphasis Type="Italic">k</Emphasis>-out-of-<Emphasis Type="Italic">n</Emphasis> Sytem with Repair

Consider a k-out-of-n system where the lifetimes of the components are independent and identically distributed exponential (λ) random variables. Each component has its own repair facility, the repair times being independent and identically distributed exponential (μ) random variables, independent of the failure times. The mean operating time and mean repair time during the cycle between two successive breakdowns are found using renewal theory and the expression for the system availability. Using these, the mean first-passage times from any of the operating states of the system to the down state, and the mean first-passage times from any of the down states to the operating state are found recursively.     

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))\).     

The <Emphasis Type="Italic">p</Emphasis>-Adic order of the <Emphasis Type="Italic">k</Emphasis>-Fibonacci and <Emphasis Type="Italic">k</Emphasis>-Lucas numbers

Let (F _k,n ) _n and (L _k,n )n be the k-Fibonacci and k-Lucas sequence, respectively, which satisfies the same recursive relation a _n+1 = ka _n + a _n?1 with initial values F _k,0 = 0, F _k,1 = 1, L _k,0 = 2 and L _k,1 = k. In this paper, we characterize the p-adic orders ν _p (F _k,n ) and ν _p (L _k,n ) for all primes p and all positive integers k.     

On <Emphasis Type="Italic">k</Emphasis>- critical 2<Emphasis Type="Italic">k</Emphasis>- connected graphs

A graph G is called an (n,k)-graph if κ(G-S)=n-|S| for any S ? V(G) with |S| ≤ k, where ?(G) denotes the connectivity of G. Mader conjectured that for k ≥ 3 the graph K_2k+2?(1-factor) is the unique (2k, k)-graph. Kriesell has settled two special cases for k = 3,4. We prove the conjecture for the general case k ≥ 5.