Search

As was pointed out by S. Karp, Theorem B of paper [V. Sedykh and B. Shapiro, On two conjectures concerning convex curves, Int. J. Math. 16(10) (2005) 1157–1173] is wrong. Its claim is based on an erroneous example obtained by multiplication of three concrete totally positive 4 × 4 upper-triangular matrices, but the order of multiplication of matrices used to produce this example was not the correct one. Below we present a right statement which claims the opposite to that of Theorem B. Its proof can be essentially found in a recent paper [N. Arkani-Hamed, T. Lam and M. Spradlin, Non-perturbative geometries for planar N = 4 SYM amplitudes, J. High Energy Phys. 2021 (2021) 65]. [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]

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]

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]

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]

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]

Let (X, L) be a polarized manifold of dimension 3. In this paper, we consider a lower bound for h0(KX + 2L). We prove that h0(KX + 2L) > 0 if KX + 2L is nef, which is a conjecture of Beltrametti–Sommese for polarized 3-folds. Moreover we classify polarized 3-folds (X, L) with h0(KX + 2L) = 1 under the assumption that KX + 2L is nef. [ABSTRACT FROM AUTHOR]

We consider the affine action of a nilpotent Lie group on ℝn. Lipsman (1995) conjectured that such an action is proper in the sense of Palais if and only if the action is (CI) in the sense of Kobayashi. The present paper gives a counterexample to Lipsman's conjecture for n ≥ 5. [ABSTRACT FROM AUTHOR]

This is a detailed survey on the QWEP conjecture and Connes' embedding problem. Most of contents are taken from Kirchberg's paper [Invent. Math. 112 (1993)]. [ABSTRACT FROM AUTHOR]

The Andrews--Curtis conjecture claims that every balanced presentation of the trivial group can be transformed into the trivial presentation by a finite sequence of "elementary transformations" which are Nielsen transformations together with an arbitrary conjugation of a relator. It is believed that the Andrews--Curtis conjecture is false; however, not so many possible counterexamples are known. It is not a trivial matter to verify whether the conjecture holds for a given balanced presentation or not. The purpose of this paper is to describe some nondeterministic methods, called Genetic Algorithms, designed to test the validity of the Andrews-Curtis conjecture. Using such algorithm we have been able to prove that all known (to us) balanced presentations of the trivial group where the total length of the relators is at most 12 satisfy the conjecture. In particular, the Andrews-Curtis conjecture holds for the presentation 〈x, y|xyx = yxy, x[SUP2] = y[SUP3]〉 which was one of the well known potential counterexamples. [ABSTRACT FROM AUTHOR]