Related papers: Proposing new higher-gap morasses

In a previous paper I proposed a notion of $(\omega_1,\beta)$-morasses for $\omega_1 \leq \beta$. In the present paper such morasses are constructed in an inner model which satisfies amenability, coherence and condensation.

The main contribution of this paper is a new improved variant of the laser method for designing matrix multiplication algorithms. Building upon the recent techniques of [Duan, Wu, Zhou, FOCS 2023], the new method introduces several new…

This is an update on, and expansion of, our paper Open problems on $\beta\omega$ in the book Open Problems in Topology.

We give a new bound of concurrence.

In this note, we find a new inequality involving primes and deduce several Bonse-type inequalities.

It is known that $|\zeta(1+ it)|\ll (\log t)^{2/3}$. This paper provides a new explicit estimate, viz.\ $|\zeta(1+ it)|\leq 3/4 \log t$, for $t\geq 3$. This gives the best upper bound on $|\zeta(1+ it)|$ for $t\leq 10^{2\cdot 10^{5}}$.

New error bounds for the linear complementarity problems are given respectively when the involved matrices are Nekrasov matrices and B-Nekrasov matrices. Numerical examples are given to show that new bounds are better respectively than…

Let $\beta'+i\gamma'$ be a zero of $\zeta'(s)$. In \cite{GYi} Garaev and Y{\i}ld{\i}r{\i}m proved that there is a zero $\beta+i\gamma$ of $\zeta(s)$ with $ \gamma'-\gamma \ll \sqrt{|\beta'-1/2|} $. Assuming RH, we improve this bound by…

We present natural constructions of trees and gaps using a quite general construction scheme. In particular, we solve a natural problem about $(\omega_1, \omega_1)$-gaps. As it is well known $(\omega_1, \omega_1)$-gaps can sometimes be…

We provide bounds on the sizes of the gaps -- defined broadly -- in the set $\{k_1\beta_1 + \ldots + k_n\beta_n \mbox{ (mod 1)} : k_i \in \mathbb Z \cap (0,Q^\frac{1}{n}]\}$ for generic $\beta_1, \ldots, \beta_n \in \mathbb R^m$ and all…

In [BKS15] examples of incomplete sentences are given with maximal models in more than one cardinality. The question was raised whether one can find similar examples of complete sentences. In this paper we give examples of complete…

We provide explicit upper bounds of the order $\log t/\log\log t$ for $|\zeta'(s)/\zeta(s)|$ and $|1/\zeta(s)|$ when $\sigma$ is close to $1$. These improve existing bounds for $\zeta(s)$ on the $1$-line.

For $\alpha, \beta, \delta \in [0,1], \alpha +\beta = 1 $ we consider sets $$ {\rm BAD}^* (\alpha, \beta ;\delta) = \left\{\xi = (\xi_1,\xi_2) \in [0,1]^2: ,\inf_{p\in \mathbb{N}} \max \{(p\log(p+1))^\alpha ||p\xi_1||, (p\log (p+1))^\beta…

The goal of this note is to provide an alternative proof of Theorem 1.1 (i) in [4], that is, if $n\geq 2$ and $M^{\alpha}$ is bounded on $L^{p}(\mathbb{R}^{n})$ for some $\alpha\in \mathbb{C}$ and $p\geq 2$, then we have \begin{align*}…

We establish an omega theorem for logarithmic derivative of the Riemann zeta function near the 1-line by resonance method. We show that the inequality $\left| \zeta^{\prime}\left(\sigma_A+it\right)/\zeta\left(\sigma_A+it\right) \right|…

We develop the notion of higher Cheeger constants for a measurable set $\Omega \subset \mathbb{R}^N$. By the $k$-th Cheeger constant we mean the value \[h_k(\Omega) = \inf \max \{h_1(E_1), \dots, h_1(E_k)\},\] where the infimum is taken…

In this paper, we present the best possible parameters $\alpha_i, \beta_i\ (i=1,2,3)$ and $\alpha_4,\beta_4\in(1/2,1)$ such that the double inequalities \begin{align*}…

Let $\alpha \in (1/2,1)$ be fixed. We prove that $$ \max_{0 \leq t \leq T} |\zeta(\alpha+it)| \geq \exp\left(\frac{c_\alpha (\log T)^{1-\alpha}}{(\log \log T)^\alpha}\right) $$ for all sufficiently large $T$, where we can choose $c_\alpha =…

New cases of the multiplicity conjecture are considered.

We introduce a method of constructing a forcing along a simplified $(\kappa,1)$-morass such that the forcing satisfies the $\kappa$-chain condition. Alternatively, this may be seen as a method to thin out a larger forcing to get a chain…