Depth,Stanley depth,and regularity of ideals associated to graphs

Let \({\mathbb{K}}\) be a field and \({S=\mathbb{K}[x_1,\dots,x_n]}\) be the polynomial ring in n variables over \({\mathbb{K}}\). Let G be a graph with n vertices. Assume that \({I=I(G)}\) is the edge ideal of G and \({J=J(G)}\) is its cover ideal. We prove that \({{\rm sdepth}(J)\geq n-\nu_{o}(G)}\) and \({{\rm sdepth}(S/J)\geq n-\nu_{o}(G)-1}\), where \({\nu_{o}(G)}\) is the ordered matching number of G. We also prove the inequalities \({{\rmsdepth}(J^k)\geq {\rm depth}(J^k)}\) and \({{\rm sdepth}(S/J^k)\geq {\rmdepth}(S/J^k)}\), for every integer \({k\gg 0}\), when G is a bipartite graph. Moreover, we provide an elementary proof for the known inequality reg\({(S/I)\leq \nu_{o}(G)}\).     

Element orders and character codegrees

Let \({g \in G}\) , where G is an arbitrary finite group. Then there exists \({\chi \in {\rm Irr} (G)}\) such that \({{\rm ker}(\chi) \cap \langle g \rangle = 1}\) and every prime divisor of the order o(g) divides the codegree of χ. This improves a recent result of Qian, in which G was assumed to be solvable.     

On the connectivity of infinite graphs

Let \({\mu \geq \omega}\) be regular, assume the Generalized Continuum Hypothesis and the principle \({\square_\lambda}\) holds for every singular \({\lambda}\) with \({{\rm cf}(\lambda) \leq \mu}\). Let X be a graph with chromatic number greater than \({\mu^+}\). Then X contains a \({\mu}\)-connected subgraph Y of X whose chromatic number is greater than \({\mu^+}\).     

Nordhaus–Gaddum Results for the Induced Path Number of a Graph When Neither the Graph Nor Its Complement Contains Isolates

The induced path number \(\rho (G)\) of a graph G is defined as the minimum number of subsets into which the vertex set of G can be partitioned so that each subset induces a path. A product Nordhaus–Gaddum-type result is a bound on the product of a parameter of a graph and its complement. Hattingh et al. (Util Math 94:275–285, 2014) showed that if G is a graph of order n, then \(\lceil \frac{n}{4} \rceil \le \rho (G) \rho (\overline{G}) \le n \lceil \frac{n}{2} \rceil \), where these bounds are best possible. It was also noted that the upper bound is achieved when either G or \(\overline{G}\) is a graph consisting of n isolated vertices. In this paper, we determine best possible upper and lower bounds for \(\rho (G) \rho (\overline{G})\) when either both G and \(\overline{G}\) are connected or neither G nor \(\overline{G}\) has isolated vertices.     

Stability of volume comparison for complex convex bodies

We prove the stability of the affirmative part of the solution to the complex Busemann–Petty problem. Namely, if K and L are origin-symmetric convex bodies in \({{\mathbb C}^n}\), n = 2 or n = 3, \({\varepsilon >0 }\) and \({{\rm Vol}_{2n-2}(K\cap H) \le {\rm Vol}_{2n-2}(L \cap H) + \varepsilon}\) for any complex hyperplane H in \({{\mathbb C}^n}\) , then \({({\rm Vol}_{2n}(K))^{\frac{n-1}n}\le({\rm Vol}_{2n}(L))^{\frac{n-1}n} + \varepsilon}\) , where Vol_2n is the volume in \({{\mathbb C}^n}\) , which is identified with \({{\mathbb R}^{2n}}\) in the natural way.     

Abelian covers of alternating groups

Let \({C={\rm inf} (k/n)\sum_{i=1}^n x_i(x_{i+1}+\cdots+x_{i+k})^{-1}}\), where the infimum is taken over all pairs of integers \({n\geq k\geq 1}\) and all positive \({x_1,\ldots,x_n}\), \({x_{n+i}=x_i}\). We prove that \({\ln 2 \leq C < 0.9305}\). In the definition of the constant C, the operation \({{\rm inf}_{k}\, {\rm inf}_{n}\, {\rm inf}_{x}}\) can be replaced by \({{\rm lim}_{k \to \infty}\, {\rm lim}_{n \to \infty} {\rm inf}_{x}}\).     

Homomorphisms from a finite group into wreath products

Let G be a finite group, A a finite abelian group. Each homomorphism \({\varphi:G\rightarrow A\wr S_n}\) induces a homomorphism \({\overline{\varphi}:G\rightarrow A}\) in a natural way. We show that as \({\varphi}\) is chosen randomly, then the distribution of \({\overline{\varphi}}\) is close to uniform. As application we prove a conjecture of T. Müller on the number of homomorphisms from a finite group into Weyl groups of type D _n .     

Additive iterative roots of identity and Hamel bases

We describe a class of discontinuous additive functions \({a:X\to X}\) on a real topological vector space X such that \({a^n={\rm id}_X}\) and \({a({\mathcal{H}}){\setminus} {\mathcal{H}}\neq\emptyset}\) for every infinite set \({{\mathcal{H}}\subset X}\) of vectors linearly independent over \({\mathbb{Q}}\). We prove the density of the family of all such functions in the linear topological space \({{\mathcal{A}}_X}\) of all additive functions \({a:X\to X}\) with the topology induced on \({{\mathcal{A}}_X}\) by the Tychonoff topology of the space X^X. Moreover, we consider additive functions \({a\in{\mathcal{A}}_X}\) satisfying \({a^n={\rm id}_X}\) and \({a({\mathcal{H}})= {\mathcal{H}}}\) for some Hamel basis \({{\mathcal{H}}}\) of X. We show that the class of all such functions is also dense in \({{\mathcal{A}}_X}\). The method is based on decomposition theorems for linear endomorphisms.     

Construction of hyperbolic Riemann surfaces with large systoles

Let S be a compact hyperbolic Riemann surface of genus \({g \geq 2}\). We call a systole a shortest simple closed geodesic in S and denote by \({{\rm sys}(S)}\) its length. Let \({{\rm msys}(g)}\) be the maximal value that \({{\rm sys}(\cdot)}\) can attain among the compact Riemann surfaces of genus g. We call a (globally) maximal surface S_max a compact Riemann surface of genus g whose systole has length \({{\rm msys}(g)}\). In Section 2 we use cutting and pasting techniques to construct compact hyperbolic Riemann surfaces with large systoles from maximal surfaces. This enables us to prove several inequalities relating \({{\rm msys}(\cdot)}\) of different genera. In Section 3 we derive similar intersystolic inequalities for non-compact hyperbolic Riemann surfaces with cusps.     

The trace graph of the matrix ring over a finite commutative ring

Let R be a commutative ring and let \({n >1}\) be an integer. We introduce a simple graph, denoted by \({\Gamma_t(M_n(R))}\), which we call the trace graph of the matrix ring \({M_n(R)}\), such that its vertex set is \({M_n(R)^{\ast}}\) and such that two distinct vertices A and B are joined by an edge if and only if \({{\rm Tr} (AB)=0}\) where \({ {\rm Tr} (AB)}\) denotes the trace of the matrix AB. We prove that \({\Gamma_t(M_n(R))}\) is connected with \({{\rm diam}(\Gamma_{t}(M_{n}(R)))=2}\) and \({{\rm gr} (\Gamma_t(M_n(R)))=3}\). We investigate also the interplay between the ring-theoretic properties of R and the graph-theoretic properties of \({\Gamma_t(M_n(R))}\). Hence, we use the notion of the irregularity index of a graph to characterize rings with exactly one nontrivial ideal.     

Random approximation and the vertex index of convex bodies

We prove that there exists an absolute constant \({\alpha > 1}\) with the following property: if K is a convex body in \({{\mathbb R}^n}\) whose center of mass is at the origin, then a random subset \({X\subset K}\) of cardinality \({{\rm card}(X)=\lceil\alphan\rceil }\) satisfies with probability greater than \({1-e^{-c_1n}}\)

$$K\subseteq c_2n\, {\rm conv}(X),$$

where \({c_1, c_2 > 0}\) are absolute constants. As an application we show that the vertex index of any convex body K in \({{\mathbb R}^n}\) is bounded by \({c_3n^2}\), where \({c_3 > 0}\) is an absolute constant, thus extending an estimate of Bezdek and Litvak for the symmetric case.

     

Semitotal Domination in Claw-Free Cubic Graphs

In this paper, we continue the study of semitotal domination in graphs in [Discrete Math. 324, 13–18 (2014)]. A set \({S}\) of vertices in \({G}\) is a semitotal dominating set of \({G}\) if it is a dominating set of \({G}\) and every vertex in \({S}\) is within distance 2 of another vertex of \({S}\). The semitotal domination number, \({{\gamma_{t2}}(G)}\), is the minimum cardinality of a semitotal dominating set of \({G}\). This domination parameter is squeezed between arguably the two most important domination parameters; namely, the domination number, \({\gamma (G)}\), and the total domination number, \({{\gamma_{t}}(G)}\). We observe that \({\gamma (G) \leq {\gamma_{t2}}(G) \leq {\gamma_{t}}(G)}\). A claw-free graph is a graph that does not contain \({K_{1, \, 3}}\) as an induced subgraph. We prove that if \({G}\) is a connected, claw-free, cubic graph of order \({n \geq 10}\), then \({{\gamma_{t2}}(G) \leq 4n/11}\).     

A note on standard modules and Vogan L-packets

Let F be a non-Archimedean local field of characteristic 0, let G be the group of F-rational points of a connected reductive group defined over F and let \({G\prime}\) be the group of F-rational points of its quasi-split inner form. Given standard modules \({I(\tau, \nu )}\) and \({I(\tau\prime, \nu\prime)}\) for G and \({G\prime}\) respectively with \({\tau\prime}\) a generic tempered representation, such that the Harish-Chandra \({\mu}\)-function of a representation in the supercuspidal support of \({\tau}\) agrees with the one of a generic essentially square-integral representation in some Jacquet module of \({\tau\prime}\) (after a suitable identification of the underlying spaces under which \({\nu = \nu\prime}\)), we show that \({I(\tau, \nu)}\) is irreducible whenever \({I(\tau\prime, \nu\prime)}\) is. The conditions are satisfied if the Langlands quotients \({J(\tau, \nu})\) and \({J(\tau\prime, \nu\prime)}\) of respectively \({I(\tau, \nu)}\) and \({I(\tau\prime, \nu\prime)}\) lie in the same Vogan L-packet (whenever this Vogan L-packet is defined), proving that, for any Vogan L-packet, all the standard modules with Langlands quotient in a given Vogan L-packet are irreducible, if and only if this Vogan L-packet contains a generic representation. This result for generic Vogan L-packets was proven for quasi-split orthogonal and symplectic groups by Moeglin-Waldspurger and used in their proof of the general case of the local Gan-Gross-Prasad conjectures for these groups.     

A Generalization of Stenger’s Lemma to Maximal Dissipative Operators

It is shown that for any maximal dissipative operator A in some Hilbert space \({\mathcal H}\) , which is the orthogonal sum \({\mathcal H=\mathcal F\oplus \mathcal G}\) of two Hilbert spaces \({\mathcal F,\, \mathcal G}\) with \({{\rm dim}\,\mathcal G < \infty}\) , the compression \({\left. T:=P_\mathcal F\,A\right|_{{\rm dom}\,A\cap\mathcal F}}\) of A to \({\mathcal F}\) is again a maximal dissipative operator in \({\mathcal F}\) .     

Ground states of a nonlinear curl-curl problem in cylindrically symmetric media

We consider the nonlinear curl-curl problem \({\nabla\times\nabla\times U + V(x) U= \Gamma(x)|U|^{p-1}U}\) in \({\mathbb{R}^3}\) related to the Kerr nonlinear Maxwell equations for fully localized monochromatic fields. We search for solutions as minimizers (ground states) of the corresponding energy functional defined on subspaces (defocusing case) or natural constraints (focusing case) of \({H({\rm curl};\mathbb{R}^3)}\). Under a cylindrical symmetry assumption corresponding to a photonic fiber geometry on the functions V and \({\Gamma}\) the variational problem can be posed in a symmetric subspace of \({H({\rm curl};\mathbb{R}^3)}\). For a defocusing case \({{\rm sup} \Gamma < 0}\) with large negative values of \({\Gamma}\) at infinity we obtain ground states by the direct minimization method. For the focusing case \({{\rm inf} \Gamma > 0}\) the concentration compactness principle produces ground states under the assumption that zero lies outside the spectrum of the linear operator \({\nabla \times \nabla \times +V(x)}\). Examples of cylindrically symmetric functions V are provided for which this holds.     

Linear Maps Preserving Numerical Radius on Nest Algebras

A linear map \({\phi}\) of operator algebras is said to preserve numerical radius (or to be a numerical radius isometry) if \({w(\phi(A))=w(A)}\) for all A in its domain algebra, where w(A) stands for the numerical radius of A. In this paper, we prove that a surjective linear map \({\phi}\) of the nest algebra \({{\rm Alg}\mathcal N}\) onto itself preserves numerical radius if and only if there exist a unitary U and a complex number ξ of modulus one such that \({\phi(A)= \xi UAU^*}\) for all \({A\in{\rm Alg}\mathcal N}\), or there exist a unitary U, a conjugation J and a complex number ξ of modulus one such that \({\phi(A)=\xi UJA^*JU^*}\) for all \({A\in{\rm Alg}\mathcal N}\).     

On Modular Edge-Graceful Graphs

Let G be a connected graph of order \({n\ge 3}\) and size m and \({f:E(G)\to \mathbb{Z}_n}\) an edge labeling of G. Define a vertex labeling \({f': V(G)\to \mathbb{Z}_n}\) by \({f'(v)= \sum_{u\in N(v)}f(uv)}\) where the sum is computed in \({\mathbb{Z}_n}\) . If f′ is one-to-one, then f is called a modular edge-graceful labeling and G is a modular edge-graceful graph. A graph G is modular edge-graceful if G contains a modular edge-graceful spanning tree. Several classes of modular edge-graceful trees are determined. For a tree T of order n where \({n\not\equiv 2 \pmod 4}\) , it is shown that if T contains at most two even vertices or the set of even vertices of T induces a path, then T is modular edge-graceful. It is also shown that every tree of order n where \({n\not\equiv 2\pmod 4}\) having diameter at most 5 is modular edge-graceful.     

Fractional Differentiability for Solutions of Nonlinear Elliptic Equations

We study nonlinear elliptic equations in divergence form

$$\text {div }{\mathcal A}(x,Du)=\text {div } G.$$

When \({\mathcal A}\) has linear growth in D u, and assuming that \(x\mapsto {\mathcal A}(x,\xi )\) enjoys \(B^{\alpha }_{\frac {n}\alpha , q}\) smoothness, local well-posedness is found in \(B^{\alpha }_{p,q}\) for certain values of \(p\in [2,\frac {n}{\alpha })\) and \(q\in [1,\infty ]\). In the particular case \({\mathcal A}(x,\xi )=A(x)\xi \), G = 0 and \(A\in B^{\alpha }_{\frac {n}\alpha ,q}\), \(1\leq q\leq \infty \), we obtain \(Du\in B^{\alpha }_{p,q}\) for each \(p<\frac {n}\alpha \). Our main tool in the proof is a more general result, that holds also if \({\mathcal A}\) has growth s?1 in D u, 2 ≤ s ≤ n, and asserts local well-posedness in L ^q for each q > s, provided that \(x\mapsto {\mathcal A}(x,\xi )\) satisfies a locally uniform VMO condition.

     

Inflation of Finite Lattices Along All-or-nothing Sets

We introduce a new generalization of Alan Day’s doubling construction. For ordered sets \(\mathcal {L}\) and \(\mathcal {K}\) and a subset \(E \subseteq \ \leq _{\mathcal {L}}\) we define the ordered set \(\mathcal {L} \star _{E} \mathcal {K}\) arising from inflation of \(\mathcal {L}\) along E by \(\mathcal {K}\). Under the restriction that \(\mathcal {L}\) and \(\mathcal {K}\) are finite lattices, we find those subsets \(E \subseteq \ \leq _{\mathcal {L}}\) such that the ordered set \(\mathcal {L} \star _{E} \mathcal {K}\) is a lattice. Finite lattices that can be constructed in this way are classified in terms of their congruence lattices.A finite lattice is binary cut-through codable if and only if there exists a 0?1 spanning chain \(\left \{\theta _{i}\colon 0 \leq i \leq n \right \}\) in \(Con(\mathcal {L})\) such that the cardinality of the largest block of ?? _i /?? _i?1 is 2 for every i with 1≤i≤n. These are exactly the lattices that can be constructed by inflation from the 1-element lattice using only the 2-element lattice. We investigate the structure of binary cut-through codable lattices and describe an infinite class of lattices that generate binary cut-through codable varieties.     

Subgraph Transversal of Graphs

Given graphs F and G, denote by \({\tau_F}(G)\) the cardinality of a smallest subset \(T {\subseteq}V(G)\) that meets every maximal F-free subgraph of G. Erdös, Gallai and Tuza [9] considered the question of bounding \(\tau_{\overline{K_2}}(G)\) by a constant fraction of |G|. In this paper, we will give a complete answer to the following question: for which F, is τ _F (G) bounded by a constant fraction of |G|?In addition, for those graphs F for which \({\tau_F}(G)\) is not bounded by any fraction of |G|, we prove that \(\tau_F(G)\le|G|-\frac{1}{2}\sqrt{|G|}+\frac{1}{2}\), provided F is not K _k or \(\overline{K_k}\).