Domination in the hierarchical product and Vizing’s conjecture

Given a graph $G$, a set $S?V\left(G\right)$ is a dominating set of $G$ if every vertex of $G$ is either in $S$ or adjacent to a vertex in $S$. The domination number of $G$, denoted $\gamma \left(G\right)$, is the minimum cardinality of a dominating set of $G$. Vizing’s conjecture states that $\gamma (G\square H)\ge \gamma \left(G\right)\gamma \left(H\right)$ for any graphs $G$ and $H$ where $G\square H$ denotes the Cartesian product of $G$ and $H$. In this paper, we continue the work by Anderson et al. (2016) by studying the domination number of the hierarchical product. Specifically, we show that partitioning the vertex set of a graph in a particular way shows a trend in the lower bound of the domination number of the product, providing further evidence that the conjecture is true.     

Some remarks on Kong-Liu’s conjecture on Lorentzian metrics

For a(1+3)-dimensional Lorentzian manifold(M,g),the general form of solutions of the Einstein field equations takes that of type I,II,or III.For type I,there is a known result in Gu(2007).In this paper,we try to find the necessary and sufficient conditions for the Lorentzian metric to take the form of types II and III,and we show how to construct the new coordinate system.     

Some remarks on the odd hadwiger’s conjecture

We say that H has an odd complete minor of order at least l if there are l vertex disjoint trees in H such that every two of them are joined by an edge, and in addition, all the vertices of trees are two-colored in such a way that the edges within the trees are bichromatic, but the edges between trees are monochromatic. Gerards and Seymour conjectured that if a graph has no odd complete minor of order l, then it is (l ? 1)-colorable. This is substantially stronger than the well-known conjecture of Hadwiger. Recently, Geelen et al. proved that there exists a constant c such that any graph with no odd K _k -minor is ck√logk-colorable. However, it is not known if there exists an absolute constant c such that any graph with no odd K _k -minor is ck-colorable. Motivated by these facts, in this paper, we shall first prove that, for any k, there exists a constant f(k) such that every (496k + 13)-connected graph with at least f(k) vertices has either an odd complete minor of size at least k or a vertex set X of order at most 8k such that G–X is bipartite. Since any bipartite graph does not contain an odd complete minor of size at least three, the second condition is necessary. This is an analogous result of Böhme et al. We also prove that every graph G on n vertices has an odd complete minor of size at least n/2α(G) ? 1, where α(G) denotes the independence number of G. This is an analogous result of Duchet and Meyniel. We obtain a better result for the case α(G)= 3.     

A Brauer’s theorem and related results

Given a square matrix A, a Brauer’s theorem [Brauer A., Limits for the characteristic roots of a matrix. IV. Applications to stochastic matrices, Duke Math. J., 1952, 19(1), 75–91] shows how to modify one single eigenvalue of A via a rank-one perturbation without changing any of the remaining eigenvalues. Older and newer results can be considered in the framework of the above theorem. In this paper, we present its application to stabilization of control systems, including the case when the system is noncontrollable. Other applications presented are related to the Jordan form of A and Wielandt’s and Hotelling’s deflations. An extension of the aforementioned Brauer’s result, Rado’s theorem, shows how to modify r eigenvalues of A at the same time via a rank-r perturbation without changing any of the remaining eigenvalues. The same results considered by blocks can be put into the block version framework of the above theorem.     

Functional inequalities related to Mahler’s conjecture

Extending a result of Meyer and Reisner (Monatsh Math 125:219–227, 1998), we prove that if ${g: \mathbb{R}\to \mathbb{R}_+}$ is a function which is concave on its support, then for every m > 0 and every ${z\in\mathbb{R}}$ such that g(z) > 0, one has $$ \int\limits_{\mathbb{R}} g(x)^mdx\int\limits_{\mathbb{R}} (g^{*z}(y))^m dy\ge \frac{(m+2)^{m+2}}{(m+1)^{m+3}},$$ where for ${y\in \mathbb{R}}$ , ${g^{*z}(y)=\inf_x \frac{(1-(x-z)y)_+}{g(x)}}$ . It is shown how this inequality is related to a special case of Mahler’s conjecture (or inverse Santaló inequality) for convex bodies. The same ideas are applied to give a new (and simple) proof of the exact estimate of the functional inverse Santaló inequality in dimension 1 given in Fradelizi and Meyer (Adv Math 218:1430–1452, 2008). Namely, if ${\phi:\mathbb{R}\to\mathbb{R}\cup\{+\infty\}}$ is a convex function such that ${0 < \int e^{-\phi} < +\infty}$ then, for every ${z\in\mathbb{R}}$ such that ${\phi(z) < +\infty}$ , one has $$ \int\limits_{\mathbb{R}}e^{-\phi}\int\limits_{\mathbb{R}} e^{-\mathcal{L}^z\phi}\ge e,$$ where ${\mathcal {L}^z\phi}$ is the Legendre transform of ${\phi}$ with respect to z.     

Functional inequalities related to Mahler’s conjecture

Extending a result of Meyer and Reisner (Monatsh Math 125:219–227, 1998), we prove that if g: \mathbbR? \mathbbR₊{g: \mathbb{R}\to \mathbb{R}_+} is a function which is concave on its support, then for every m > 0 and every z ? \mathbbR{z\in\mathbb{R}} such that g(z) > 0, one has

Remarks on Harada’s conjecture

An open conjecture by Harada from 1981 gives an easy characterization of the p-blocks of a finite group in terms of the ordinary character table. Kiyota and Okuyama have shown that the conjecture holds for p-solvable groups. In the present work we extend this result using a criterion on the decomposition matrix. In this way we prove Harada’s Conjecture for several new families of defect groups and for all blocks of sporadic simple groups. In the second part of the paper we present a dual approach to Harada’s Conjecture.     

On De Giorgi’s conjecture: Recent progress and open problems

In 1979,De Giorgi conjectured that the only bounded monotone solutions to the Allen-Cahn equation △u+u-u~3=0 in R~N,are one-dimensional.This conjecture and its connection with minimal surfaces and Toda systems are the subject of this survey article.     

Some computational results on real 0–1 knapsack problems

The most recent algorithms to solve binary knapsack problems employ Lagrangean based reduction schemes to fix on or off a significant portion of the variables. This paper points out that, on hard problems encountered in practice, the repeated. application of an LP-based reduction on the pivot variable can greatly shorten solution times     

A remark on Donovan’s conjecture

It is shown that the difference between Donovans conjecture and the weaker conjecture bounding Cartan numbers of blocks of finite groups by the defect of the blocks can be expressed in terms of the relationship between pairs of Galois conjugate blocks. A consequence is that for principal blocks the two conjectures are equivalent.Received: 11 August 2003     

A note on Barnette’s conjecture

A well-known conjecture of Barnette states that every 3-connected cubic bipartite planar graph has a Hamiltonian cycle, which is equivalent to the statement that every 3-connected even plane triangulation admits a 2-tree coloring, meaning that the vertices of the graph have a 2-coloring such that each color class induces a tree. In this paper we present a new approach to Barnette’s conjecture by using 2-tree coloring.A Barnette triangulation is a 3-connected even plane triangulation, and a B-graph is a smallest Barnette triangulation without a 2-tree coloring. A configuration is reducible if it cannot be a configuration of a B-graph. We prove that certain configurations are reducible. We also define extendable, non-extendable and compatible graphs; and discuss their connection with Barnette’s conjecture.     

Remarks on Serre’s modularity conjecture

In this article we give a proof of Serre’s conjecture for the case of odd level and arbitrary weight. Our proof does not use any modularity lifting theorem in characteristic 2 (moreover, we will not consider at all characteristic 2 representations at any step of our proof). The key tool in the proof is a very general modularity lifting result of Kisin, which is combined with the methods and results of previous articles on Serre’s conjecture by Khare, Wintenberger, and the author, and modularity results of Schoof for abelian varieties of small conductor. Assuming GRH, infinitely many cases of even level will also be proved.     

Purcell’s method, Egerváry and related results

After having been appeared, Egerváry was perhaps the first who responded to Purcell’s paper in 1957. Later in a posthumous paper he returned to the method in 1960, showing that it could be derived from his rank reduction procedure. We review here Purcell’s method in connection with Egerváry’s activity and also, we give a short survey on subsequent developments.     

Baker’s conjecture and Eremenko’s conjecture for functions with negative zeros

We introduce a new technique that allows us to make progress on two long standing conjectures in transcendental dynamics: Baker's conjecture that a transcendental entire function of order less than 1/2 has no unbounded Fatou components, and Eremenko's conjecture that all the components of the escaping set of an entire function are unbounded. We show that both conjectures hold for many transcendental entire functions whose zeros all lie on the negative real axis, in particular those of order less than 1/2. Our proofs use a classical distortion theorem based on contraction of the hyperbolic metric, together with new results which show that the images of certain curves must wind many times round the origin.