中文
相关论文

相关论文: On the Blaschke conjecture for 3-webs

200 篇论文

Thomassen conjectured that every triangle-free planar graph on n vertices has exponentially many 3-colorings, and proved that it has at least 2^[n^(1/12)/20000] distinct 3-colorings. We show that it has at least 2^sqrt(n/362) distinct…

组合数学 · 数学 2011-03-31 Arash Asadi , Zdenek Dvorak , Luke Postle , Robin Thomas

We give conditions for a uniruled variety of dimension at least 2 to be non-solid. This study provides further evidence to a conjecture by Abban and Okada on the solidity of Fano 3-folds. To complement our results we write explicit…

代数几何 · 数学 2023-07-07 Livia Campo , Tiago Duarte Guerreiro

We study monomial ideals with linear presentation or partially linear resolution. We give combinatorial characterizations of linear presentation for square-free ideals of degree 3, and for primary ideals whose resolutions are linear except…

交换代数 · 数学 2022-04-01 Hailong Dao , David Eisenbud

We introduce an invariant of alternating knots and links (called here WRP), namely a pair of integer polynomials associated with their two checkerboard planar graphs from their minimal diagram. We prove that the invariant is well-defined…

几何拓扑 · 数学 2025-05-27 Michal Jablonowski

We investigate several properties of Kronecker (direct, tensor) products of graphs that are planar and $3$-connected (polyhedral, $3$-polytopal). This class of graphs was recently characterised and constructed by the second author [15]. Our…

组合数学 · 数学 2024-11-21 Ruben De March , Riccardo W. Maffucci

Assume $G$ is a graph and $k$ is a positive integer. Let $f:V(G)\to \mathbb{N}$ be defined as $f(v)=\min\{k,d_G(v)\}$. If $G$ is $f$-choosable, then we say $G$ is degree-truncated $k$-choosable. Answering a question of Richter, it was…

组合数学 · 数学 2025-07-15 Yiting Jiang , Huijuan Xu , Xinbo Xu , Xuding Zhu

Two isomorphic graphs can have inequivalent spatial embeddings in 3-space. In this way, an isomorphism class of graphs contains many spatial graph types. A common way to measure the complexity of a spatial graph type is to count the minimum…

组合数学 · 数学 2023-12-12 Tirasan Khandhawit , Puttipong Pongtanapaisan , Athibadee Wasun

We show the D'Angelo conjecture holds in the third gap interval. More precisely, we prove that the degree of any rational proper holomorphic map from $\mathbb{B}^n$ to $\mathbb{B}^{4n-6}$ with $n\geq 7$ is not more than $3$.

复变函数 · 数学 2019-04-29 Shanyu Ji , Wanke Yin

We compare theoretically the tripartite entanglement available from the use of three concurrent $\chi^{(2)}$ nonlinearities and three independent squeezed states mixed on beamsplitters, using the van Loock-Furusawa inequalities. We also…

量子物理 · 物理学 2009-11-13 M. K. Olsen , A. S. Bradley , M. D. Reid

In the first partial result toward Steinberg's now-disproved three coloring conjecture, Abbott and Zhou used a counting argument to show that every planar graph without cycles of lengths 4 through 11 is 3-colorable. Implicit in their proof…

组合数学 · 数学 2022-09-13 Zachary Hamaker , Vincent Vatter

A classification and examples of four-dimensional isoclinic three-webs of codimension two are given. The examples considered prove the existence theorem for many classes of webs for which the general existence theorems are not proved yet.

微分几何 · 数学 2007-05-23 Vladislav V. Goldberg

Neuwirth asked if any non-trivial knot in the 3-sphere can be embedded in a closed surface so that the complement of the surface is a connected essential surface for the knot complement. In this paper, we examine some variations on this…

几何拓扑 · 数学 2011-03-15 Makoto Ozawa , J. Hyam Rubinstein

The 1-2-3 Conjecture, introduced by Karo\'nski, {\L}uczak, and Thomason in 2004, was recently solved by Keusch. This implies that, for any connected graph $G$ different from $K_2$, we can turn $G$ into a locally irregular multigraph $M(G)$,…

离散数学 · 计算机科学 2025-06-27 Julien Bensmail , Romain Bourneuf , Paul Colinot , Samuel Humeau , Timothée Martinod

We provide a complete classification of hexagonal singular 3-web germs in the complex plane, satisfying the following two conditions: 1) the Chern connection remains holomorphic at the singular point, 2) the web admits at least one…

微分几何 · 数学 2012-06-05 Sergey Agafonov

We offer a new structural basis for the theory of 3-connected graphs, providing a unique decomposition of every such graph into parts that are either quasi 4-connected, wheels, or thickened $K_{3,m}$'s. Our construction is explicit,…

组合数学 · 数学 2025-07-25 Johannes Carmesin , Jan Kurkofka

A graph is \textit{rigid} if it only admits the identity endomorphism. We show that for every $d\ge 3$ there exist infinitely many mutually rigid $d$-regular graphs of arbitrary odd girth $g\geq 7$. Moreover, we determine the minimum order…

组合数学 · 数学 2025-02-18 Kolja Knauer , Gil Puig i Surroca

A lattice L is slim if it is finite and the set of its join-irreducible elements contains no three-element antichain. We prove that there exists a positive constant C such that, up to similarity, the number of planar diagrams of these…

环与代数 · 数学 2024-11-01 Gábor Czédli

We determine fundamental systems of invariants for complex solvable rigid Lie algebras having nonsplit nilradicals of characteristic sequence $(3,1,..,1)$, these algebras being the natural followers of solvable algebras having Heisenberg…

环与代数 · 数学 2009-11-07 Rutwig Campoamor-Stursberg

In this paper we show the validity, under certain geometric conditions, of Wheeler's thin sandwich conjecture for higher dimensional theories of gravity. We extend the results shown by R. Bartnik and G. Fodor for the 3-dimensional case in…

广义相对论与量子宇宙学 · 物理学 2017-11-03 R. Avalos , F. Dahia , C. Romero , J. H. Lira

The Golomb-Welch conjecture deals with the existence of perfect $e$% -error correcting Lee codes of word length $n,$ $PL(n,e)$ codes. Although there are many papers on the topic, the conjecture is still far from being solved. In this paper…

信息论 · 计算机科学 2013-11-12 Peter Horak , Otokar Grosek