Search

This paper considers a specific autonomous Schwarzian differential equation given by Sf=c(f−σ1)(f−σ2)/[(f−τ1)(f−τ2)]$$\begin{equation*} \hspace*{35pt} S_f=c(f-\sigma _1)(f-\sigma _2)/[(f-\tau _1)(f-\tau _2)] \end{equation*}$$and presents a complete characterization of its transcendental meromorphic solutions, thus confirming a conjecture posed by Liao and Wu recently. By combining our results with those obtained in a previous paper (Math. Z. 2 (2022), 1657–1672), we are able to explicitly construct all transcendental meromorphic solutions of the autonomous Schwarzian differential equations. Additionally, we identify all nonconstant rational solutions of the autonomous Schwarzian differential equations, with the exception of one special case. [ABSTRACT FROM AUTHOR]

For a simple graph G on n vertices the Seidel Estrada index of G, denoted by $ SEE(G) $ SEE (G) , is defined as $ SEE(G)=\sum _{i=1}^ne^{\theta _i} $ SEE (G) = ∑ i = 1 n e θ i , where $ \theta _1,\ldots,\theta _n $ θ 1 , ... , θ n are the Seidel eigenvalues (the eigenvalues of the Seidel matrix) of G. In this paper, we find the maximum and minimum values of the Seidel Estrada index among all graphs with the fixed number of vertices. Our results confirm some conjectures on Seidel Estrada index of graphs that have been posed in [M. Hakimi-Nezhaad, M. Ghorbani, On the Estrada Index of Seidel Matrix, Mathematics Interdisciplinary Research5 (2020) 43–54]. [ABSTRACT FROM AUTHOR]

It is well-known that the famous Selberg integral is equivalent to the Morris constant term identity. In 1998, Baker and Forrester conjectured a generalization of the q-Morris constant term identity[J. Combin. Theory Ser. A 81 (1998), pp. 69–87]. This conjecture was proved and extended by Károlyi, Nagy, Petrov, and Volkov (KNPV) in 2015 [Adv. Math. 277 (2015), pp. 252–282]. In this paper, we obtain two symmetric function generalizations of the q-Baker–Forrester ex-conjecture. These include: (i) a q-Baker–Forrester type constant term identity for a product of a complete symmetric function and a Macdonald polynomial; (ii) a complete symmetric function generalization of KNPV's result. [ABSTRACT FROM AUTHOR]

In this paper, for d ≥ 1 and s ∈ (0 , d 2) , we study the Bianchi–Egnell quotient Q (f) = inf f ∈ H ˙ s (R d) \ B ‖ (- Δ) s / 2 f ‖ L 2 (R d) 2 - S d , s ‖ f ‖ L 2 d d - 2 s (R d) 2 dist H ˙ s (R d) (f , B) 2 , f ∈ H ˙ s (R d) \ B , where S d , s is the best Sobolev constant and B is the manifold of Sobolev optimizers. By a fine asymptotic analysis, we prove that when d = 1 , there is a neighborhood of B on which the quotient Q (f) is larger than the lowest value attainable by sequences converging to B . This behavior is surprising because it is contrary to the situation in dimension d ≥ 2 described recently in König (Bull Lond Math Soc 55(4):2070–2075, 2023). This leads us to conjecture that for d = 1 , Q (f) has no minimizer on H ˙ s (R d) \ B , which again would be contrary to the situation in d ≥ 2 . As a complement of the above, we study a family of test functions which interpolates between one and two Talenti bubbles, for every d ≥ 1 . For d ≥ 2 , this family yields an alternative proof of the main result of König (Bull Lond Math Soc 55(4):2070–2075, 2023). For d = 1 we make some numerical observations which support the conjecture stated above. [ABSTRACT FROM AUTHOR]

In this paper we resolve a conjecture of Kresch and Tamvakis [Duke Math. J. 110 (2001), pp. 359–376]. Our result is the following. Theorem : For any positive integer D and any integers i,j (0\leq i,j \leq D), \; the absolute value of the following hypergeometric series is at most 1: \begin{equation*} {_4F_3} \left [ \begin {array}{c} -i, \; i+1, \; -j, \; j+1 \\ 1, \; D+2, \; -D \end{array} ; 1 \right ]. \end{equation*} To prove this theorem, we use the Biedenharn-Elliott identity, the theory of Leonard pairs, and the Perron-Frobenius theorem. [ABSTRACT FROM AUTHOR]

In this paper, we offer a descriptive theory of analogical reasoning in mathematics, stating general conditions under which an analogy may provide genuine inductive support to a mathematical conjecture (over and above fulfilling the merely heuristic role of 'suggesting' a conjecture in the psychological sense). The proposed conditions generalize the criteria of Hesse in her influential work on analogical reasoning in the empirical sciences. By reference to several case studies, we argue that the account proposed in this paper does a better job in vindicating the use of analogical inference in mathematics than the prominent alternative defended by Bartha. [ABSTRACT FROM AUTHOR]

Let $ \hat {\mathcal {S}}_{(\alpha,\beta)} $ S ^ (α , β) be the familiar class of almost spirallike functions of type β and order α in the unit disk (see Definition 1.1). In this paper, first, we prove that for a function $ f(z)=z+\sum _{n=2}^\infty a_nz^n $ f (z) = z + ∑ n = 2 ∞ a n z n in the class $ \hat {\mathcal {S}}_{(\alpha,\beta)} $ S ^ (α , β) , then $$\begin{align*} & |a_{3}-\lambda a_{2}^2|\\ & \quad \leq (1-\alpha)\cos{\beta}\max\{1,|1-4(1-\alpha)(1-\lambda)\cos{\beta}\,{\rm e}^{{\rm i}\beta}|\},\quad \lambda\in \mathbb{C}. \end{align*} $$ | a 3 − λ a 2 2 | ≤ (1 − α) cos ⁡ β max { 1 , | 1 − 4 (1 − α) (1 − λ) cos ⁡ β e i β | } , λ ∈ C. The above estimation is sharp. Second, we extend this result to the bounded starlike circular domain in $ \mathbb {C}^{n} $ C n and obtain the sharp estimates. The results presented here would provide extensions of those given by Xu et al. [The Fekete and Szegö problem on the bounded starlike circular domain in $ \mathbb {C}^n $ C n . Pure Appl Math Q. 2016;12:621–638] and Xiong [Sharp coefficients bounds for class of almost starlike mappings of order α in $ \mathbb {C}^n $ C n . J Math Inequalities. 2020;14:853–865]. Finally, a certain conjecture is also formulated. [ABSTRACT FROM AUTHOR]

In this paper, we study the non‐Hermitian Yang–Mills (NHYM) bundles over compact Kähler manifolds. We show that the existence of harmonic metrics is equivalent to the semisimplicity of NHYM bundles, which confirms the Conjecture 8.7 in Kaledin and Verbitsky (Selecta Math. (N.S.) 4 (1998) 279–320). [ABSTRACT FROM AUTHOR]

Given a collection of hypergraphs H=(H1,...,Hm)${{\bf H}}=(H_1, \ldots , H_m)$ with the same vertex set, an m$m$‐edge graph F⊂∪i∈[m]Hi$F\subset \cup _{i\in [m]}H_i$ is a transversal if there is a bijection ϕ:E(F)→[m]$\phi :E(F)\rightarrow [m]$ such that e∈E(Hϕ(e))$e\in E(H_{\phi (e)})$ for each e∈E(F)$e\in E(F)$. How large does the minimum degree of each Hi$H_i$ need to be so that H${{\bf H}}$ necessarily contains a copy of F$F$ that is a transversal? Each Hi$H_i$ in the collection could be the same hypergraph, hence the minimum degree of each Hi$H_i$ needs to be large enough to ensure that F⊆Hi$F\subseteq H_i$. Since its general introduction by Joos and Kim (Bull. Lond. Math. Soc. 52 (2020) 498–504), a growing body of work has shown that in many cases this lower bound is tight. In this paper, we give a unified approach to this problem by providing a widely applicable sufficient condition for this lower bound to be asymptotically tight. This is general enough to recover many previous results in the area and obtain novel transversal variants of several classical Dirac‐type results for (powers of) Hamilton cycles. For example, we derive that any collection of rn$rn$ graphs on an n$n$‐vertex set, each with minimum degree at least (r/(r+1)+o(1))n$(r/(r+1)+o(1))n$, contains a transversal copy of the r$r$th power of a Hamilton cycle. This can be viewed as a rainbow version of the Pósa–Seymour conjecture. [ABSTRACT FROM AUTHOR]

In this paper, we investigate the issue of maximizing the total equilibrium population with respect to resources distribution m(x) and diffusion rates d under the prescribed total amount of resources in a logistic model with nonlocal dispersals. Among other things, we show that for d ≥ 1 , there exist C 0 , C 1 > 0 , depending on ‖ m ‖ L 1 only, such that C 0 d ≤ supremum of total population ≤ C 1 d. However, when replaced by random diffusion, a conjecture, proposed by Wei-Ming Ni and justified in Bai et al. (Proc. Am. Math. Soc. 144:2161–2170, 2016), indicates that in the one-dimensional case, supremum of total population = 3 ‖ m ‖ L 1. This reflects serious discrepancies between models with local and nonlocal dispersal strategies. Furthermore, we provide an equivalent characterization about the combination of resource distribution and diffusion rate such that the corresponding total population could reach the optimal order d as d goes to infinity. [ABSTRACT FROM AUTHOR]

Hovey and Palmieri [ The structure of the Bousfield lattice , Amer. Math. Soc., Providence, RI, 1999] proposed the retract conjecture on the Bousfield lattice of the stable homotopy category. The author, Shimomura and Tatehara [Publ. Res. Inst. Math. Sci. 50 (2014), pp. 497–513] defined the notion of monoidal posets as a generalization of the Bousfield lattice. In this paper, we prove that an analogue of the retract conjecture holds on a sublattice of monoidal posets. [ABSTRACT FROM AUTHOR]

We study the existence of nontrivial unbounded surfaces S ⊂ ℝ³ with the property that the constant charge distribution on S is an electrostatic equilibrium, i.e., the resulting electrostatic force is normal to the surface at each point on S . Among bounded regular surfaces S, only the round sphere has this property by a result of Reichel [Arch. Ration. Mech. Anal., 137 (1997), pp. 381--394] (see also Mendez and Reichel [Forum Math., 12 (2000), pp. 223--245]) confirming a conjecture of Gruber. In the present paper, we show the existence of nontrivial exceptional domains Ω ⊂ ℝ³ whose boundaries S=∂Ω enjoy the above property. [ABSTRACT FROM AUTHOR]

In the last decade, the Poincaré conjecture has probably been the most famous statement among all the contributions of Poincaré to the mathematics community. There have been many papers and books that describe various attempts and the final works of Perelman leading to a positive solution to the conjecture, but the evolution of Poincaré's works leading to this conjecture has not been carefully discussed or described, and some other historical aspects about it have not been addressed either. For example, one question is how it fits into the overall work of Poincaré in topology, and what are some other related questions that he had raised. Since Poincaré did not state the Poincaré conjecture as a conjecture but rather raised it as a question, one natural question is why he did this. In order to address these issues, in this paper, we examine Poincaré's works in topology in the framework of classifying manifolds through numerical and algebraic invariants. Consequently, we also provide a full history of the formulation of the Poincaré conjecture which is richer than what is usually described and accepted and hence gain a better understanding of overall works of Poincaré in topology. In addition, this analysis clarifies a puzzling question on the relation between Poincaré's stated motivations for topology and the Poincaré conjecture. [ABSTRACT FROM AUTHOR]

The transversal number Τ (H) of a hypergraph H is the minimum number of vertices that intersect every edge of H. A 6-uniform hypergraph has all edges of size 6. On 10 November 2000 Tuza and Vestergaard [Discuss. Math. Graph Theory, 22 (2002), pp. 199-210] conjectured that if H is a 3-regular 6-uniform hypergraph of order n, then Τ(H) < 1/4n. In this paper we prove this conjecture, which has become known as the Tuza-Vestergaard conjecture. [ABSTRACT FROM AUTHOR]

In 1978, Doro, in his paper [S. Doro, Simple moufang loops, Math. Proc. Camb. Philos. Soc. 83 (1978) 377–392] published the following conjecture: If the nucleus of a Moufang loop is trivial, then the commutant is a normal subloop. By working in the multiplication group of the loop we prove that in case of finite Moufang loops with trivial nucleus, the commutant is normal if and only if it is trivial. [ABSTRACT FROM AUTHOR]

For a simple graph G, the signless Laplacian matrix of G, denoted by Q(G), is defined as D(G) + A(G), where A(G) and D(G) are the adjacency matrix and the diagonal matrix of vertex degrees of G, respectively. By the smallest signless Laplacian eigenvalue of G, denoted by q′(G), we mean the smallest eigenvalue of Q(G). Let T(n, t) be the Turán graph on n vertices and t parts. In De Lima et al. (The clique number and the smallest Q-eigenvalue of graphs. Discrete Math. 2016;339:1744–1752), the authors posed the following conjecture:Conjecture. Let t ≥ 3 and let n be sufficiently large. If G is a Kt+1-free graph of order n and G ≠ T(n, t), then q′(G) < q′(T(n, t)).In this paper, first we disprove the above conjecture and then pose a new conjecture. [ABSTRACT FROM AUTHOR]

Kim and Vu made the following conjecture (Advances in Mathematics, 2004): if d ≫ log n , then the random d-regular graph G (n , d) can asymptotically almost surely be "sandwiched" between G (n , p 1) and G (n , p 2) where p 1 and p 2 are both (1 + o (1)) d / n . They proved this conjecture for log n ≪ d ⩾ n 1 / 3 - o (1) , with a defect in the sandwiching: G (n , d) contains G (n , p 1) perfectly, but is not completely contained in G (n , p 2) . The embedding G (n , p 1) ⊆ G (n , d) was improved by Dudek, Frieze, Ruciński and Šileikis to d = o (n) . In this paper, we prove Kim–Vu's sandwich conjecture, with perfect containment on both sides, for all d where min { d , n - d } ≫ n / log n . The sandwich theorem allows translation of many results from G (n , p) to G (n , d) such as Hamiltonicity, the chromatic number, the diameter, etc. It also allows translation of threshold functions of phase transitions from G (n , p) to bond percolation of G (n , d) . In addition to sandwiching regular graphs, our results cover graphs whose degrees are asymptotically equal. The proofs rely on estimates for the probability of small subgraph appearances in a random factor of a pseudorandom graph, which is of independent interest. [ABSTRACT FROM AUTHOR]

For a compact set A \subset \mathbb {R}^d and an integer k\ge 1, let us denote by \begin{equation*} A[k] = \left \{a_1+\cdots +a_k: a_1, \ldots, a_k\in A\right \}=\sum _{i=1}^k A \end{equation*} the Minkowski sum of k copies of A. A theorem of Shapley, Folkmann and Starr (1969) states that \frac {1}{k}A[k] converges to the convex hull of A in Hausdorff distance as k tends to infinity. Bobkov, Madiman and Wang [ Concentration, functional inequalities and isoperimetry , Amer. Math. Soc., Providence, RI, 2011] conjectured that the volume of \frac {1}{k}A[k] is nondecreasing in k, or in other words, in terms of the volume deficit between the convex hull of A and \frac {1}{k}A[k], this convergence is monotone. It was proved by Fradelizi, Madiman, Marsiglietti and Zvavitch [C. R. Math. Acad. Sci. Paris 354 (2016), pp. 185–189] that this conjecture holds true if d=1 but fails for any d \geq 12. In this paper we show that the conjecture is true for any star-shaped set A \subset \mathbb {R}^d for d=2 and d=3 and also for arbitrary dimensions d \ge 4 under the condition k \ge (d-1)(d-2). In addition, we investigate the conjecture for connected sets and present a counterexample to a generalization of the conjecture to the Minkowski sum of possibly distinct sets in \mathbb {R}^d, for any d \geq 7. [ABSTRACT FROM AUTHOR]

This paper classifies the Dirac series for complex E 7 . As applications, we verify a few conjectures raised in 2011, 2019 and 2020 for this exceptional Lie group. In particular, according to Conjecture 1.1 of Barbasch and Pandžić [Dirac cohomology and unipotent representations of complex groups, Noncommutative Geometry and Global Analysis, Contemp. Math. 546, American Mathematical Society, Providence (2011), 1–22], our classification should be helpful for understanding the unitary dual of complex E 7 . [ABSTRACT FROM AUTHOR]

Although it is known that the dimension of the Vassiliev invariants of degree three of long virtual knots is seven, the complete list of seven distinct Gauss diagram formulas has been unknown explicitly, where only one known formula was revised without proof. In this paper, we give seven Gauss diagram formulas to present the seven invariants of the degree three (Proposition 4). We further give 2 3 Gauss diagram formulas of classical knots (Proposition 5). In particular, the Polyak–Viro Gauss diagram formula [M. Polyak and O. Viro, Gauss diagram formulas for Vassiliev invariants, Int. Math. Res. Not.1994 (1994) 445–453] is not a long virtual knot invariant; however, it is included in the list of 2 3 formulas. It has been unknown whether this formula would be available by arrow diagram calculus automatically. In consequence, as it relates to the conjecture of Goussarov-Polyak-Viro [Finite-type invariants of classical and virtual knots, Topology39 (2000) 1045–1068, Conjecture 3.C], for all the degree three finite type long virtual knot invariants, each Gauss diagram formula is represented as those of Vassiliev invariants of classical knots (Theorem 1). [ABSTRACT FROM AUTHOR]

In this paper we extend the calculation of the geometric Waldspurger periods from our paper [Compos. Math. 144 (2008), no. 2, 377-438] to the case of ramified coverings. We give some applications to the study of Whittaker coeffcients of the theta-lifting of automorphic sheaves from PGL2 to the metaplectic group SL2; they agree with our conjectures from [Geometric Whittaker models and Eisenstein series for Mp2, arXiv:1221.1596]. In the process of the proof, we construct some new automorphic sheaves for GL2 in the ramified setting. We also formulate stronger conjectures about Waldspurger periods and geometric theta-lifting for the dual pair (SL2, PGL2). [ABSTRACT FROM AUTHOR]

Let r \geq k \geq 2 and K(k) r,n denote the complete n-balanced r-partite k-uniform hypergraph, whose vertex set consists of r parts, each has n vertices, and whose edge set contains all the k-element subsets with no two vertices from one part. A decomposition of K(k) r,n is a partition of E(K(k) r,n). A perfect matching (resp., Hamilton tight cycle) decomposition of K(k) r,n is a decomposition of K(k) r,n into perfect matchings (resp., Hamilton tight cycles). In this paper, we prove that if k | n (resp., 2 - k and k | n), then K(k) k+1,n (resp., K(k) k+2,n) has a perfect matching decomposition. We also prove that for any integer k \geq 2, K(k) k+1,n has a Hamilton tight cycle decomposition. In all cases, we use constructive methods involving number theory. In fact, we confirm two conjectures proposed by Zhang, Lu, and Liu [Appl. Math. Comput., 386 (2020), 125492]. [ABSTRACT FROM AUTHOR]

The g -extra edge-connectivity is an important measure for the reliability of interconnection networks. Recently, Yang et al. [Appl. Math. Comput. 320 (2018) 464–473] determined the 3 -extra edge-connectivity of balanced hypercubes B H n and conjectured that the g -extra edge-connectivity of B H n is λ g ( B H n) = 2 (g + 1) n − 4 g + 4 for 2 ≤ g ≤ 2 n − 1. In this paper, we confirm their conjecture for n ≥ 6 − 1 2 g + 1 and 2 ≤ g ≤ 8 , and disprove their conjecture for n ≥ 3 e g ( B H n) g + 1 and 9 ≤ g ≤ 2 n − 1 , where e g ( B H n) = max { | E ( B H n [ U ]) | | U ⊆ V (B H n) , | U | = g + 1 }. [ABSTRACT FROM AUTHOR]

Let G be a graph and k an integer with 2 ≤ k ≤ n . The k-tree-connectivity of G, denoted by κ k (G) , is defined as the minimum κ G (S) over all k-subsets S of vertices, where κ G (S) denotes the maximum number of internally disjoint S-trees in G. The k-path-connectivity of G, denoted by π k (G) , is defined as the minimum π G (S) over all k-subsets S of vertices, where π G (S) denotes the maximum number of internally disjoint S-paths in G. In this paper, we first prove that for any fixed integer k ≥ 1 , given a graph G and a subset S of V(G), deciding whether π G (S) ≥ k is NP -complete. Moreover, we also show that for any fixed integer k 1 ≥ 5 , given a graph G, a k 1 -subset S of V(G) and an integer 1 ≤ k 2 ≤ n - 1 , deciding whether π G (S) ≥ k 2 is NP -complete. Let π (k , ℓ) = 1 + max { κ (G) | G \ is\ a\ graph\ with π k (G) < ℓ } . Hager (Discrete Math 59:53–59, 1986) showed that ℓ (k - 1) ≤ π (k , ℓ) ≤ 2 k - 2 ℓ and conjectured that π (k , ℓ) = ℓ (k - 1) for k ≥ 2 and ℓ ≥ 1 . He also confirmed the conjecture for 2 ≤ k ≤ 4 and proved π (5 , ℓ) ≤ ⌈ 9 2 ℓ ⌉ . By introducing a "Generalized Path-Bundle Transformation", we confirm the conjecture for k = 5 and prove that π (k , ℓ) ≤ 2 k - 3 ℓ for k ≥ 5 and ℓ ≥ 1 . By employing this transformation, we also prove that if G is a graph with κ (G) ≥ (k - 1) ℓ for any k ≥ 2 and ℓ ≥ 1 , then κ k (G) ≥ ℓ . [ABSTRACT FROM AUTHOR]

Let (G) and e(G) denote the domination number and exponential domination number of graph G, respectively. Henning et al., in [Hered-itary equality of domination and exponential domination, Discuss. Math. Graph Theory 38 (2018) 275-285] gave a conjecture: There is a finite set F of graphs such that a graph G satisfies (H) = e(H) for every induced subgraph H of G if and only if G is F-free. In this paper, we study the conjecture for subcubic graphs. We characterize the class F by minimal forbidden induced subgraphs and prove that the conjecture holds for subcubic graphs. [ABSTRACT FROM AUTHOR]

In this paper, we apply our previous estimates in Chen and Cheng [ On the constant scalar curvature Kähler metrics (I): a priori estimates , Preprint] to study the existence of cscK metrics on compact Kähler manifolds. First we prove that the properness of K-energy in terms of L1 geodesic distance d1 in the space of Kähler potentials implies the existence of cscK metrics. We also show that the weak minimizers of the K-energy in (E1, d1) are smooth cscK potentials. Finally we show that the non-existence of cscK metric implies the existence of a destabilized L1 geodesic ray where the K-energy is non-increasing, which is a weak version of a conjecture by Donaldson. The continuity path proposed by Xiuxiong Chen [Ann. Math. Qué. 42 (2018), pp. 69–189] is instrumental in the above proofs. [ABSTRACT FROM AUTHOR]

A graph G is said to be DQS if there is no other non-isomorphic graph with the same signless Laplacian spectrum as G. Let k, ti (1 ≤ i ≤ k), and s be natural numbers. A path-friendship graph, Gs,t1...,tk, is a graph of order n = 2s + t1 + ... + tk+1 which consists of s triangles and k paths of lengths t1,t2 ..., tk sharing a common vertex. In this paper, we show that these graphs are DQS and using this result, we respond to a conjecture in [F. Wen, Q. Huang, X. Huang and F. Liu, The spectral characterization of wind-wheel graphs, Indian J. Pure Appl. Math. [ABSTRACT FROM AUTHOR]

A well known conjecture due to Hassett asserts that a cubic fourfold X whose transcendental cohomology TX cannot be realized as the transcendental cohomology of a K3 surface is irrational. Since the geometry of cubic fourfolds is intricately related to the existence of algebraic 2-cycles on them, it is natural to ask for the most algebraic cubic fourfolds X to which this conjecture is still applicable. In this paper, we show that for an appropriate "algebraicity index" κX ∈ Q+, there exists a unique class of cubics maximizing κX, not having an associated K3 surface; namely, the cubic fourfolds with an Eckardt point (previously investigated in by Laza, Pearlstein, and Zhang [Adv. Math. 340 (2018), pp. 684-722]). Arguably, they are the most algebraic conjecturally irrational cubic fourfolds, and thus a good testing ground for Hassett's irrationality conjecture for cubic fourfolds. [ABSTRACT FROM AUTHOR]

A set S of vertices in a graph G is an independent dominating set of G if S is an independent set and every vertex not in S is adjacent to a vertex in S. The independent domination number of G, denoted by i(G), is the minimum cardinality of an independent dominating set. In this paper, we study the following conjecture posed by Goddard and Henning (Discrete Math. 313:839–854, 2013): If G ≇ K 3 , 3 is a connected, cubic, bipartite graph on n vertices, then i (G) ≤ 4 11 n . Henning et al. (Discrete Appl. Math. 162:399–403, 2014) prove the conjecture when the girth is at least 6. In this paper we strengthen this result by proving the conjecture when the graph has no subgraph isomorphic to K 2 , 3 . [ABSTRACT FROM AUTHOR]

Let T be a T-set, i.e., a finite set of nonnegative integers satisfying 0 ∈ T, and G be a graph. In the paper we study relations between the T-edge spans espT (G) and espd⊙T (G), where d is a positive integer and d ⊙ T = {0 = t = d (max T + 1): d | t ⊙ t/d ⊙ T}. We show that espd⊙T (G) = d espT (G) - r, where r, 0 = r = d - 1, is an integer that depends on T and G. Next we focus on the case T = {0} and show that espd⊙T{0}(G) = ⊙d(c(G) - 1), where c(G) is the circular chromatic number of G. This result allows us to formulate several interesting conclusions that include a new formula for the circular chromatic number c(G) = 1 + inf espd⊙{0}(G)/d: d = 1 and a proof that the formula for the T-edge span of powers of cycles, stated as conjecture in [Y. Zhao, W. He and R. Cao, The edge span of T-coloring on graph Cd n, Appl. Math. Lett. 19 (2006) 647-651], is true. [ABSTRACT FROM AUTHOR]

In this paper, we give an affirmative answer to two conjectures on generalized (m, n)-Jordan derivations and generalized (m, n)-Jordan centralizers raised in Ali and Fošner (Algebra Colloq 21:411–420, 2014) and Fošner (Demonstr Math 46:254–262, 2013). Precisely, when R is a semiprime ring, we prove, under some suitable torsion restrictions, that every nonzero generalized (m, n)-Jordan derivation (resp., a generalized (m, n)-Jordan centralizer) is a derivation (resp., a two-sided centralizer). [ABSTRACT FROM AUTHOR]

The generalized k -connectivity κ k (G) of a graph G , introduced by Hager in 1985, is a natural generalization of the concept of connectivity κ (G) , which is just for k = 2. Rongxia Hao et al. determined the generalized 4-connectivity of the total graphs of the complete equipartition bipartite graph and conjectured that κ 4 (T (K m , m + 1)) = 2 m − 1 and κ 4 (T (K m , n)) = 2 m for n > m + 1 and m ≥ 4 in [Appl. Math. Comput. 422 (2022)]. In this paper, we solved this conjecture. [ABSTRACT FROM AUTHOR]

Asymmetric lemon billiards was introduced in Chen et al (2013 Chaos 23 043137), where the billiard table Q(r, b, R) is the intersection of two round disks with radii r ⩽ R, respectively, and b measures the distance between the two centres. It is conjectured Bunimovich et al (2016 Commun. Math. Phys. 341 781–803) that the asymmetric lemon billiards is hyperbolic when the arc Γr is a major arc and R is large. In this paper we prove this conjecture for sufficiently large R. [ABSTRACT FROM AUTHOR]

In the classical theory of multiple zeta values (MZV's), Furusho proposed a conjecture asserting that the p-adic MZV's satisfy the same Q -linear relations that their corresponding real-valued MZV counterparts satisfy. In this paper, we verify a stronger version of a function field analogue of Furusho's conjecture in the sense that we are able to deal with all linear relations over an algebraic closure of the given rational function field, not just the rational linear relations. To each tuple of positive integers s = (s 1 , ... , s r) , we construct a corresponding t-module together with a specific rational point. The fine resolution (via fiber coproduct) of this construction actually allows us to obtain nice logarithmic interpretations for both the ∞ -adic MZV and v-adic MZV at s , completely generalizing the work of Anderson–Thakur (Ann Math (2) 132(1):159–191, 1990) in the case of r = 1 . Furthermore it enables us to apply Yu's sub-t-module theorem (Yu in Ann Math (2) 145(2):215–233, 1997), connecting any ∞ -adic linear relation on MZV's with a sub-t-module of a corresponding giant t-module. This makes it possible to arrive at the same linear relation for v-adic MZV's. [ABSTRACT FROM AUTHOR]

M. A. Henning and A. Yeo conjectured in [SIAM J. Discrete Math., 26 (2012), pp. 687{694] that a bipartite digraph of minimum out-degree at least 3 contains two vertex disjoint directed cycles of different lengths. In this paper, we disprove this conjecture. Further, we classify strong tournaments and strong bipartite tournaments of minimum out-degree 3 without two vertex disjoint directed cycles of different lengths. [ABSTRACT FROM AUTHOR]

In 1977, Colville, Davis, and Keimel [Positive derivations on f-rings, J. Aust. Math. Soc. Ser. A 23 1977, 3, 371–375] proved that a positive derivation on an Archimedean f-algebra A has its range in the set of nilpotent elements of A. The main objective of this paper is to obtain a generalization of the above Colville, Davis and Keimel result to general derivations. Moreover, we give a new version of the Singer–Wermer conjecture for the class of second-order derivations acting on uniformly complete almost f-algebras. [ABSTRACT FROM AUTHOR]

A numerical semigroup is a submonoid of N with finite complement in N . A generalized numerical semigroup is a submonoid of N d with finite complement in N d . In the context of numerical semigroups, Wilf's conjecture is a long standing open problem whose study has led to new mathematics and new ways of thinking about monoids. A natural extension of Wilf's conjecture, to the class of C -semigroups, was proposed by García-García, Marín-Aragón, and Vigneron-Tenorio. In this paper, we propose a different generalization of Wilf's conjecture, to the setting of generalized numerical semigroups, and prove the conjecture for several large families including the irreducible, symmetric, and monomial case. We also discuss the relationship of our conjecture to the extension proposed by García-García, Marín-Aragón, and Vigneron-Tenorio. [ABSTRACT FROM AUTHOR]

Champanerkar and Kofman [Twisting quasi-alternating links, Proc. Amer. Math. Soc.137(7) (2009) 2451–2458] introduced an interesting way to construct new examples of quasi-alternating links from existing ones. Actually, they proved that replacing a quasi-alternating crossing c in a quasi-alternating link by a rational tangle of same type yields a new quasi-alternating link. This construction has been extended to alternating algebraic tangles and applied to characterize all quasi-alternating Montesinos links. In this paper, we extend this technique to any alternating tangle of same type as c. As an application, we give new examples of quasi-alternating knots of 13 and 14 crossings. Moreover, we prove that the Jones polynomial of a quasi-alternating link that is obtained in this way has no gap if the original link has no gap in its Jones polynomial. This supports a conjecture introduced in [N. Chbili and K. Qazaqzeh, On the Jones polynomial of quasi-alternating links, Topology Appl.264 (2019) 1–11], which states that the Jones polynomial of any prime quasi-alternating link except (2 , p) -torus links has no gap. [ABSTRACT FROM AUTHOR]

In this paper, we prove that the bounded derived category Dbcoh(Y) of coherent sheaves on a separated scheme Y of finite type over a field k of characteristic zero is homotopically finitely presented. This confirms a conjecture of Kontsevich. We actually prove a stronger statement: Dbcoh(Y) is equivalent to a DG quotient Dbcoh(Y~)/T, where Y~ is some smooth and proper variety, and the subcategory T is generated by a single object. The proof uses categorical resolution of singularities of Kuznetsov and Lunts\cite{KL}, and a theorem of Orlov\cite{Or} stating that the class of geometric smooth and proper DG categories is stable under gluing. We also prove the analogous result for Z/2-graded DG categories of coherent matrix factorizations on such schemes. In this case instead of Dbcoh(Y~) we have a semi-orthogonal gluing of a finite number of DG categories of matrix factorizations on smooth varieties, proper over A1/k. [ABSTRACT FROM AUTHOR]

In this paper, using the theory of complex differential equations, we study the solution of some non-linear complex differential equations in connection to Brück conjecture which generalized some earlier results due to Pramanik, D. C. and Biswas, M., On solutions of some non-linear differential equations in connection to Bruck conjecture, Tamkang J. Math., 48 (2017), No. 4, 365-375; and Wang, H., Yang, L-Z. and Xu, H-Y., On some complex differential and difference equations concerning sharing function, Adv. Diff. Equ., 2014, 2014:274. [ABSTRACT FROM AUTHOR]

An old conjecture of Erdős and Graham states that only finitely many integer squares could be obtained from product of disjoint blocks of consecutive integers of length greater than or equal to four. It is known by counterexamples that the conjecture is false for product of disjoint blocks of four and five consecutive integers. In this paper, we present new algorithms generating new polynomial parametrizations that extend the polynomial parametrization given by Bennett and Luijk (Indag Math (N.S.) 23(1–2):123–127, 2012). Moreover, we produce the first examples of integer squares obtained from product of disjoint blocks of consecutive integers such that each block has length six or seven. [ABSTRACT FROM AUTHOR]

A simple graph G is a 2-tree if G = K3, or G has a vertex v of degree 2, whose neighbors are adjacent, and G — v is a 2-tree. Clearly, if G is a 2-tree on n vertices, then E(G) = 2n — 3. A non-increasing sequence π = (d1,...,dn) of nonnegative integers is a graphic sequence if it is realizable by a simple graph G on n vertices. [Acta Math. Sin. Engl. Ser., 25, 795–802 (2009)] proved that if k ≥ 2, n ≥ and π = (d1,...,dn) is a graphic sequence with , then p has a realization containing every 1-tree (the usual tree) on k vertices. Moreover, the lower bound (k — 2)n is the best possible. This is a variation of a conjecture due to Erdos and Sós. In this paper, we investigate an analogue problem for 2-trees and prove that if k ≥ 3 is an integer with k = i (mod3), π = (d1,...,dn is a graphic sequence with , then π has a realization containing every 2-tree on k vertices. Moreover, the lower bound max is the best possible. This result implies a conjecture due to [Discrete Math. Theor. Comput. Sci., 17(3), 315–326 (2016)]. [ABSTRACT FROM AUTHOR]

This paper concerns ecological invasion phenomenon of species based on the diffusive Lotka–Volterra competition model. We investigate the spreading speed (or the minimal wave speed of traveling waves) selection to the model and concentrate on the conjecture raised by Roques et al. (J Math Biol 71(2):465–489, 2015). By using an abstract implicit function theorem in a weighted functional space coupled with a perturbation technique, we not only prove this conjecture, but also show that the fast decay behavior of the first species is necessary and sufficient for the nonlinear speed selection of the whole system. This may lead to further significant results on the answer to the original Hosono's conjecture, a problem that has been outstanding for more than twenty years. [ABSTRACT FROM AUTHOR]

Given a graph H, the Tur'an number ex(n,H) is the largest number of edges in an Hfree graph on n vertices. We make progress on a recent conjecture of Conlon, Janzer, and Lee [More on the Extremal Number of Subdivisions, arXiv:1903.10631v1, 2019] on the Tur'an numbers of bipartite graphs, which in turn yields further progress on a conjecture of Erdos and Simonovits [Combinatorica, 1 (1981), pp. 25-42]. Let s, t, k = 2 be integers. Let Kk s,t denote the graph obtained from the complete bipartite graph Ks,t by replacing each edge uv in it with a path of length k between u and v such that the st replacing paths are internally disjoint. It follows from a general theorem of Bukh and Conlon [J. Eur. Math. Soc. (JEMS), 20 (2018), pp. 1747-1757] that ex(n,Kk s,t) = O(n1+ 1k - 1 sk). Conlon, Janzer, and Lee recently conjectured that for any integers s, t, k = 2, ex(n,Kk s,t) = O(n1+ 1k - 1 sk). Among many other things, they settled the k = 2 case of their conjecture. As the main result of this paper, we prove their conjecture for k = 3, 4. Our main results also yield infinitely many new so-called Tur'an exponents: rationals r ? (1, 2) for which there exists a bipartite graph H with ex(n,H) = T(nr), adding to the lists recently obtained by Jiang, Ma, and Yepremyan [On Tur'an Exponents of Bipartite Graphs, arXiv:1806.02838, 2018], by Kang, Kim, and Liu [On the Rational Tur'an Exponent Conjecture, arXiv:1811.06916, 2018], and by Conlon, Janzer, and Lee. Our method builds on an extension of the Conlon-Janzer-Lee method. We also note that the extended method also gives a weaker version of the Conlon-Janzer-Lee conjecture for all k = 2. [ABSTRACT FROM AUTHOR]

This paper deals with a conjecture posed by Abbas Salemi in 2011 (Banach J. Math. Anal.), claiming that for the spectrum of every bounded linear operator on a separable Hilbert space there exists an estimable total decomposition. We partially solve this problem, in the sense that, for the normal operator, there exists an estimable decomposition, under approximately unitary equivalence. [ABSTRACT FROM AUTHOR]

Let k be a positive integer and let D be a digraph. A path partition P of D is a set of vertex-disjoint paths which covers V(D). Its k-norm is defined as ∑ P ∈ P min { | V (P) | , k } . A path partition is k-optimal if its k-norm is minimum among all path partitions of D. A partialk-coloring is a collection of k disjoint stable sets. A partial k-coloring C is orthogonal to a path partition P if each path P ∈ P meets min { | V (P) | , k } distinct sets of C . Berge (Eur J Comb 3(2):97–101, 1982) conjectured that every k-optimal path partition of D has a partial k-coloring orthogonal to it. A (path) k-pack of D is a collection of at most k vertex-disjoint paths in D. Its weight is the number of vertices it covers. A k-pack is optimal if its weight is maximum among all k-packs of D. A coloring of D is a partition of V(D) into stable sets. A k-pack P is orthogonal to a coloring C if each set C ∈ C meets min { | C | , k } paths of P . Aharoni et al. (Pac J Math 2(118):249–259, 1985) conjectured that every optimal k-pack of D has a coloring orthogonal to it. A digraph D is semicomplete if every pair of distinct vertices of D are adjacent. A digraph D is locally in-semicomplete if, for every vertex v ∈ V (D) , the in-neighborhood of v induces a semicomplete digraph. Locally out-semicomplete digraphs are defined similarly. In this paper, we prove Berge's and Aharoni–Hartman–Hoffman's Conjectures for locally in/out-semicomplete digraphs. [ABSTRACT FROM AUTHOR]

Let ψ : ℕ → ℝ ≥ 0 be a non-negative function such that ψ (q) → 0 as q → ∞. The well-known Jarník–Besicovtich theorem concerns the Hausdorff dimension of the set of ψ - approximable numbers. In this paper, we give an alternative but short proof of the Jarník–Besicovitch theorem for approximating functions with no monotonicity. The main tool is the appropriate usage of the mass transference principle of Beresnevich–Velani [A mass transference principle and the Duffin–Schaeffer conjecture for Hausdorff measures, Ann. of Math. (2) 164(3) (2006) 971–992]. [ABSTRACT FROM AUTHOR]

Abstract Let R be a noncommutative ring with unity. The commuting graph of R , denoted by Γ (R) , is a graph whose vertices are noncentral elements of R and two distinct vertices x and y are adjacent if x y = y x. Let F be a finite field and n ≥ 2. It is conjectured by Akbari, Ghandehari, Hadian and Mohammadian in 2004 that if Γ (R) ≅ Γ (M n (F)) , then R ≅ M n (F). In this paper, we prove the conjecture whenever n is of the form 2 k 3 l with k ≠ 0. [ABSTRACT FROM AUTHOR]

Guide rails’ nonlinear dynamic response to the collision process between gangues and the suspended buffer is the basis for its intensity examination and fatigue prediction. This paper established a numerical model for simulating the dynamic response of buffer’s guide rails using Pro/E and Femap based on an analysis of the basic structural components of the suspended buffer. The effects of the gangues diameter and feeding rate on the guide rails’ dynamic response were investigated, which were mainly revealed by a tension in guide rails. Simulation results showed that the tension in guide rails rapidly increased to a peak value after the suspended buffer was impacted by gangues, followed by a periodic vibration. The peak tension, maximum and minimum tensions within the periodic vibration were exponential functions of the gangues diameter. And they depended linearly on the feeding rate. The vibration frequency of the tension in guide rails was an exponential function of the gangues diameter but did not depend on the feeding rate. Based on the backfilling workface parameters used in D.Ping coal miner’s 15601 working panel, the feeding rate of 500 t/h was selected. The diameter of the crushed gangues was selected to be 50 mm based on the strength of guide rails. Their expected service life is 54.2 years. Finally, an industrial test was performed in D.Ping coal miner’s 15601 working panel and the guide rails operated steadily. The measured vibration parameters of the tension in guide rails agree well with that of numerical predictions, which verified the reliability of the numerical model to some extent. [ABSTRACT FROM AUTHOR]

Although the deterministic equation of life predicted and recognized by Albert Einstein is not yet defined, there are clear marks and signs of mathematical regularity which appear in nature showing fascinating accuracy. One of those "God's imprints" in the world that surrounds us is the Fibonacci Sequence, which represents more likely a starting point in revealing certain universal formula of life. The main idea of this paper is to enlighten two points: the Fibonacci sequence and the Golden Ratio, as well as to stress out the importance of reveling the perfect mathematical patterns that exist both in the organic as well as in the inorganic world. Thus, we might be able to understand the physical, spiritual and mental aspect of a human nature more clearly and completely. [ABSTRACT FROM AUTHOR]