Largest initial segments pointwise fixed by automorphisms of models of set theory

Given a model \(\mathcal {M}\) of set theory, and a nontrivial automorphism j of \(\mathcal {M}\), let \(\mathcal {I}_{\mathrm {fix}}(j)\) be the submodel of \(\mathcal {M}\) whose universe consists of elements m of \(\mathcal {M}\) such that \(j(x)=x\) for every x in the transitive closure of m (where the transitive closure of m is computed within \(\mathcal {M}\)). Here we study the class \(\mathcal {C}\) of structures of the form \(\mathcal {I}_{\mathrm {fix}}(j)\), where the ambient model \(\mathcal {M}\) satisfies a frugal yet robust fragment of \(\mathrm {ZFC}\) known as \(\mathrm {MOST}\), and \(j(m)=m\) whenever m is a finite ordinal in the sense of \(\mathcal {M}.\) Our main achievement is the calculation of the theory of \(\mathcal {C}\) as precisely \(\mathrm {MOST+\Delta }_{0}^{\mathcal {P}}\)-\(\mathrm {Collection}\). The following theorems encapsulate our principal results: Theorem A. Every structure in \(\mathcal {C}\) satisfies \(\mathrm {MOST+\Delta }_{0}^{\mathcal {P}}\)-\(\mathrm { Collection}\). Theorem B. Each of the following three conditions is sufficient for a countable structure \(\mathcal {N}\) to be in \(\mathcal {C}\):(a) \(\mathcal {N}\) is a transitive model of \(\mathrm {MOST+\Delta }_{0}^{\mathcal {P}}\)-\(\mathrm {Collection}\).(b) \(\mathcal {N}\) is a recursively saturated model of \(\mathrm {MOST+\Delta }_{0}^{\mathcal {P}}\)-\(\mathrm {Collection}\).(c) \(\mathcal {N}\) is a model of \(\mathrm {ZFC}\). Theorem C. Suppose \(\mathcal {M}\) is a countable recursively saturated model of \(\mathrm {ZFC}\) and I is a proper initial segment of \(\mathrm {Ord}^{\mathcal {M}}\) that is closed under exponentiation and contains \(\omega ^\mathcal {M}\) . There is a group embedding \(j\longmapsto \check{j}\) from \(\mathrm {Aut}(\mathbb {Q})\) into \(\mathrm {Aut}(\mathcal {M})\) such that I is the longest initial segment of \(\mathrm {Ord}^{\mathcal {M}}\) that is pointwise fixed by \(\check{j}\) for every nontrivial \(j\in \mathrm {Aut}(\mathbb {Q}).\) In Theorem C, \(\mathrm {Aut}(X)\) is the group of automorphisms of the structure X, and \(\mathbb {Q}\) is the ordered set of rationals.     

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.     

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.     

On color-preserving automorphisms of Cayley graphs of odd square-free order

An automorphism \(\alpha \) of a Cayley graph \(\mathrm{Cay}(G,S)\) of a group G with connection set S is color-preserving if \(\alpha (g,gs) = (h,hs)\) or \((h,hs^{-1})\) for every edge \((g,gs)\in E(\mathrm{Cay}(G,S))\). If every color-preserving automorphism of \(\mathrm{Cay}(G,S)\) is also affine, then \(\mathrm{Cay}(G,S)\) is a Cayley color automorphism (CCA) graph. If every Cayley graph \(\mathrm{Cay}(G,S)\) is a CCA graph, then G is a CCA group. Hujdurovi? et al. have shown that every non-CCA group G contains a section isomorphic to the non-abelian group \(F_{21}\) of order 21. We first show that there is a unique non-CCA Cayley graph \(\Gamma \) of \(F_{21}\). We then show that if \(\mathrm{Cay}(G,S)\) is a non-CCA graph of a group G of odd square-free order, then \(G = H\times F_{21}\) for some CCA group H, and \(\mathrm{Cay}(G,S) = \mathrm{Cay}(H,T)\mathbin {\square }\Gamma \).     

Perfect state transfer in Laplacian quantum walk

For a graph G and a related symmetric matrix M, the continuous-time quantum walk on G relative to M is defined as the unitary matrix \(U(t) = \exp (-itM)\), where t varies over the reals. Perfect state transfer occurs between vertices u and v at time \(\tau \) if the (u, v)-entry of \(U(\tau )\) has unit magnitude. This paper studies quantum walks relative to graph Laplacians. Some main observations include the following closure properties for perfect state transfer. If an n-vertex graph has perfect state transfer at time \(\tau \) relative to the Laplacian, then so does its complement if \(n\tau \in 2\pi {\mathbb {Z}}\). As a corollary, the join of \(\overline{K}_{2}\) with any m-vertex graph has perfect state transfer relative to the Laplacian if and only if \(m \equiv 2\pmod {4}\). This was previously known for the join of \(\overline{K}_{2}\) with a clique (Bose et al. in Int J Quant Inf 7:713–723, 2009). If a graph G has perfect state transfer at time \(\tau \) relative to the normalized Laplacian, then so does the weak product \(G \times H\) if for any normalized Laplacian eigenvalues \(\lambda \) of G and \(\mu \) of H, we have \(\mu (\lambda -1)\tau \in 2\pi {\mathbb {Z}}\). As a corollary, a weak product of \(P_{3}\) with an even clique or an odd cube has perfect state transfer relative to the normalized Laplacian. It was known earlier that a weak product of a circulant with odd integer eigenvalues and an even cube or a Cartesian power of \(P_{3}\) has perfect state transfer relative to the adjacency matrix. As for negative results, no path with four vertices or more has antipodal perfect state transfer relative to the normalized Laplacian. This almost matches the state of affairs under the adjacency matrix (Godsil in Discret Math 312(1):129–147, 2011).     

The power graph on the conjugacy classes of a finite group

A digraph \({\overrightarrow{\mathcal{Pc}}(G)}\) is said to be the directed power graph on the conjugacy classes of a group G, if its vertices are the non-trivial conjugacy classes of G, and there is an arc from vertex C to C′ if and only if \({C \neq C'}\) and \({C \subseteqq {C'}^{m}}\) for some positive integer \({m > 0}\). Moreover, the simple graph \({\mathcal{Pc}(G)}\) is said to be the (undirected) power graph on the conjugacy classes of a group G if its vertices are the conjugacy classes of G and two distinct vertices C and C′ are adjacent in \({\mathcal{Pc}(G)}\) if one is a subset of a power of the other. In this paper, we find some connections between algebraic properties of some groups and properties of the associated graph.     

Structural Properties of Word Representable Graphs

Given a word \(w=w_1w_2\cdots w_n\) of length n over an ordered alphabet \(\Sigma _k\), we construct a graph \(G(w)=(V(w), E(w))\) such that V(w) has n vertices labeled \(1, 2,\ldots , n\) and for \(i, j \in V(w)\), \((i, j) \in E(w)\) if and only if \(w_iw_j\) is a scattered subword of w of the form \(a_{t}a_{t+1}\), \(a_t \in \Sigma _k\), for some \(1 \le t \le k-1\) with the ordering \(a_t<a_{t+1}\). A graph is said to be Parikh word representable if there exists a word w over \(\Sigma _k\) such that \(G=G(w)\). In this paper we characterize all Parikh word representable graphs over the binary alphabet in terms of chordal bipartite graphs. It is well known that the graph isomorphism (GI) problem for chordal bipartite graph is GI complete. The GI problem for a subclass of (6, 2) chordal bipartite graphs has been addressed. The notion of graph powers is a well studied topic in graph theory and its applications. We also investigate a bipartite analogue of graph powers of Parikh word representable graphs. In fact we show that for G(w), \(G(w)^{[3]}\) is a complete bipartite graph, for any word w over binary alphabet.     

Distance mean-regular graphs

We introduce the concept of distance mean-regular graph, which can be seen as a generalization of both vertex-transitive and distance-regular graphs. Let \(\Gamma \) be a graph with vertex set V, diameter D, adjacency matrix \(\varvec{A}\), and adjacency algebra \(\mathcal{A}\). Then, \(\Gamma \) is distance mean-regular when, for a given \(u\in V\), the averages of the intersection numbers \(p_{ij}^h(u,v)=|\Gamma _i(u)\cap \Gamma _j(v)|\) (number of vertices at distance i from u and distance j from v) computed over all vertices v at a given distance \(h\in \{0,1,\ldots ,D\}\) from u, do not depend on u. In this work we study some properties and characterizations of these graphs. For instance, it is shown that a distance mean-regular graph is always distance degree-regular, and we give a condition for the converse to be also true. Some algebraic and spectral properties of distance mean-regular graphs are also investigated. We show that, for distance mean regular-graphs, the role of the distance matrices of distance-regular graphs is played for the so-called distance mean-regular matrices. These matrices are computed from a sequence of orthogonal polynomials evaluated at the adjacency matrix of \(\Gamma \) and, hence, they generate a subalgebra of \(\mathcal{A}\). Some other algebras associated to distance mean-regular graphs are also characterized.     

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.     

Induced-Universal Graphs for Graphs with Bounded Maximum Degree

For a family \(\mathcal {F}\) of graphs, a graph U is induced-universal for \({\mathcal{F}}\) if every graph in \({\mathcal{F}}\) is an induced subgraph of U. We give a construction for an induced-universal graph for the family of graphs on n vertices with degree at most r, which has \(Cn^{\lfloor (r+1)/2\rfloor}\) vertices and \(Dn^{2\lfloor (r+1)/2\rfloor -1}\) edges, where C and D are constants depending only on r. This construction is nearly optimal when r is even in that such an induced-universal graph must have at least cn ^r/2 vertices for some c depending only on r.Our construction is explicit in that no probabilistic tools are needed to show that the graph exists or that a given graph is induced-universal. The construction also extends to multigraphs and directed graphs with bounded degree.     

The lattice of congruence lattices of algebras on a finite set

The congruence lattices of all algebras defined on a fixed finite set A ordered by inclusion form a finite atomistic lattice \(\mathcal {E}\). We describe the atoms and coatoms. Each meet-irreducible element of \(\mathcal {E}\) being determined by a single unary mapping on A, we characterize completely those which are determined by a permutation or by an acyclic mapping on the set A. Using these characterisations we deduce several properties of the lattice \(\mathcal {E}\); in particular, we prove that \(\mathcal {E}\) is tolerance-simple whenever \(|A|\ge 4\).     

Geometry of Coadjoint Orbits and Multiplicity-one Branching Laws for Symmetric Pairs

Consider the restriction of an irreducible unitary representation π of a Lie group G to its subgroup H. Kirillov’s revolutionary idea on the orbit method suggests that the multiplicity of an irreducible H-module ν occurring in the restriction π|_H could be read from the coadjoint action of H on \(\mathcal {O}^{G} \cap \text {pr}^{-1}({\mathcal {O}}^{H})\), provided π and ν are ‘geometric quantizations’ of a G-coadjoint orbit \(\mathcal {O}^{G}\) and an H-coadjoint orbit \(\mathcal {O}^{H}\), respectively, where \(\text {pr} \colon \sqrt {-1}\mathfrak {g}^{\ast } \to \sqrt {-1}\mathfrak {h}^{\ast }\) is the projection dual to the inclusion \(\mathfrak {h} \subset \mathfrak {g}\) of Lie algebras. Such results were previously established by Kirillov, Corwin and Greenleaf for nilpotent Lie groups. In this article, we highlight specific elliptic orbits \(\mathcal {O}^{G}\) of a semisimple Lie group G corresponding to highest weight modules of scalar type. We prove that the Corwin–Greenleaf number \(\sharp (\mathcal {O}^{G} \cap \text {pr}^{-1}({\mathcal {O}}^{H}))/H\) is either zero or one for any H-coadjoint orbit \(\mathcal {O}^{H}\), whenever (G,H) is a symmetric pair of holomorphic type. Furthermore, we determine the coadjoint orbits \(\mathcal {O}^{H}\) with nonzero Corwin–Greenleaf number. Our results coincide with the prediction of the orbit philosophy, and can be seen as ‘classical limits’ of the multiplicity-free branching laws of holomorphic discrete series representations (Kobayashi [Progr. Math. 2007]).     

A Tight Upper Bound on Acquaintance Time of Graphs

In this note we confirm a conjecture raised by Benjamini et al. (SIAM J Discrete Math 28(2):767–785, 2014) on the acquaintance time of graphs, proving that for all graphs G with n vertices it holds that \(\mathcal {AC}(G) = O(n^{3/2})\). This is done by proving that for all graphs G with n vertices and maximum degree \(\varDelta \) it holds that \(\mathcal {AC}(G) \le 20 \varDelta n\). Combining this with the bound \(\mathcal {AC}(G) \le O(n^2/\varDelta )\) from Benjamini et al. (SIAM J Discrete Math 28(2):767–785, 2014) gives the uniform upper bound of \(O(n^{3/2})\) for all n-vertex graphs. This bound is tight up to a multiplicative constant. We also prove that for the n-vertex path \(P_n\) it holds that \(\mathcal {AC}(P_n)=n-2\). In addition we show that the barbell graph \(B_n\) consisting of two cliques of sizes \({\lceil n/2\rceil }\) and \({\lfloor n/2\rfloor }\) connected by a single edge also has \(\mathcal {AC}(B_n) = n-2\). This shows that it is possible to add \(\varOmega (n^2\)) edges a graph without changing its \(\mathcal {AC}\) value.     

Undirected forest constraints

We present two constraints that partition the vertices of an undirected n-vertex, m-edge graph \(\mathcal {G}=( \mathcal {V}, \mathcal {E})\) into a set of vertex-disjoint trees. The first is the resource-forest constraint, where we assume that a subset \(\mathcal {R}\subseteq \mathcal {V}\) of the vertices are resource vertices. The constraint specifies that each tree in the forest must contain at least one resource vertex. This is the natural undirected counterpart of the tree constraint (Beldiceanu et al., CP-AI-OR’05, Springer, Berlin, 2005), which partitions a directed graph into a forest of directed trees where only certain vertices can be tree roots. We describe a hybrid-consistency algorithm that runs in \(\mathop {\mathcal {O}}(m+n)\) time for the resource-forest constraint, a sharp improvement over the \(\mathop {\mathcal {O}}(mn)\) bound that is known for the directed case. The second constraint is proper-forest. In this variant, we do not have the requirement that each tree contains a resource, but the forest must contain only proper trees, i.e., trees that have at least two vertices each. We develop a hybrid-consistency algorithm for this case whose running time is \(\mathop {\mathcal {O}}(mn)\) in the worst case, and \(\mathop {\mathcal {O}}(m\sqrt{n})\) in many (typical) cases.     

On the Heat Equation with Nonlinearity and Singular Anisotropic Potential on the Boundary

This paper concerns with the heat equation in the half-space \(\mathbb {R}_{+}^{n}\) with nonlinearity and singular potential on the boundary \(\partial \mathbb {R}_{+}^{n}\). We show a well-posedness result that allows us to consider critical potentials with infinite many singularities and anisotropy. Motivated by potential profiles of interest, the analysis is performed in weak L ^p -spaces in which we prove linear estimates for some boundary operators arising from the Duhamel integral formulation in \(\mathbb {R}_{+}^{n}\). Moreover, we investigate qualitative properties of solutions like self-similarity, positivity and symmetry around the axis \(\overrightarrow {Ox_{n}}\).     

Fast approximation of matroid packing and covering

We study packing problems with matroid structures, which includes the strength of a graph of Cunningham and scheduling problems. If \(\mathcal {M}\) is a matroid over a set of elements S with independent set \(\mathcal {I}\), and \(m=|S|\), we suppose that we are given an oracle function that takes an independent set \(A\in \mathcal {I}\) and an element \(e\in S\) and determines if \(A\cup \{e\}\) is independent in time I(m). Also, given that the elements of A are represented in an ordered way \(A=\{A_1,\dots ,A_k\}\), we denote the time to check if \(A\cup \{e\}\notin \mathcal {I}\) and if so, to find the minimum \(i\in \{0,\dots ,k\}\) such that \(\{A_1,\dots ,A_i\}\cup \{e\}\notin \mathcal {I}\) by \(I^*(m)\). Then, we describe a new FPTAS that computes for any \(\varepsilon >0\) and for any matroid \(\mathcal {M}\) of rank r over a set S of m elements, in memory space O(m), the packing \(\varLambda ({\mathcal {M}})\) within \(1+\varepsilon \) in time \(O(mI^*(m)\log (m)\log (m/r)/\varepsilon ^2)\), and the covering \(\varUpsilon ({\mathcal {M}})\) in time \(O(r\varUpsilon ({\mathcal {M}})I(m)\log (m)\log (m/r)/\varepsilon ^2)\). This method outperforms in time complexity by a factor of \(\varOmega (m/r)\) the FPTAS of Plotkin, Shmoys, and Tardos, and a factor of \(\varOmega (m)\) the FPTAS of Garg and Konemann. On top of the value of the packing and the covering, our algorithm exhibits a combinatorial object that proves the approximation. The applications of this result include graph partitioning, minimum cuts, VLSI computing, job scheduling and others.     

On $$\mathfrak {F}_{hq}$$-supplemented subgroups of a finite group

A subgroup H of a finite group G is quasinormal in G if it permutes with every subgroup of G. A subgroup H of a finite group G is \(\mathfrak {F}_{hq}\)-supplemented in G if G has a quasinormal subgroup N such that HN is a Hall subgroup of G and \((H\cap N)H_{G}/ H_{G} \le Z_{\mathfrak {F}}(G/H_{G})\), where \(H_{G}\) is the core of H in G and \({Z}_{\mathfrak {F}} (G/H_{G})\) is the \(\mathfrak {F}\)-hypercenter of \({G/H}_{G}\). This paper concerns the structure of a finite group G under the assumption that some subgroups of G are \(\mathfrak {F}_{hq}\)-supplemented in G.     

Hausdorffness for Lie algebra homology of Schwartz spaces and applications to the comparison conjecture

Let H be a real algebraic group acting equivariantly with finitely many orbits on a real algebraic manifold X and a real algebraic bundle \({\mathcal {E}}\) on X. Let \(\mathfrak {h}\) be the Lie algebra of H. Let \(\mathcal {S}(X,{\mathcal {E}})\) be the space of Schwartz sections of \({\mathcal {E}}\). We prove that \(\mathfrak {h}\mathcal {S}(X,{\mathcal {E}})\) is a closed subspace of \(\mathcal {S}(X,{\mathcal {E}})\) of finite codimension. We give an application of this result in the case when H is a real spherical subgroup of a real reductive group G. We deduce an equivalence of two old conjectures due to Casselman: the automatic continuity and the comparison conjecture for zero homology. Namely, let \(\pi \) be a Casselman–Wallach representation of G and V be the corresponding Harish–Chandra module. Then the natural morphism of coinvariants \(V_{\mathfrak {h}}\rightarrow \pi _{\mathfrak {h}}\) is an isomorphism if and only if any linear \(\mathfrak {h}\)-invariant functional on V is continuous in the topology induced from \(\pi \). The latter statement is known to hold in two important special cases: if H includes a symmetric subgroup, and if H includes the nilradical of a minimal parabolic subgroup of G.     

The order continuity in ordered algebras

Let A be an ordered algebra with a unit \(\mathbf{e}\) and a cone \(A^+\). The class of order continuous elements \(A_\mathrm{n}\) of A is introduced and studied. If \(A=L(E)\), where E is a Dedekind complete Riesz space, this class coincides with the band \(L_\mathrm{n}(E)\) of all order continuous operators on E. Special subclasses of \(A_\mathrm {n}\) are considered. Firstly, the order ideal \(A_\mathbf{e}\) generated by \(\mathbf{e}\). It is shown that \(A_\mathbf{e}\) can be embedded into the algebra of continuous functions and, in particular, is a commutative subalgebra of A. If A is an ordered Banach algebra with normal cone \(A^+\) then \(A_\mathbf{e}\) is an AM-space and is closed in A. Secondly, the notion of an orthomorphism in the ordered algebra A is introduced. Among others, the conditions under which orthomorphisms are order continuous, are considered. In the second part, the main emphasis will be on the case of an ordered \(C^*\)-algebra A and, in particular, on the case of the algebra B(H), where H is an ordered Hilbert space with self-adjoint cone \(H^+\). If the cone \(A^+\) is normal then every element of \(A_\mathbf{e}\) is hermitian. In H the operations are introduced which coincide with the lattice ones when H is a Riesz space. It is shown that every regular \(T\in B(H)\) is an order continuous element and operators \(T\in (B(H))_I\) have properties which are analogous to the properties of orthomorphisms on Riesz spaces.     

Approximating graph-constrained max-cut

An instance of the graph-constrained max-cut (\(\mathsf {GCMC}\)) problem consists of (i) an undirected graph \(G=(V,E)\) and (ii) edge-weights \(c:{V\atopwithdelims ()2} \rightarrow \mathbb {R}_+\) on a complete undirected graph. The objective is to find a subset \(S \subseteq V\) of vertices satisfying some graph-based constraint in G that maximizes the weight \(\sum _{u\in S, v\not \in S} c_{uv}\) of edges in the cut \((S,V{\setminus } S)\). The types of graph constraints we can handle include independent set, vertex cover, dominating set and connectivity. Our main results are for the case when G is a graph with bounded treewidth, where we obtain a \(\frac{1}{2}\)-approximation algorithm. Our algorithm uses an LP relaxation based on the Sherali–Adams hierarchy. It can handle any graph constraint for which there is a dynamic program of a specific form. Using known decomposition results, these imply essentially the same approximation ratio for \(\mathsf {GCMC}\) under constraints such as independent set, dominating set and connectivity on a planar graph G.