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.     

The Erdös-Kac theorem for additive arithmetical semigroups

We show that the Erdös-Kac theorem for additive arithmetical semigroups can be proved under the condition that the counting function of elements has the asymptotics G(n) = q ⁿ (A + O(1/(lnn)^k) as n → ∞ with A > 0, q > 1, and arbitrary k ∈ ? and that P(n) = O(q ⁿ /n) for the number of prime elements of degree n. This improves a result of Zhang.     

On the summability factors of infinite series

The author has established that if [λ_n] is a convex sequence such that the series Σn ^-1λ_n is convergent and the sequence {K _n} satisfies the condition |K _n|=O[log(n+1)]^k(C, 1),k?0, whereK _n denotes the (R, logn, 1) mean of the sequence {n log (n+1)a _n}, then the series Σlog(n+1)^1-kλ_n a _n is summable |R, logn, 1|. The result obtained for the particular casek=0 generalises a previous result of the author [1].     

On an Extremal Problem for Poset Dimension

Let f(n) be the largest integer such that every poset on n elements has a 2-dimensional subposet on f(n) elements. What is the asymptotics of f(n)? It is easy to see that f(n) = n ^1/2. We improve the best known upper bound and show f(n) = O (n ^2/3). For higher dimensions, we show \(f_{d}(n)=\O \left (n^{\frac {d}{d + 1}}\right )\), where f _d (n) is the largest integer such that every poset on n elements has a d-dimensional subposet on f _d (n) elements.     

Lower bounds for the largest eigenvalue of the gcd matrix on {1, 2,..., n}

Consider the n×n matrix with (i, j)’th entry gcd (i, j). Its largest eigenvalue λ_n and sum of entries s_n satisfy λ_n > s_n/n. Because s_n cannot be expressed algebraically as a function of n, we underestimate it in several ways. In examples, we compare the bounds so obtained with one another and with a bound from S.Hong, R.Loewy (2004). We also conjecture that λ_n > 6π^?2nlogn for all n. If n is large enough, this follows from F.Balatoni (1969).     

On the Ramsey number of the triangle and the cube

The Ramsey number r(K ₃,Q _n ) is the smallest integer N such that every red-blue colouring of the edges of the complete graph K _N contains either a red n-dimensional hypercube, or a blue triangle. Almost thirty years ago, Burr and Erd?s conjectured that r(K ₃,Q _n )=2 ⁿ⁺¹?1 for every n∈?, but the first non-trivial upper bound was obtained only recently, by Conlon, Fox, Lee and Sudakov, who proved that r(K ₃,Q _n )?7000·2 ⁿ . Here we show that r(K ₃,Q _n )=(1+o(1))2 ⁿ⁺¹ as n→∞.     

On the Strong <Emphasis Type="Italic">n</Emphasis>-partite Tournaments with Exactly Two Cycles of Length <Emphasis Type="Italic">n</Emphasis> − 1

Gutin and Rafiey (Australas J. Combin. 34 (2006), 17-21) provided an example of an n-partite tournament with exactly n ? m + 1 cycles of length of m for any given m with 4 ≤ m ≤ n, and posed the following question. Let 3 ≤ m ≤ n and n ≥ 4. Are there strong n-partite tournaments, which are not themselves tournaments, with exactly n ? m + 1 cycles of length m for two values of m? In the same paper, they showed that this question has a negative answer for two values n ? 1 and n. In this paper, we prove that a strong n-partite tournament with exactly two cycles of length n ? 1 must contain some given multipartite tournament as subdigraph. As a corollary, we also show that the above question has a negative answer for two values n ? 1 and any l with 3 ≤ l ≤ n and l ≠ n ? 1.     

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

On collineation groups of finite projective spaces containing a Singer cycle

By a result of Kantor, any subgroup of GL(n, q) containing a Singer cycle normalizes a field extension subgroup. This result has as a consequence a projective analogue, and this paper gives the details of this deduction, showing that any subgroup of PΓL(n, q) containing a projective Singer cycle normalizes the image of a field extension subgroup GL(n/s, q^s) under the canonical homomorphism GL(n, q) → PGL(n, q), for some divisor s of n, and so is contained in the image of ΓL(n/s, q^s) under the canonical homomorphism ΓL(n, q) → PΓL(n, q). The actions of field extension subgroups on V (n, q) are also investigated. In particular, we prove that any field extension subgroup GL(n/s, q^s) of GL(n, q) has a unique orbit on s-dimensional subspaces of V (n, q) of length coprime to q. This orbit is a Desarguesian s-partition of V (n, q).     

A tournament approach to pattern avoiding matrices

We consider the following Turán-type problem: given a fixed tournament H, what is the least integer t = t(n,H) so that adding t edges to any n-vertex tournament, results in a digraph containing a copy of H. Similarly, what is the least integer t = t(T _n ,H) so that adding t edges to the n-vertex transitive tournament, results in a digraph containing a copy of H. Besides proving several results on these problems, our main contributions are the following:

• Pach and Tardos conjectured that if M is an acyclic 0/1 matrix, then any n × n matrix with n(log n) ^O(1) entries equal to 1 contains the pattern M. We show that this conjecture is equivalent to the assertion that t(T _n ,H) = n(log n) ^O(1) if and only if H belongs to a certain (natural) family of tournaments.
• We propose an approach for determining if t(n,H) = n(log n) ^O(1). This approach combines expansion in sparse graphs, together with certain structural characterizations of H-free tournaments. Our result opens the door for using structural graph theoretic tools in order to settle the Pach–Tardos conjecture.

     

Estimation of the depth of reversible circuits consisting of NOT,CNOT and 2-CNOT gates

The paper discusses the asymptotic depth of a reversible circuits consisting of NOT, CNOT and 2-CNOT gates. The reversible circuit depth function D(n, q) is introduced for a circuit implementing a mapping f: Z₂ⁿ → Z₂ⁿ as a function of n and the number q of additional inputs. It is proved that for the case of implementation of a permutation from A(Z₂ⁿ) with a reversible circuit having no additional inputs the depth is bounded as D(n, 0) ? 2ⁿ/(3log₂n). It is also proved that for the case of transformation f: Z₂ⁿ → Z₂ⁿ with a reversible circuit having q₀ ~ 2ⁿ additional inputs the depth is bounded as D(n,q₀) ? 3n.     

The Existence and Application of Strongly Idempotent Self-orthogonal Row Latin Magic Arrays

Let N = {0, 1, · · ·, n ? 1}. A strongly idempotent self-orthogonal row Latin magic array of order n (SISORLMA(n) for short) based on N is an n × n array M satisfying the following properties: (1) each row of M is a permutation of N, and at least one column is not a permutation of N; (2) the sums of the n numbers in every row and every column are the same; (3) M is orthogonal to its transpose; (4) the main diagonal and the back diagonal of M are 0, 1, · · ·, n ? 1 from left to right. In this paper, it is proved that an SISORLMA(n) exists if and only if n ? {2, 3}. As an application, it is proved that a nonelementary rational diagonally ordered magic square exists if and only if n ? {2, 3}, and a rational diagonally ordered magic square exists if and only if n ≠ 2.     

Universal functions for classes of Boolean polynomials

The following problem is considered: Find Boolean function f of n variables with the property that, given any polynomial p of degree at most s, there exists a set of n-tuples such that p is the only polynomial of degree at most s taking the same values as f at these n-tuples. It is shown that for any fixed s and sufficiently large n, such a function exists and can be chosen from among those with domains of cardinality that grow as O(n ^s ).     

Slow entropy for some smooth flows on surfaces

We study slow entropy in some classes of smooth mixing flows on surfaces. The flows we study can be represented as special flows over irrational rotations and under roof functions which are C² everywhere except one point (singularity). If the singularity is logarithmic asymmetric (Arnol’d flows), we show that in the scale a_n(t) = n(log n)^t slow entropy equals 1 (the speed of orbit growth is n log n) for a.e. irrational α. If the singularity is of power type (x^?γ, γ ∈ (0, 1)) (Kochergin flows), we show that in the scale a_n(t) = n^t slow entropy equals 1 + γ for a.e. α.We show moreover that for local rank one flows, slow entropy equals 0 in the n(log n)^t scale and is at most 1 for scale n^t. As a consequence we get that a.e. Arnol’d and a.e Kochergin flow is never of local rank one.     

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.     

Simplexes in a normed space

Is it true that any set of n + 1 points in Rⁿ can be isometrically embedded into any n-dimensional real normed apace? For n ≥ 3, the answer to this question is unknown to the author of this paper. For n = 2, it is clear that the answer is positive. For n = 3, the problem is reduced to the case where four points lie in a plane. A certain reduction is assigned for arbitrary n.     

Maximum Distance Between Slater Orders and Copeland Orders of Tournaments

Given a tournament T?=?(X, A), we consider two tournament solutions applied to T: Slater’s solution and Copeland’s solution. Slater’s solution consists in determining the linear orders obtained by reversing a minimum number of directed edges of T in order to make T transitive. Copeland’s solution applied to T ranks the vertices of T according to their decreasing out-degrees. The aim of this paper is to compare the results provided by these two methods: to which extent can they lead to different orders? We consider three cases: T is any tournament, T is strongly connected, T has only one Slater order. For each one of these three cases, we specify the maximum of the symmetric difference distance between Slater orders and Copeland orders. More precisely, thanks to a result dealing with arc-disjoint circuits in circular tournaments, we show that this maximum is equal to n(n???1)/2 if T is any tournament on an odd number n of vertices, to (n ²???3n?+?2)/2 if T is any tournament on an even number n of vertices, to n(n???1)/2 if T is strongly connected with an odd number n of vertices, to (n ²???3n???2)/2 if T is strongly connected with an even number n of vertices greater than or equal to 8, to (n ²???5n?+?6)/2 if T has an odd number n of vertices and only one Slater order, to (n ²???5n?+?8)/2 if T has an even number n of vertices and only one Slater order.     

Ramsey numbers of cubes versus cliques

The cube graph Q _n is the skeleton of the n-dimensional cube. It is an n-regular graph on 2 ⁿ vertices. The Ramsey number r(Q _n ;K _s ) is the minimum N such that every graph of order N contains the cube graph Q _n or an independent set of order s. In 1983, Burr and Erd?s asked whether the simple lower bound r(Q _n ;K _s )≥(s?1)(2 ⁿ ?1)+1 is tight for s fixed and n sufficiently large. We make progress on this problem, obtaining the first upper bound which is within a constant factor of the lower bound.     

Dn,r is not potentially nilpotent for n ⩾ 4r − 2

An n × n sign pattern A is said to be potentially nilpotent if there exists a nilpotent real matrix B with the same sign pattern as A. Let D_n,r be an n × n sign pattern with 2 ≤ r ≤ n such that the superdiagonal and the (n, n) entries are positive, the (i, 1) (i = 1,..., r) and (i, i ? r + 1) (i = r + 1,..., n) entries are negative, and zeros elsewhere. We prove that for r ≥ 3 and n ≥ 4r ? 2, the sign pattern D_n,r is not potentially nilpotent, and so not spectrally arbitrary.     

Dihedral Biembeddings and Triangulations by Complete and Complete Tripartite Graphs

We construct biembeddings of some Latin squares which are Cayley tables of dihedral groups. These facilitate the construction of ${n^{an^2}}$ nonisomorphic face 2-colourable triangular embeddings of the complete tripartite graph K _n,n,n and the complete graph K _n for linear classes of values of n and suitable constants a. Previously the best known lower bounds for the number of such embeddings that are applicable to linear classes of values of n were of the form ${2^{an^2}.}$ We remark that trivial upper bounds are ${n^{n^2/3}}$ in the case of complete graphs K _n and ${n^{2n^2}}$ in the case of complete tripartite graphs K _n,n,n .