Strong complete minors in digraphs

Kostochka and Thomason independently showed that any graph with average degree $\Omega(r\sqrt{\log r})$ contains a $K_r$ minor. In particular, any graph with chromatic number $\Omega(r\sqrt{\log r})$ contains a $K_r$ minor, a partial result towards Hadwiger’s famous conjecture. In this paper, we investigate analogues of these results in the directed setting. There are several ways to define a minor in a digraph. One natural way is as follows. A strong $\overrightarrow{K}_{\!\!r}$ minor is a digraph whose vertex set is partitioned into r parts such that each part induces a strongly connected subdigraph, and there is at least one edge in each direction between any two distinct parts. We investigate bounds on the dichromatic number and minimum out-degree of a digraph that force the existence of strong $\overrightarrow{K}_{\!\!r}$ minors as subdigraphs. In particular, we show that any tournament with dichromatic number at least 2r contains a strong $\overrightarrow{K}_{\!\!r}$ minor, and any tournament with minimum out-degree $\Omega(r\sqrt{\log r})$ also contains a strong $\overrightarrow{K}_{\!\!r}$ minor. The latter result is tight up to the implied constant and may be viewed as a strong-minor analogue to the classical result of Kostochka and Thomason. Lastly, we show that there is no function $f\;:\;\mathbb{N} \rightarrow \mathbb{N}$ such that any digraph with minimum out-degree at least f(r) contains a strong $\overrightarrow{K}_{\!\!r}$ minor, but such a function exists when considering dichromatic number.

Strong Cliques in Claw-Free Graphs

For a graph G, $$L(G)^2$$ L ( G ) 2 is the square of the line graph of G – that is, vertices of $$L(G)^2$$ L ( G ) 2 are edges of G and two edges $$e,f\in E(G)$$ e , f ∈ E ( G ) are adjacent in $$L(G)^2$$ L ( G ) 2 if at least one vertex of e is adjacent to a vertex of f and $$e\ne f$$ e ≠ f . The strong chromatic index of G, denoted by $$s'(G)$$ s ′ ( G ) , is the chromatic number of $$L(G)^2$$ L ( G ) 2 . A strong clique in G is a clique in $$L(G)^2$$ L ( G ) 2 . Finding a bound for the maximum size of a strong clique in a graph with given maximum degree is a problem connected to a famous conjecture of Erdős and Nešetřil concerning strong chromatic index of graphs. In this note we prove that a size of a strong clique in a claw-free graph with maximum degree $$\varDelta $$ Δ is at most $$\varDelta ^2 + \frac{1}{2}\varDelta $$ Δ 2 + 1 2 Δ . This result improves the only known result $$1.125\varDelta ^2+\varDelta $$ 1.125 Δ 2 + Δ , which is a bound for the strong chromatic index of claw-free graphs.

Doubly stochastic matrices and the quantum channels

The main object of this paper is to study doubly stochastic matrices with majorization and the Birkhoff theorem. The Perron-Frobenius theorem on eigenvalues is generalized for doubly stochastic matrices. The region of all possible eigenvalues of n-by-n doubly stochastic matrix is the union of regular (n – 1) polygons into the complex plane. This statement is ensured by a famous conjecture known as the Perfect-Mirsky conjecture which is true for n = 1, 2, 3, 4 and untrue for n = 5. We show the extremal eigenvalues of the Perfect-Mirsky regions graphically for n = 1, 2, 3, 4 and identify corresponding doubly stochastic matrices. Bearing in mind the counterexample of Rivard-Mashreghi given in 2007, we introduce a more general counterexample to the conjecture for n = 5. Later, we discuss different types of positive maps relevant to Quantum Channels (QCs) and finally introduce a theorem to determine whether a QCs gives rise to a doubly stochastic matrix or not. This evidence is straightforward and uses the basic tools of matrix theory and functional analysis.

Quantum critical scaling and holographic bound for transport coefficients near Lifshitz points

The transport behavior of strongly anisotropic systems is significantly richer compared to isotropic ones. The most dramatic spatial anisotropy at a critical point occurs at a Lifshitz transition, found in systems with merging Dirac or Weyl point or near the superconductor-insulator quantum phase transition. Previous work found that in these systems a famous conjecture on the existence of a lower bound for the ratio of a shear viscosity to entropy is violated, and proposed a generalization of this bound for anisotropic systems near charge neutrality involving the electric conductivities. The present study uses scaling arguments and the gauge-gravity duality to confirm the previous analysis of universal bounds in anisotropic Dirac systems. We investigate the strongly-coupled phase of quantum Lifshitz systems in a gravitational Einstein-Maxwell-dilaton model with a linear massless scalar which breaks translations in the boundary dual field theory and sources the anisotropy. The holographic computation demonstrates that some elements of the viscosity tensor can be related to the ratio of the electric conductivities through a simple geometric ratio of elements of the bulk metric evaluated at the horizon, and thus obey a generalized bound, while others violate it. From the IR critical geometry, we express the charge diffusion constants in terms of the square butterfly velocities. The proportionality factor turns out to be direction-independent, linear in the inverse temperature, and related to the critical exponents which parametrize the anisotropic scaling of the dual field theory.

Search for like-minded math friends, because of the Twin Prime Conjecture

“Search for like-minded math friends, because of the Twin Prime Conjecture” tells the story of a famous conjecture about prime numbers and the unknown mathematician, Yitang Zhang, who reported a significant breakthrough on the problem that earned him a MacArthur Fellowship. The Twin Prime Conjecture is a statement claiming that the number of prime number pairs that differ by two is infinite. Even though remote parts of the number line have a sparse distribution of primes, mathematicians suspect that the claim is true. Mathematics students and enthusiasts are encouraged to draw inspiration from this story by searching for like-minded friends in their mathematical and life pursuits. At the chapter’s end, readers may check their understanding by working on a problem. A solution is provided.

A survey on Hamiltonicity in Cayley graphs and digraphs on different groups

Lovász had posed a question stating whether every connected, vertex-transitive graph has a Hamilton path in 1969. There is a growing interest in solving this longstanding problem and still it remains widely open. In fact, it was known that only five vertex-transitive graphs exist without a Hamiltonian cycle which do not belong to Cayley graphs. A Cayley graph is the subclass of vertex-transitive graph, and in view of the Lovász conjecture, the attention has focused more toward the Hamiltonicity of Cayley graphs. This survey will describe the current status of the search for Hamiltonian cycles and paths in Cayley graphs and digraphs on different groups, and discuss the future direction regarding famous conjecture.

Index, sub-index and sub-factor of groups with interactions to number theory

This paper is the first step of a new topic about groups which has close relations and applications to number theory. Considering the factorization of a group into a direct product of two subsets, and since every subgroup is a left and right factor, we observed that the index conception can be generalized for a class of factors. But, thereafter, we found that every subset [Formula: see text] of a group [Formula: see text] has four related sub-indexes: right, left, upper and lower sub-indexes [Formula: see text], [Formula: see text] which agree with the conception index of subgroups, and all of them are equal if [Formula: see text] is a subgroup or normal sub-semigroup of [Formula: see text]. As a result of the topic, we introduce some equivalent conditions to a famous conjecture for prime numbers (“every even number is the difference of two primes”) that one of them is: the prime numbers set is index stable (i.e. all of its sub-indexes are equal) in integers and [Formula: see text]. Index stable groups (i.e. those whose subsets are all index stable) are a challenging subject of the topic with several results and ideas. Regarding the extension of the theory, we give some methods for evaluation of sub-indexes, by using the left and right differences of subsets. At last, we pose many open problems, questions, a proposal for additive number theory, and show some future directions of researches and projects for the theory.

Discovery on Goldbach conjecture

Goldbach's famous conjecture has always fascinated eminent mathematicians. In this paper we give a rigorous proof basedon a new formulation, namely, that every even integer has a primo-raduis. Our proof is mainly based on the application ofChebotarev-Artin's theorem, Mertens' formula and the Principle exclusion-inclusion of Moivre.

On the Unicity Conjecture for Generalized Markoff Equation

<p>The Markoff equation x² + y² + z² = 3xyz is introduced by A.A. Markoff in 1879. A famous conjecture on the Markoff equation, made by Frobinus in 1913, states that any Markoff triples (x, y, z) with x ≤ y ≤ z is uniquely determined by its largest number z. The complete solution of this equation is still open however the partial solution is given by Barager (1996), Button (2001), Zhang (2007), Srinivasan (2009), Chen and Chen (2013). In 1957, Mordell developed a generalization to the Markoff equation of the form x² + y² + z² = Axyz + B where, A and B are positive integers. In 2015, Donald McGinn take a particular form of above equation with A = 1 and B = A and gave a partial solution to the unicity conjecture to this equation. In this paper, the partial solution to the unicity conjecture to the equation of the form x² + y² + z² =3xyz + A where A is positive integer with A ≤ 4(x² –1) is given. </p><p><strong>Journal of Advanced College of Engineering and Management,</strong> Vol. 3, 2017, Page : 137-145</p>

On Ryser’s Conjecture for $t$-Intersecting and Degree-Bounded Hypergraphs

A famous conjecture (usually called Ryser's conjecture) that appeared in the PhD thesis of his student, J. R. Henderson, states that for an $r$-uniform $r$-partite hypergraph $\mathcal{H}$, the inequality $\tau(\mathcal{H})\le(r-1)\!\cdot\! \nu(\mathcal{H})$ always holds. This conjecture is widely open, except in the case of $r=2$, when it is equivalent to Kőnig's theorem, and in the case of $r=3$, which was proved by Aharoni in 2001.Here we study some special cases of Ryser's conjecture. First of all, the most studied special case is when $\mathcal{H}$ is intersecting. Even for this special case, not too much is known: this conjecture is proved only for $r\le 5$ by Gyárfás and Tuza. For $r>5$ it is also widely open.Generalizing the conjecture for intersecting hypergraphs, we conjecture the following. If an $r$-uniform $r$-partite hypergraph $\mathcal{H}$ is $t$-intersecting (i.e., every two hyperedges meet in at least $t<r$ vertices), then $\tau(\mathcal{H})\le r-t$. We prove this conjecture for the case $t> r/4$.Gyárfás showed that Ryser's conjecture for intersecting hypergraphs is equivalent to saying that the vertices of an $r$-edge-colored complete graph can be covered by $r-1$ monochromatic components.Motivated by this formulation, we examine what fraction of the vertices can be covered by $r-1$ monochromatic components of different colors in an $r$-edge-colored complete graph. We prove a sharp bound for this problem.Finally we prove Ryser's conjecture for the very special case when the maximum degree of the hypergraph is two.