Related papers: A Note on the Frankl Conjecture

Let $k\geq 2$ be an integer. In the spirit of Kolesnikov-Werner \cite{KW}, for each $j\in\{2,\ldots,k\}$, we conjecture a sharp Santal\'{o} type inequality (we call it $j$-Santal\'{o} conjecture) for many sets (or more generally for many…

The conjecture of Masser-Oesterl\'e, popularly known as $abc$-conjecture have many consequences. We use an explicit version due to Baker to solve a number of conjectures.

Prime numbers are fascinating by the way they appear in the set of natural numbers. Despite several results enlighting us about their repartition, the set of prime numbers is often informally qualified as misterious. In the present paper,…

We propose a general conjecture on decompositions of finite simple groups as products of conjugates of an arbitrary subset. We prove this conjecture for bounded subsets of arbitrary finite simple groups, and for large subsets of groups of…

Makienko's conjecture, a proposed addition to Sullivan's dictionary, can be stated as follows: The Julia set of a rational function R has buried points if and only if no component of the Fatou set is completely invariant under the second…

This paper intends to survey the vast literature devoted to a problem posed by Wilf in 1978 which, despite the attention it attracted, remains unsolved. As it frequently happens with combinatorial problems, many researchers who got involved…

We prove that the union-closed sets conjecture is true for separating union-closed families $\mathcal{A}$ with $|\mathcal{A}| \leq 2\left(m+\frac{m}{\log_2(m)-\log_2\log_2(m)}\right)$ where $m$ denotes the number of elements in…

A conjecture is given that, if true, could lead to an algorithm for computing definite sums of rational functions.

In this paper we affirm Br\"{u}ck conjecture provided $f$ is of hyper-order less than one by studying the infinite hyper-order of solutions of a complex differential equation.

We identify a number of decidable and undecidable fragments of first-order concatenation theory. We also give a purely universal axiomatization which is complete for the fragments we identify. Furthermore, we prove some normal-form results.

A paper of the first author and Zilke proposed seven combinatorial problems around formulas for the characteristic polynomial and the exponents of an isolated quasihomogeneous singularity. The most important of them was a conjecture on the…

In this paper, we will give an extension of Mok's theorem on the generalized Frankel conjecture under the condition of the orthogonal bisectional curvature.

We obtain similar types of conclusions as that of Br\"{u}ck [1] for two differential polynomials which in turn radically improve and generalize several existing results. Moreover, a number of examples have been exhibited to justify the…

Computations of the Julia and Mandelbrot sets of the Riemann zeta function and observations of their properties are made. In the appendix section, a corollary of Voronin's theorem is derived and a scale-invariant equation for the bounds in…

In 1973 Fraenkel discovered interesting sequences which split the positive integers. These sequences became famous, because of a related unsolved conjecture. Here we construct combinatorial games, with `playable' rulesets, with these…

Let $g(x)$ be a fixed non-constant complex polynomial. It was conjectured by Schinzel that if $g(h(x))$ has boundedly many terms, then $h(x)\in \C[x]$ must also have boundedly many terms. Solving an older conjecture raised by R\'enyi and by…

Mathematicians had little idea whether the easy-to-state union-closed conjecture was true or false even after $40$ years. However, last winter saw a surge of interest in the conjecture and its variants, initiated by the contribution of a…

The paper proves a conjecture of Solomon Feferman concerning the indefiniteness of the continuum hypothesis relative to a semi-intuitionistic set theory.

We prove the K- and L-theoretic Farrell-Jones Conjecture (with coefficients in additive categories) for virtually solvable groups.

Motivated by the problem of finding finite versions of classical incompleteness theorems, we present some conjectures that go beyond ${\bf NP\neq co NP}$. These conjectures formally connect computational complexity with the difficulty of…