Maximal Green Sequences for Preprojective Algebras

Maximal green sequences were introduced as combinatorical counterpart for Donaldson-Thomas invariants for 2-acyclic quivers with potential by B. Keller. We take the categorical notion and introduce maximal green sequences for hearts of bounded t-structures of triangulated categories that can be tilted indefinitely. We study the case where the heart is the category of modules over the preprojective algebra of a quiver without loops. The combinatorical counterpart of maximal green sequences for Dynkin quivers are maximal chains in the Hasse quiver of basic support τ-tilting modules. We show that a quiver has a maximal green sequence if and only if it is of Dynkin type. More generally, we study module categories for finite-dimensional algebras with finitely many bricks.     

$$\varvec{}$$-Classes in finite groups of conjugate type $$\varvec{(n,1)}$$(n,1)

Two elements in a group G are said to be z-equivalent or to be in the same z-class if their centralizers are conjugate in G. In a recent work, Kulkarni et al. (J. Algebra Appl., 15 (2016) 1650131) proved that a non-abelian p-group G can have at most \(\frac{p^k-1}{p-1} +1\) number of z-classes, where \(|G/Z(G)|=p^k\). Here, we characterize the p-groups of conjugate type (n, 1) attaining this maximal number. As a corollary, we characterize p-groups having prime order commutator subgroup and maximal number of z-classes.     

Random embedding of $${\ell_p^n}$$ into $${\ell_r^N}$$

For any 0 < p < 2 and any natural numbers N > n, we give an explicit definition of a random operator \({S : \ell_p^n \to \mathbb{R}^N}\) such that for every 0 < r < p < 2 with r ≤ 1, the operator \({S_r = S : \ell_p^n \to \ell_r^N}\) satisfies with overwhelming probability that \({\|S_r\| \, \|(S_r)_{| {\rm Im}\, S}^{-1}\| \le C(p,r)^{n/(N-n)}}\), where C(p, r) > 0 is a real number depending only on p and r. One of the main tools that we develop is a new type of multidimensional Esseen inequality for studying small ball probabilities.     

On $$\mathcal {}$$-subgroups of finite groups

Let G be a finite group. A subgroup H of G is s-permutable in G if H permutes with every Sylow subgroup of G. A subgroup H of G is called an \(\mathcal {SSH}\)-subgroup in G if G has an s-permutable subgroup K such that \(H^{sG} = HK\) and \(H^g \cap N_K (H) \leqslant H\), for all \(g \in G\), where \(H^{sG}\) is the intersection of all s-permutable subgroups of G containing H. We study the structure of finite groups under the assumption that the maximal or the minimal subgroups of Sylow subgroups of some normal subgroups of G are \(\mathcal {SSH}\)-subgroups in G. Several recent results from the literature are improved and generalized.     

Maximal green sequences for cluster algebras associated with the <Emphasis Type="Italic">n</Emphasis>-torus with arbitrary punctures

It is well known that any triangulation of a marked surface produces a quiver. In this paper we will provide a triangulation for orientable surfaces of genus n with an arbitrary number interior marked points (called punctures) whose corresponding quiver has a maximal green sequence.     

Ck-regularity for the $$\bar \partial $$ -equation with a support condition

Let D be a C ^d q-convex intersection, d ≥ 2, 0 ≤ q ≤ n ? 1, in a complex manifold X of complex dimension n, n ≥ 2, and let E be a holomorphic vector bundle of rank N over X. In this paper, C ^k -estimates, k = 2, 3,...,∞, for solutions to the \(\bar \partial \)-equation with small loss of smoothness are obtained for E-valued (0, s)-forms on D when n ? q ≤ s ≤ n. In addition, we solve the \(\bar \partial \)-equation with a support condition in C ^k -spaces. More precisely, we prove that for a \(\bar \partial \)-closed form f in C _0,q ^k (X D,E), 1 ≤ q ≤ n ? 2, n ≥ 3, with compact support and for ε with 0 < ε < 1 there exists a form u in C _0,q?1 ^k?ε (X D,E) with compact support such that \(\bar \partial u = f\) in \(X\backslash \bar D\). Applications are given for a separation theorem of Andreotti-Vesentini type in C ^k -setting and for the solvability of the \(\bar \partial \)-equation for currents.     

Additive properties of product sets in the field $$ \mathbb{F}_{p^2 } $$

For given positive integer n and ε > 0 we consider an arbitrary nonempty subset A of a field consisting of p ² elements such that its cardinality exceeds p ^2/n?ε . We study the possibility to represent an arbitrary element of the field as a sum of at most N(n, ε) elements from the nth degree of the set A. An upper estimate for the number N(n, ε) is obtained when it is possible.     

Largest <Emphasis Type="Italic">H</Emphasis>-eigenvalue of uniform <Emphasis Type="Italic">s</Emphasis>-hypertrees

The k-uniform s-hypertree G = (V,E) is an s-hypergraph, where 1 ≤ s ≤ k - 1; and there exists a host tree T with vertex set V such that each edge of G induces a connected subtree of T. In this paper, some properties of uniform s-hypertrees are establised, as well as the upper and lower bounds on the largest H-eigenvalue of the adjacency tensor of k-uniform s-hypertrees in terms of the maximal degree Δ. Moreover, we also show that the gap between the maximum and the minimum values of the largest H-eigenvalue of k-uniform s-hypertrees is just Θ(Δ ^s/k ).     

Neighbor sum distinguishing colorings of graphs with maximum average degree less than $$\tfrac{{37}} {{12}}$$

Let G be a graph and let its maximum degree and maximum average degree be denoted by Δ(G) and mad(G), respectively. A neighbor sum distinguishing k-edge colorings of graph G is a proper k-edge coloring of graph G such that, for any edge uv ∈ E(G), the sum of colors assigned on incident edges of u is different from the sum of colors assigned on incident edges of v. The smallest value of k in such a coloring of G is denoted by χ′_∑(G). Flandrin et al. proposed the following conjecture that χ′_∑ (G) ≤ Δ(G) + 2 for any connected graph with at least 3 vertices and G ≠ C₅. In this paper, we prove that the conjecture holds for a normal graph with mad(G) < \(\tfrac{{37}}{{12}}\) and Δ(G) ≥ 7.     

Binary central relations and submaximal clones determined by nontrivial equivalence relations

Let k ≥ 3, θ a nontrivial equivalence relation on E _k = {0, . . . ,k – 1}, and ρ a binary central relation on E _k (a reflexive graph with a vertex having E _k as its neighborhood). It is known that the clones Pol θ and Pol ρ (of operations on E _k preserving θ and ρ, respectively) are maximal clones; i.e., covered by the largest clone in the inclusion-ordered lattice of clones on E _k . In this paper, we give the classification of all binary central relations ρ on E _k such that the clone Pol θ ∩ Pol ρ is maximal in Pol θ.     

On trees with total domination number equal to edge-vertex domination number plus one

An edge e∈E(G) dominates a vertex v∈V(G) if e is incident with v or e is incident with a vertex adjacent to v. An edge-vertex dominating set of a graph G is a set D of edges of G such that every vertex of G is edge-vertex dominated by an edge of D. The edge-vertex domination number of a graph G is the minimum cardinality of an edge-vertex dominating set of G. A subset D?V(G) is a total dominating set of G if every vertex of G has a neighbor in D. The total domination number of G is the minimum cardinality of a total dominating set of G. We characterize all trees with total domination number equal to edge-vertex domination number plus one.     

Dominating Cycles and Forbidden Pairs Containing $$P_{5}$$

A cycle C in a graph G is dominating if every edge of G is incident with at least one vertex of C. For a set \(\mathcal {H}\) of connected graphs, a graph G is said to be \(\mathcal {H}\)-free if G does not contain any member of \(\mathcal {H}\) as an induced subgraph. When \(|\mathcal {H}| = 2, \mathcal {H}\) is called a forbidden pair. In this paper, we investigate the characterization of the class of the forbidden pairs guaranteeing the existence of a dominating cycle and show the following two results: (i) Every 2-connected \(\{P_{5}, K_{4}^{-}\}\)-free graph contains a longest cycle which is a dominating cycle. (ii) Every 2-connected \(\{P_{5}, W^{*}\}\)-free graph contains a longest cycle which is a dominating cycle. Here \(P_{5}\) is the path of order \(5, K_{4}^{-}\) is the graph obtained from the complete graph of order 4 by removing one edge, and \(W^{*}\) is the graph obtained from two triangles and an edge by identifying one vertex in each.     

On the pseudorandomness of quaternary sequences derived from sequences over $$\mathbb F_4$$

In analogy to the corresponding measures of pseudorandomness for quaternary sequences introduced by Mauduit and Sárközy (for m-ary sequences) we introduce the well-distribution measure and correlation measure of order k for sequences over \(\mathbb F_4\). Using any fixed bijection from \(\mathbb F_4\) to the set of complex fourth roots of unity, we analyze the relation of these pseudorandomness measures for sequences over \(\mathbb F_4\) and for the corresponding quaternary sequences. More precisely, we show that they differ only by a multiplicative constant (depending only on k). We also apply the results for deriving new quaternary pseudorandom sequences from pseudorandom sequences over \(\mathbb F_4\) and vice versa.     

The varieties of Heisenberg vertex operator algebras

For a vertex operator algebra V with conformal vector ω,we consider a class of vertex operator subalgebras and their conformal vectors.They are called semi-conformal vertex operator subalgebras and semiconformal vectors of(V,ω),respectively,and were used to study duality theory of vertex operator algebras via coset constructions.Using these objects attached to(V,ω),we shall understand the structure of the vertex operator algebra(V,ω).At first,we define the set Sc(V,ω)of semi-conformal vectors of V, then we prove that Sc(V,ω)is an affine algebraic variety with a partial ordering and an involution map.Corresponding to each semi-conformal vector,there is a unique maximal semi-conformal vertex operator subalgebra containing it.The properties of these subalgebras are invariants of vertex operator algebras.As an example,we describe the corresponding varieties of semi-conformal vectors for Heisenberg vertex operator algebras.As an application,we give two characterizations of Heisenberg vertex operator algebras using the properties of these varieties.     

Large $${\varvec{p}}^{\prime }$$-orbits for $${\varvec{p}}$$p-nilpotent linear groups

Let G be a p-nilpotent linear group on a finite vector space V of characteristic p. Suppose that |G||V| is odd. Let P be a Sylow p-subgroup of G. We show that there exist vectors \(v_1\) and \(v_2\) in V such that \(C_G(v_1) \cap C_G(v_2)=P\). A striking conjecture of Malle and Navarro offers a simple global criterion for the nilpotence (in the sense of Broué and Puig) of a p-block of a finite group. Our result implies that this conjecture holds for groups of odd order.     

Computing Explicit Isomorphisms with Full Matrix Algebras over $$\mathbb {F}_q(x)$$

We propose a polynomial time f-algorithm (a deterministic algorithm which uses an oracle for factoring univariate polynomials over \(\mathbb {F}_q\)) for computing an isomorphism (if there is any) of a finite-dimensional \(\mathbb {F}_q(x)\)-algebra \(\mathcal{A}\) given by structure constants with the algebra of n by n matrices with entries from \(\mathbb {F}_q(x)\). The method is based on computing a finite \(\mathbb {F}_q\)-subalgebra of \(\mathcal{A}\) which is the intersection of a maximal \(\mathbb {F}_q[x]\)-order and a maximal R-order, where R is the subring of \(\mathbb {F}_q(x)\) consisting of fractions of polynomials with denominator having degree not less than that of the numerator.     

A remark on the ring of algebraic integers in $$\mathbb{Q}(\sqrt { - d} )$$

It is well-known that the rings O_d of algebraic integers in \(\mathbb{Q}(\sqrt { - d} )\) for d = 19, 43, 67, and 163 are principal ideal domains but not Euclidean. In this article we shall provide a method, based on a result of P. M. Cohn, to construct explicitly pairs (b, a) of integers in O_d for d = 19, 43, 67, and 163 such that, in O_d, there exists no terminating division chain of finite length starting from the pairs (b, a). That is, a greatest common divisor of the pairs (b, a) exists in O_d but it can not be obtained by applying a terminating division chain of finite length starting from (b, a). Furthermore, for squarefree positive integer d ? {1, 2, 3, 7, 11, 19, 43, 67, 163}, we shall also construct pairs (b, a) of integers in O_d which generate O_d but have no terminating division chain of finite length. It is of interest to note that our construction provides a short alternative proof of a theorem of Cohn which is related to the concept of GE₂-rings.     

On Trees of Bounded Degree with Maximal Number of Greatest Independent Sets

Given n and d, we describe the structure of trees with the maximal possible number of greatest independent sets in the class of n-vertex trees of vertex degree at most d.We show that the extremal tree is unique for all even n but uniqueness may fail for odd n; moreover, for d = 3 and every odd n ≥ 7, there are exactly ?(n ? 3)/4? + 1 extremal trees. In the paper, the problem of searching for extremal (n, d)-trees is also considered for the 2-caterpillars; i.e., the trees in which every vertex lies at distance at most 2 from some simple path. Given n and d ∈ {3, 4}, we completely reveal all extremal 2-caterpillars on n vertices each of which has degree at most d.