中文
相关论文

相关论文: The Doyen-Wilson theorem for 3-sun systems

200 篇论文

It is known that a point in three-dimensional Euclidean space whose coordinates are equal to the cosines of the angles $\angle BDC, \angle ADC, \angle ADB$, where the point $D$ lies in the plane of a given triangle $ABC$, lies on the…

度量几何 · 数学 2026-03-09 Evgenii Nikitenko , Yurii Nikonorov , Michael Rieck

We give an alternate proof of Schnyder's Theorem, that the incidence poset of a graph $G$ has dimension at most three if and only if $G$ is planar.

组合数学 · 数学 2016-06-30 Fidel Barrera-Cruz , Penny Haxell

For each N>=c_d*n^{2d*(d+1)/(d+2)} we prove the existence of a spherical n-design on S^d consisting of N points, where c_d is a constant depending only on $d$.

数值分析 · 数学 2010-09-07 Andriy V. Bondarenko , Maryna S. Viazovska

We present subquadratic algorithms in the algebraic decision-tree model for several \textsc{3Sum}-hard geometric problems, all of which can be reduced to the following question: Given two sets $A$, $B$, each consisting of $n$ pairwise…

计算几何 · 计算机科学 2021-09-17 Boris Aronov , Mark de Berg , Jean Cardinal , Esther Ezra , John Iacono , Micha Sharir

We prove a new sufficient condition for a cubic 3-connected planar graph to be Hamiltonian. This condition is most easily described as a property of the dual graph. Let $G$ be a planar triangulation. Then the dual $G^*$ is a cubic…

组合数学 · 数学 2013-12-16 Helmut Alt , Michael S. Payne , Jens M. Schmidt , David R. Wood

In 2014, Keevash proved the existence of $(n,q,r)$-Steiner systems (equivalently $K_q^r$-decompositions of $K_n^r$) for all large enough $n$ satisfying the necessary divisibility conditions. In 2021, Glock, K\"uhn, and Osthus proposed a…

组合数学 · 数学 2025-12-04 Cicely Henderson , Luke Postle

Given a set $F$ of oriented graphs, a graph $G$ is an $F$-graph if it admits an $F$-free orientation. Building on previous work by Bang-Jensen and Urrutia, we propose a master algorithm that determines if a graph admits an $F$-free…

组合数学 · 数学 2023-01-16 Santiago Guzmán-Pro , César Hernández-Cruz

In the Planar 3-SAT problem, we are given a 3-SAT formula together with its incidence graph, which is planar, and are asked whether this formula is satisfiable. Since Lichtenstein's proof that this problem is NP-complete, it has been used…

计算复杂性 · 计算机科学 2023-06-22 Alexander Pilz

We consider Donaldson-Witten theory on four-manifolds of the form $X=Y \times {\bf S}^1$ where $Y$ is a compact three-manifold. We show that there are interesting relations between the four-dimensional Donaldson invariants of $X$ and…

高能物理 - 理论 · 物理学 2009-10-31 Marcos Marino , Gregory Moore

The paper is devoted to the study of free objects in the variety of Steiner loops and of the combinatorial structures behind them, focusing on their automorphism groups. We prove that all automorphisms are tame and the automorphism group is…

群论 · 数学 2015-05-07 A. Grishkov , D. Rasskazova , M. Rasskazova , I. Stuhl

Let G be a finite subgroup of GL_n(C). A study is made of the ways in which resolutions of the quotient space C^n / G can parametrise G-constellations, that is, G-regular finite length sheaves. These generalise G-clusters, which are used in…

代数几何 · 数学 2007-05-23 Timothy Logvinenko

Let $\mathrm{PG}(3,q)$ be the projective space of dimension three over the finite field with $q$ elements. Consider a twisted cubic in $\mathrm{PG}(3,q)$. The structure of the point-plane incidence matrix in $\mathrm{PG}(3,q)$ with respect…

We consider singular quasilinear elliptic systems with homogeneous Dirichlet boundary condition. Using Leray-Schauder topological degree, combined with the sub-supersolutions method and suitable truncation arguments, we establish the…

偏微分方程分析 · 数学 2025-10-27 Nouredine Medjoudj , Abdelkrim Moussaoui

Dirac's theorem determines the sharp minimum degree threshold for graphs to contain perfect matchings and Hamiltonian cycles. There have been various attempts to generalize this theorem to hypergraphs with larger uniformity by considering…

组合数学 · 数学 2025-03-27 Hyunwoo Lee

Many applications in graph theory are motivated by routing or flow problems. Among these problems is Steiner Orientation: given a mixed graph G (having directed and undirected edges) and a set T of k terminal pairs in G, is there an…

离散数学 · 计算机科学 2018-04-23 Moritz Beck , Johannes Blum , Myroslav Kryven , Andre Löffler , Johannes Zink

The square of a graph $G$, denoted by $G^2$, is obtained from $G$ by putting an edge between two distinct vertices whenever their distance is two. Then $G$ is called a square root of $G^2$. Deciding whether a given graph has a square root…

计算复杂性 · 计算机科学 2014-10-13 Van Bang Le , Andrea Oversberg , Oliver Schaudt

Any stretching of Ringel's non-Pappus pseudoline arrangement when projected into the Euclidean plane, implicitly contains a particular arrangement of nine triangles. This arrangement has a complex constraint involving the sines of its…

组合数学 · 数学 2007-05-23 Jeremy J. Carroll

A queue layout of a graph G consists of a linear order of the vertices of G and a partition of the edges of G into queues, so that no two independent edges of the same queue are nested. The queue number of G is the minimum number of queues…

数据结构与算法 · 计算机科学 2018-09-10 Jawaherul Md. Alam , Michael A. Bekos , Martin Gronemann , Michael Kaufmann , Sergey Pupyrev

We investigate the existence of standing wave solutions for quasilinear Schrodinger systems. To address the challenges posed by non differentiability, we adopt the dual approach introduced by Colin and Jeanjean. The existence of solutions…

偏微分方程分析 · 数学 2025-03-07 Ayesha Baig , Li Zhouxin

We consider the Weyl$-$Yang gauge theory of gravitation in a $(4+3)$-dimensional curved space-time within the scenario of the non-Abelian Kaluza$-$Klein theory for the source and torsion-free limits. The explicit forms of the field…

广义相对论与量子宇宙学 · 物理学 2021-09-24 Halil Kuyrukcu
‹ 上一页 1 8 9 10 下一页 ›