相关论文: Around Pelikan's conjecture on very odd sequences

In a recent work, Keusch proved the so-called 1-2-3 Conjecture, raised by Karo\'nski, {\L}uczak, and Thomason in 2004: for every connected graph different from $K_2$, we can assign labels~$1,2,3$ to the edges so that no two adjacent…

In an award-winning expository article, V. Pozdnyakov and J.M. Steele gave a beautiful demonstration of the ramifications of a basic bijection for permutations. The aim of this note is to connect this correspondence to a seemingly unrelated…

Both Cuckler and Yuster independently conjectured that when $n$ is an odd positive multiple of $3$ every regular tournament on $n$ vertices contains a collection of $n/3$ vertex-disjoint copies of the cyclic triangle. Soon after, Keevash…

There are 20 odd integers v less than 200 for which the existence of Legendre pairs of length v is undecided. The smallest among them is v=77. We have constructed Legendre pairs of lengths 91, 93 and 123 reducing the number of undecided…

We study graphs on $n$ vertices which have $2n-2$ edges and no proper induced subgraphs of minimum degree $3$. Erd\H{o}s, Faudree, Gy\'arf\'as, and Schelp conjectured that such graphs always have cycles of lengths $3,4,5,\dots, C(n)$ for…

The string theory introduced in early 1971 by Ramond, Neveu, and myself has two-dimensional world-sheet supersymmetry. This theory, developed at about the same time that Golfand and Likhtman constructed the four-dimensional super-Poincar\'e…

Sequences with a low correlation have very important applications in communications, cryptography, and compressed sensing. In the literature, many efforts have been made to construct good sequences with various lengths where binary…

We prove a conjecture of Boros, Caro, F\"uredi and Yuster on the maximum number of edges in a 2-connected graph without repeated cycle lengths, which is a restricted version of a longstanding problem of Erd\H{o}s. Our proof together with…

Ozeki and Prodinger showed that the odd power sum of the first several consecutive Fibonacci numbers of even order is equal to a polynomial evaluated at certain Fibonacci number of odd order. We prove that this polynomial and its derivative…

C. Thomassen (Proc. London Math. Soc. (3) 42 (1981), 231-251) gave a characterization of strongly connected non-Hamiltonian digraphs of order $p\geq 3$ with minimum degree $p-1$. In this paper we give an analogous characterization of…

The problem of the fluctuation of the Longest Common Subsequence (LCS) of two i.i.d. sequences of length $n>0$ has been open for decades. There exist contradicting conjectures on the topic. Chvatal and Sankoff conjectured in 1975 that…

Andr\'e's celebrated Theorem of 1998 implies that each complex straight line (apart from obvious exceptions) contains at most finitely many points whose both coordinates are j-invariants of elliptic curves with complex multiplication. We…

Erd\H{o}s and Szekeres showed that given a permutation $p$ of $[n]$, and the sequence defined by \newline $(p(1), p(2), \ldots, p(n))$, there exists either a decreasing or increasing subsequence, not necessarily contiguous, of length at…

In this paper, we study (random) sequences of pseudo s-th powers, as introduced by Erd\"os and R\'enyi in 1960. In 1975, Goguel proved that such a sequence is almost surely not an asymptotic basis of order s. Our first result asserts that…

In 1959, Erd\H{o}s and Gallai proved that every graph G with average vertex degree ad(G)\geq 2 contains a cycle of length at least ad(G). We provide an algorithm that for k\geq 0 in time 2^{O(k)} n^{O(1)} decides whether a 2-connected…

The Ulam sequence, described by Stanislaw Ulam in the 1960s, starts $1,2$ and then iteratively adds the smallest integer that can be uniquely written as the sum of two distinct earlier terms: this gives $1,2,3,4,6,8,11,\dots$. Already in…

Pseudoline arrangements are fundamental objects in discrete and computational geometry, and different works have tackled the problem of improving the known bounds on the number of simple arrangements of $n$ pseudolines over the past…

We present new constructions for perfect and odd perfect sequences over the quaternion group $Q_8$. In particular, we show for the first time that perfect and odd perfect quaternion sequences exist in all lengths $2^t$ for $t\geq0$. In…

Strict partitions are enumerated with respect to the weight, the number of parts, and the number of sequences of odd length. We write this trivariate generating function as a double sum $q$-series. Equipped with such a combinatorial set-up,…

In this paper, we study the distance problem in the setting of finite p-adic rings. In odd dimensions, our results are essentially sharp. In even dimensions, we clarify the conjecture and provide examples to support it. Surprisingly,…