中文
相关论文

相关论文: Suppressing nonrevisiting paths

200 篇论文

In this note, we use the method of [3] to give a simple proof of famous Witten conjecture. Combining the coefficients derived in our note and this method, we can derive more recursion formulas of Hodge integrals.

代数几何 · 数学 2007-05-23 Lin Chen , Yi Li , Kefeng Liu

The periodic tiling conjecture asserts that any finite subset of a lattice $\mathbb{Z}^d$ which tiles that lattice by translations, in fact tiles periodically. In this work we disprove this conjecture for sufficiently large $d$, which also…

组合数学 · 数学 2024-09-10 Rachel Greenfeld , Terence Tao

We prove that transversal non-simplicity is preserved under taking connect sum, generalizing Vertesi's result.

几何拓扑 · 数学 2015-05-13 Keiko Kawamuro

We extend previous work on anti-recurrence sequences of Kimberling and Moses, Zaslavsky, and Bosma et al. Kimberling and Moses have formulated several questions on these sequences, which can be combined into the meta-conjecture that…

数论 · 数学 2025-06-17 Robbert Fokkink , Gandhar Joshi

We argue that there should exist a "noncommutative Fourier transform" which should identify functions of noncommutative variables (say, of matrices of indeterminate size) and ordinary functions or measures on the space of paths. Some…

量子代数 · 数学 2007-05-23 M. Kapranov

We construct two Frechet algebras admitting countably many mutually inequivalent Frechet algebra topologies. The second example is a modification of the maiden (and first) example of a non-Banach Frechet algebra with two inequivalent…

泛函分析 · 数学 2020-03-31 S. R. Patel

In this note, we disprove two Romanov type conjectures posed by Chen.

数论 · 数学 2022-05-23 Yuchen Ding

In this paper, we formulate and prove several variants of the Erd\H{o}s-Tur\'{a}n additive bases conjecture.

综合数学 · 数学 2026-03-13 Theophilus Agama

We show the Williams Conjecture is false for irreducible shifts of finite type by examining relative sign-gyration numbers of conjugacies between shifts with no points of period one or two.

动力系统 · 数学 2007-05-23 Ki Hang Kim , Fred W. Roush

A conjecture of Hopkins (2018) posits that for certain high-dimensional hypothesis testing problems, no polynomial-time algorithm can outperform so-called "simple statistics", which are low-degree polynomials in the data. This conjecture…

计算复杂性 · 计算机科学 2020-04-21 Justin Holmgren , Alexander S. Wein

In earlier work, we constructed invariants of irreducible representations of the Kauffman skein algebra of a surface. We introduce here an inverse construction, which to a set of possible invariants associates an irreducible representation…

几何拓扑 · 数学 2018-03-16 Francis Bonahon , Helen Wong

Machine learning based decision making systems applied in safety critical areas require reliable high certainty predictions. For this purpose, the system can be extended by an reject option which allows the system to reject inputs where…

机器学习 · 计算机科学 2022-07-06 André Artelt , Barbara Hammer

We show the existence of regular combinatorial objects which previously were not known to exist. Specifically, for a wide range of the underlying parameters, we show the existence of non-trivial orthogonal arrays, t-designs, and t-wise…

组合数学 · 数学 2019-09-16 Greg Kuperberg , Shachar Lovett , Ron Peled

Our aim is to formulate and prove a weak form in equal characteristic $p>0$ of the $p$-curvature conjecture. We also show the existence of a counterexample to a strong form of it.

代数几何 · 数学 2015-03-24 Hélène Esnault , Adrian Langer

In this article, we consider some simple combinatorial game and a winning strategy in this game. This game is then used to prove several known results about non-repetitive sequences and approximations with denominators from a lacunary…

组合数学 · 数学 2025-03-27 Matthieu Rosenfeld , Alexander Shen

Combinatorial transgressions are secondary invariants of a space admitting triangulations. They arise from subdivisions and are analogous to transgressive forms such as those arising in Chern-Weil theory. Unlike combinatorial characteristic…

几何拓扑 · 数学 2008-06-04 Jer-Chin Chuang

For polyhedral convex cones in ${\mathbb R}^d$, we give a proof for the conic kinematic formula for conic curvature measures, which avoids the use of characterization theorems. For the random cones defined as typical cones of an isotropic…

度量几何 · 数学 2017-06-13 Rolf Schneider

In our paper [G{\l}uch, Marcinkowski, Ostropolski-Nalewaja, LICS ACM, 2018] we have solved an old problem stated in [Calvanese, De Giacomo, Lenzerini, Vardi, SPDS ACM, 2000] showing that query determinacy is undecidable for Regular Path…

数据库 · 计算机科学 2019-01-29 Grzegorz Głuch , Jerzy Marcinkowski , Piotr Ostropolski-Nalewaja

This paper is intended to provide an introduction to cut elimination which is accessible to a broad mathematical audience. Gentzen's cut elimination theorem is not as well known as it deserves to be, and it is tied to a lot of interesting…

逻辑 · 数学 2009-09-25 Alessandra Carbone , S. Semmes

We refute the arguments by Anton in cond-mat/0004390, which set out to disprove the existence of a collapse transition for a randomly forced inelastic particle.

统计力学 · 物理学 2007-05-23 Stephen J. Cornell , Michael R. Swift , Alan J. Bray