相关论文: Linearizable 3-webs and the Gronwall conjecture

Veronese webs are rich geometric structures with deep relationships to various domains of mathematics. The PDEs which determine the Veronese web are overdetermined if dim >3, but in the case dim =3 they reduce to a special flavor of a…

Layered pathwidth is a new graph parameter studied by Bannister et al (2015). In this paper we present two new results relating layered pathwidth to two types of linear layouts. Our first result shows that, for any graph $G$, the stack…

Corollary 2.3 in our paper "A geometric proof of the Karpelevich-Mostow theorem", Bull. Lond. Math. Soc. 41 (2009), no. 4, 634-638, is false. Here we give a counterexample and show how to avoid the use of this corollary to give a simpler…

Let v(G) and p(G) be the number of vertices and the maximum number of disjoint 3-vertex paths in G, respectively. We discuss the following old Problem: Is the following claim (P) true ? (P) if G is a 3-connected and cubic graph, then p(G) =…

This paper has been withdrawn due to errors found by authors. A correct version of this paper is published in: Tomasz M. Rusin, Wlodek Zawadzki, "Quantum theory of symmetric screening in the Hartree approximation" Phys. stat. sol. (b) 243,…

It is well known that the three-body problem has few analytical solutions in certain symmetrical constraints; the Lagrangian triangular solution is one of them. This triangular solution has been revisited by R.Broucke and H.Lass in 1971,…

We prove a comparison theorem for certain types of polyhedra in a 3-manifold with its scalar curvature bounded below by $-6$. The result confirms in some cases the Gromov dihedral rigidity conjecture in hyperbolic $3$-space.

Yasutaka Nakanishi formulated the following conjecture in 1981: every link is 3-move equivalent to a trivial link. While the conjecture was proved for several specific cases, it remained an open question for over twenty years. In 2002,…

Finding, counting and/or listing triangles (three vertices with three edges) in large graphs are natural fundamental problems, which received recently much attention because of their importance in complex network analysis. We provide here a…

In this paper we identify some inaccuracies in the paper by R.R. Saxena and S.R. Arora, A Linearization technique for solving the Quadratic Set Covering Problem, Optimization, 39 (1997) 33-42. In particular, we observe that their algorithm…

We resolve three long-standing open problems, namely the (algorithmic) decidability of network coding, the decidability of conditional information inequalities, and the decidability of conditional independence implication among random…

In this paper, we show that any proof of the Collatz 3n+1 Conjecture must have an infinite number of lines; therefore, no formal proof is possible.

The paper describes and classifies hexagonal circular 3-webs on unit sphere such that the polar points of the web circles lie on a twisted cubic, thus completing classification of hexagonal circular 3-webs with algebraic polar curves of…

G.-Pechenik-Pfannerer-Striker-Swanson applied hourglass plabic graphs to construct web bases for spaces of tensor invariants of fundamental representations of $U_q(\mathfrak{sl}_4)$, extending Kuperberg's celebrated basis for…

There are many hard conjectures in graph theory, like Tutte's 5-flow conjecture, and the 5-cycle double cover conjecture, which would be true in general if they would be true for cubic graphs. Since most of them are trivially true for…

We prove that if n\ge1, then an (n+1)-component Brunnian link L in a connected, oriented 3-manifold is C_n-equivalent to an unlink. We also prove that if n\ge2, then L can not be distinguished from an unlink by any Goussarov-Vassiliev…

The results of this paper have been subsumed by the paper "A geometric invariant theory construction of spaces of stable maps," Elizabeth Baldwin and David Swinarski, arXiv:0706.1381

We point out some major technical and conceptual mistakes which invalidate the conclusion drawn in "Anyonic braiding in optical lattices" by C. Zhang, V. W. Scarola, S. Tewari, and S. Das Sarma published in PNAS 104, 18415 (2007).

This is a Response to a recent Comment [F.Y. Wu et al., Phil. Mag. 88, 3093 (2008), arXiv:0811.3876] on the conjectured solution of the three-dimensional (3D) Ising model [Z.D. Zhang, Phil. Mag. 87, 5309 (2007), arXiv:0705.1045]. Several…

The study of the diameter of the graph of polyhedra is a classical problem in the theory of linear programming. While transportation polytopes are at the core of operations research and statistics it is still open whether the Hirsch…