Problems on matchings and independent sets of a graph

Let $G$ be a finite simple graph. For $X?V\left(G\right)$, the difference of $X$, $d\left(X\right)?\left|X\right|?\left|N\left(X\right)\right|$ where $N\left(X\right)$ is the neighborhood of $X$ and $max\{d\left(X\right):X?V\left(G\right)\}$ is called the critical difference of $G$. $X$ is called a critical set if $d\left(X\right)$ equals the critical difference and $\ker \left(G\right)$ is the intersection of all critical sets. $\mathrm{diadem}\left(G\right)$ is the union of all critical independent sets. An independent set $S$ is an inclusion minimal set with$d\left(S\right)>0$ if no proper subset of $S$ has positive difference.A graph $G$ is called a König–Egerváry graph if the sum of its independence number $\alpha \left(G\right)$ and matching number $\mu \left(G\right)$ equals $\left|V\left(G\right)\right|$.In this paper, we prove a conjecture which states that for any graph the number of inclusion minimal independent set $S$ with $d\left(S\right)>0$ is at least the critical difference of the graph.We also give a new short proof of the inequality $\left|\ker \left(G\right)\right|+\left|\mathrm{diadem}\left(G\right)\right|\le 2\alpha \left(G\right)$.A characterization of unicyclic non-König–Egerváry graphs is also presented and a conjecture which states that for such a graph $G$, the critical difference equals $\alpha \left(G\right)?\mu \left(G\right)$, is proved.We also make an observation about $\ker \left(G\right)$ using Edmonds–Gallai Structure Theorem as a concluding remark.     

On graphs with largest possible game domination number

Let $\gamma \left(G\right)$ and ${\gamma }_g\left(G\right)$ be the domination number and the game domination number of a graph $G$, respectively. In this paper ${\gamma }_g$-maximal graphs are introduced as the graphs $G$ for which ${\gamma }_g\left(G\right)=2\gamma \left(G\right)?1$ holds. Large families of ${\gamma }_g$-maximal graphs are constructed among the graphs in which their sets of support vertices are minimum dominating sets. ${\gamma }_g$-maximal graphs are also characterized among the starlike trees, that is, trees which have exactly one vertex of degree at least $3$.     

A generalization of inverse distance weighting and an equivalence relationship to noise-free Gaussian process interpolation via Riesz representation theorem

In this paper, we show the relationship between two seemingly unrelated approximation techniques. On the one hand, a certain class of Gaussian process-based interpolation methods, and on the other hand inverse distance weighting, which has been developed in the context of spatial analysis where there is often a need for interpolating from irregularly spaced data to produce a continuous surface. We develop a generalization of inverse distance weighting and show that it is equivalent to the approximation provided by the class of Gaussian process-based interpolation methods. The equivalence is established via an elegant application of Riesz representation theorem concerning the dual of a Hilbert space. It is thus demonstrated how a classical theorem in linear algebra connects two disparate domains.     

Elementary inductive dichotomy: Separation of open and clopen determinacies with infinite alternatives

We introduce a new axiom called inductive dichotomy, a weak variant of the axiom of inductive definition, and analyze the relationships with other variants of inductive definition and with related axioms, in the general second order framework, including second order arithmetic, second order set theory and higher order arithmetic. By applying these results to the investigations on the determinacy axioms, we show the following. (i) Clopen determinacy is consistency-wise strictly weaker than open determinacy in these frameworks, except second order arithmetic; this is an enhancement of Schweber–Hachtman separation of open and clopen determinacy into the consistency-wise separation. (ii) Hausdorff–Kuratowski hierarchy of differences of opens is faithfully reflected by the hierarchy of consistency strengths of corresponding parameter-free determinacies in the aforementioned frameworks; this result is valid also in second order arithmetic only except clopen determinacy.     

Cultivating a research imperative: Mentoring mathematics at Stockholms Högskola, 1882–1887

Though the central role of Gösta Mittag-Leffler in the promotion of specialized, research-oriented mathematics at Stockholms Högskola is widely acknowledged, the specific social and technical means by which he sought to cultivate a fledgling research community there during the early- to mid-1880s have received little attention. In particular, a detailed study of the relationship of his own research activity to that of his first Swedish students is absent from the existing literature.Through the juxtaposition of their research activities and unpublished correspondence, this paper explores Mittag-Leffler's active and deliberate efforts to engage his students Ivar Bendixson and Edvard Phragmén in open problems within his own research agenda, support them through his institutional connections, and instill within them norms concerning research ideologies, practices of communication and criticism, and frameworks for shared knowledge. It also illuminates the extent to which his teachings took root in at least one student to emerge from his program, who would perpetuate the mathematical practices set in place by his teacher and set forth on the international stage to promote his newly-acquired system of values.     

High order convergent modified nodal bi-cubic spline collocation method for elliptic partial differential equation

A high order modified nodal bi-cubic spline collocation method is proposed for numerical solution of second-order elliptic partial differential equation subject to Dirichlet boundary conditions. The approximation is defined on a square mesh stencil using nine grid points. The solution of the method exists and is unique. Convergence analysis has been presented. Moreover, the superconvergent phenomena can be seen in proposed one step method. The numerical results clearly exhibit the superiority of the new approximation, in terms of both accuracy and computational efficiency.     

Well-Conditioned Spectral Collocation Methods for Problems in Unbounded Domains

Based on the generalized Laguerre and Hermite functions, we construct two types of Birkhoff-type interpolation basis functions. The explicit expressions are derived, and fast and stable algorithms are provided for computing these basis functions. As applications, some well-conditioned collocation methods are proposed for solving various second-order differential equations in unbounded domains. Numerical experiments illustrate that our collocation methods are more efficient than the standard Laguerre/Hermite collocation approaches.     

An Adaptive Nonmonotone Projected Barzilai-Borwein Gradient Method with Active Set Prediction for Nonnegative Matrix Factorization

In this paper, we first present an adaptive nonmonotone term to improve the efficiency of nonmonotone line search, and then an active set identification technique is suggested to get more efficient descent direction such that it improves the local convergence behavior of algorithm and decreases the computation cost. By means of the adaptive nonmonotone line search and the active set identification technique, we put forward a global convergent gradient-based method to solve the nonnegative matrix factorization (NMF) based on the alternating nonnegative least squares framework, in which we introduce a modified Barzilai-Borwein (BB) step size. The new modified BB step size and the larger step size strategy are exploited to accelerate convergence. Finally, the results of extensive numerical experiments using both synthetic and image datasets show that our proposed method is efficient in terms of computational speed.     

Partial difference sets and amorphic Cayley schemes in non‐abelian 2‐groups

In this paper, we consider regular automorphism groups of graphs in the RT2 family and the Davis‐Xiang family and amorphic abelian Cayley schemes from these graphs. We derive general results on the existence of non‐abelian regular automorphism groups from abelian regular automorphism groups and apply them to the RT2 family and Davis‐Xiang family and their amorphic abelian Cayley schemes to produce amorphic non‐abelian Cayley schemes.     

Exponential attractor for Hindmarsh-Rose equations in neurodynamics

The existence of exponential attractor for the diffusive Hindmarsh-Rose equations on a three-dimensional bounded domain in the study of neurodynamics is proved through uniform estimates and a new theorem on the squeezing property of the abstract reaction-diffusion equation established in this paper. This result on the exponential attractor infers that the global attractor whose existence has been proved in [22] for the diffusive Hindmarsh-Rose semiflow has a finite fractal dimension.