相关论文: Suppressing nonrevisiting paths

The combinatorial structure of a d-dimensional simple convex polytope can be reconstructed from its abstract graph [Blind & Mani 1987, Kalai 1988]. However, no polynomial/efficient algorithm is known for this task, although a polynomially…

We derive a series of results on random walks on a d-dimensional hypercubic lattice (lattice paths). We introduce the notions of terse and simple paths corresponding to the path having no backtracking parts (spikes). These paths label…

The paper provides a version of the rational Hodge conjecture for $\3\dg$ categories. The noncommutative Hodge conjecture is equivalent to the version proposed in \cite{perry2020integral} for admissible subcategories. We obtain examples of…

In this short note we present a family of counterexamples to the King's conjecture.

An example is constructed of a local ring and a module of finite type and finite projective dimension over that ring such that the module is not rigid. This shows that the rigidity conjecture is false.

A conjecture of Woods from 1972 is disproved.

We give a reformuation of the Tate conjecture for a surface over a finite field in terms of suitable affine open subsets. We then present three attempts to prove this reformulation, each of them falling short. Interestingly, the last two…

We prove a conjecture of Roe by constructing unified warped cones that violate the coarse Baum-Connes conjecture. Interestingly, the reason for this is probably not what Roe expected, as the obstruction arises in odd rather than even…

After reconsidering the Dasbach-Hougardy counterexample to the Kauffman Conjecture on alternating knots, we reformulate the conjecture and consider Dasbach-Hougardy counterexample and similar counterexamples in the light of the reformulated…

We propose a recursive logit model which captures the notion of choice aversion by imposing a penalty term that accounts for the dimension of the choice set at each node of the transportation network. We make three contributions. First, we…

In this note we provide some results related to the Koethe conjecture and exhibit that the condition R satisfies the Koethe conjecture given in [2, theorem 2.6 ] is superfluous at least under certain conditions described in this note.

In an automatic search, we found conjectural recurrences for some sequences in the OEIS that were not previously recognized as being D-finite. In some cases, we are able to prove the conjectured recurrence. In some cases, we are not able to…

We discuss a construction that gives counterexamples to various questions of unique determination of convex bodies.

We examine a number of results of infinite combinatorics using the techniques of reverse mathematics. Our results are inspired by similar results in recursive combinatorics. Theorems included concern colorings of graphs and bounded graphs,…

Pedestrian route choice is a complex, situation- and population-dependent issue. In this contribution an example is presented, where pedestrians can choose among two seemingly similar alternatives. The choice ratio is not even close to…

We provide a counterexample to the Lagrangian Poincar\'e recurrence conjecture of Ginzburg and Viterbo in all dimensions $6$ and greater.

In this note, we show that a "Toy Conjecture" made by (Boyle, Ishai, Pass, Wootters, 2017) is false, and propose a new one. Our attack does not falsify the full ("non-toy") conjecture in that work, and it is our hope that this note will…

An extension of an induced path $P$ in a graph $G$ is an induced path $P'$ such that deleting the endpoints of $P'$ results in $P$. An induced path in a graph is said to be avoidable if each of its extensions is contained in an induced…

Two conjectures recently proposed by one of the authors are disproved

In this paper the circulant Hadamard conjecture is proved.