Related papers: On the minimum density of monotone subwords

This article examines the value distribution of $S_{N}(f, \alpha) := \sum_{n=1}^N f(n\alpha)$ for almost every $\alpha$ where $N \in \mathbb{N}$ is ranging over a long interval and $f$ is a $1$-periodic function with discontinuities or…

For a fixed graph $F$, a graph $G$ is said to be $F$-saturated if $G$ does not contain a subgraph isomorphic to $F$ but does contain $F$ after the addition of any new edge. Let $M_k$ be a matching consisting of $k$ edges and $S_{n,k}$ be…

Let $f^{(r)}(n;s,k)$ denote the maximum number of edges in an $r$-graph on $n$ vertices in which every $k$ edges span more than $s$ vertices. Brown, Erd\H{o}s and S\'{o}s in 1973 conjectured that for every $k\geq 2$, the limit…

Let F be a hypergraph and let forb(m,F) denote the maximum number of edges a hypergraph with m vertices can have if it doesn't contain F as a subhypergraph. A conjecture of Anstee and Sali predicts the asymptotic behaviour of forb(m,F) for…

Let $\CaC\subset \Q^p$ be a rational cone. An affine semigroup $S\subset \CaC$ is a $\CaC$-semigroup whenever $(\CaC\setminus S)\cap \N^p$ has only a finite number of elements. In this work, we study the tree of $\CaC$-semigroups, give a…

Let $S(t,f)=\pi^{-1}\arg L(1/2+it, f)$, where $f$ is a holomorphic Hecke cusp form of weight $2$ and prime level $q$. In this paper, we establish an unconditional asymptotic formula for the moments of $S(t,f)$, providing a level aspect…

For a finitely generated lawless group $\Gamma$ and $n \in \mathbb{N}$, let $\mathcal{A}_{\Gamma} (n)$ be the minimal positive integer $M_n$ such that for all nontrivial reduced words $w$ of length at most $n$ in the free group of fixed…

For each positive integer $k$, let $\mathscr{A}_k$ be the set of all positive integers $n$ such that $\gcd(n, F_n) = k$, where $F_n$ denotes the $n$th Fibonacci number. We prove that the asymptotic density of $\mathscr{A}_k$ exists and is…

Let $f\colon \{0,1\}^n\to \{0,1\}$ be a monotone Boolean functions, let $\psi_k(f)$ denote the Shapley value of the $k$th variable and $b_k(f)$ denote the Banzhaf value (influence) of the $k$th variable. We prove that if we have $\psi_k(f)…

This is the third of a series of four papers in which we prove the following relaxation of the Loebl-Komlos-Sos Conjecture: For every $\alpha>0$ there exists a number $k_0$ such that for every $k>k_0$ every $n$-vertex graph $G$ with at…

We call a CNF formula linear if any two clauses have at most one variable in common. Let m(k) be the largest integer m such that any linear k-CNF formula with <= m clauses is satisfiable. We show that 4^k / (4e^2k^3) <= m(k) < ln(2) k^4…

The Boolean satisfiability problem (SAT) is a well-known example of monotonic reasoning, of intense practical interest due to fast solvers, complemented by rigorous fine-grained complexity results. However, for non-monotonic reasoning,…

Given two $k$-graphs $F$ and $H$, a perfect $F$-tiling (also called an $F$-factor) in $H$ is a set of vertex disjoint copies of $F$ that together cover the vertex set of $H$. Let $t_{k-1}(n, F)$ be the smallest integer $t$ such that every…

If $(X,d)$ is a metric space then the map $f\colon X\to X$ is defined to be a weak contraction if $d(f(x),f(y))<d(x,y)$ for all $x,y\in X$, $x\neq y$. We determine the simplest non-closed sets $X\subseteq \mathbb{R}^n$ in the sense of…

In this note we announce the proof of the inverse conjecture for the Gowers U^{s+1}[N]-norm for all s => 3; this is new for s => 4, the cases s = 1,2,3 having been previously established. More precisely we outline a proof (details of which…

Maximum satisfiability is a canonical NP-hard optimization problem that appears empirically hard for random instances. Let us say that a Conjunctive normal form (CNF) formula consisting of $k$-clauses is $p$-satisfiable if there exists a…

Let $\mathcal{S}_n$ denote the set of permutations of $\{1,2,\dots,n\}$. The function $f(n,s)$ is defined to be the minimum size of a subset $S\subseteq \mathcal{S}_n$ with the property that for any $\rho\in \mathcal{S}_n$ there exists some…

For given graphs $F$ and $G$, the minimum number of edges in an inclusion-maximal $F$-free subgraph of $G$ is called the $F$-saturation number and denoted $\mathrm{sat}(G, F)$. For the star $F=K_{1,r}$, the asymptotics of…

In this paper, we investigate the minimum number of triangles, denoted by $t(n,k)$, in $n$-vertex $k$-regular graphs, where $n$ is an odd integer and $k$ is an even integer. The well-known Andr\'asfai-Erd\H{o}s-S\'os Theorem has established…

Given $s \ge k\ge 3$, let $h^{(k)}(s)$ be the minimum $t$ such that there exist arbitrarily large $k$-uniform hypergraphs $H$ whose independence number is at most polylogarithmic in the number of vertices and in which every $s$ vertices…