相关论文: On (not) computing the Mobius function using bound…

The binary radix expansion of a real number can be used to code the outcome of any series of coin tosses, a fact that provides an intriguing link between number theory, measure theory and statistical physics. Inspired by this fact, a…

Let $M$ be a finitely generated module on a local ring $R$ and $\F: M_0\subset M_1\subset...\subset M_t=M$ a filtration of submodules of $M$ such that $ d_o<d_1< ... <d_t=d$, where $d_i=\dim M_i$. This paper is concerned with a non-negative…

We prove the Courtade-Kumar conjecture, for certain classes of $n$-dimensional Boolean functions, $\forall n\geq 2$ and for all values of the error probability of the binary symmetric channel, $\forall 0 \leq p \leq \frac{1}{2}$. Let…

In this paper, we study a special kind of factorization of $x^n+1$ over $\mathbb{F}_q, $ with $q$ a prime power $\equiv 3~({\rm mod}~4)$ when $n=2p,$ with $p\equiv 3~({\rm mod}~4)$ and $p$ is a prime. Given such a $q$ infinitely many such…

We show that the sum function of the M\"{o}bius function of a Beurling number system must satisfy the asymptotic bound $M(x)=o(x)$ if it satisfies the prime number theorem and its prime distribution function arises from a monotone…

Let $\nu_{f}(n)$ be the $n$-th nomalized Fourier coefficient of a Hecke--Maass cusp form $f$ for ${\rm SL}(2,\Z)$ and let $\alpha$ be a real number. We prove strong oscillations of the argument of $\nu_{f}(n)\mu (n) \exp (2\pi i n \alpha)$…

Mossinghoff, Trudgian, and the first author~\cite{MMT23} recently introduced a family of arithmetic functions called ``fake $\mu$'s'', which are multiplicative functions for which there is a $\{-1,0,1\}$-valued sequence…

We give formulas for the Bruce-Roberts number $\mu_{BR}(f,X)$ and its relative version $\mu_{BR}^{-}(f,X)$ of a function $f$ with respect to an ICIS $(X,0)$. We show that $\mu_{BR}^{-}(f,X)=\mu(f^{-1}(0)\cap X,0)+\mu(X,0)-\tau(X,0)$, where…

We consider Mertens' function M(x,q,a) in arithmetic progression, Assuming the generalized Riemann hypothesis (GRH), we show an upper bound that is uniform for all moduli which are not too large. For the proof, a former method of K.…

In this paper we study polynomial Hamiltonian systems $dF=0$ in the plane and their small perturbations: $dF+\epsilon\omega=0$. The first nonzero Melnikov function $M_{\mu}=M_{\mu}(F,\gamma,\omega)$ of the Poincar\'e map along a loop…

Let $R=K[x_1,\ldots,x_m]$ where $K$ is an uncountable algebraically closed field of characteristic $0$. For a prime ideal $P$ of $R$, let $\mu_j(P,M)$ be the $j$-th Bass number of an $R$-module $M$ with respect to the prime $P$. For $1\leq…

A notorious open question in circuit complexity is whether Boolean operations of arbitrary arity can efficiently be expressed using modular counting gates only. H{\aa}stad's celebrated switching lemma yields exponential lower bounds for the…

We show that if $\mu$ is a self-affine measure on the plane defined by an iterated function system of contractions with diagonal linear parts, then under an irrationality assumption on the entries of the linear parts, $$ \dim_{\rm H} \mu…

The Thue-Morse sequence (1, -1, -1, 1, -1, 1, 1, ...) can in a sense be naturally extended to a continuous function f called the Fabius function. It is shown how to determine the exact value of f(x) whenever x is the ratio between a…

This article summarises the theory of several bounded functional calculi for unbounded operators that have recently been discovered. The extend the Hille--Phillips calculus for (negative) generators $A$ of certain bounded $C_0$-semigroups,…

We consider submodular function minimization in the oracle model: given black-box access to a submodular set function $f:2^{[n]}\rightarrow \mathbb{R}$, find an element of $\arg\min_S \{f(S)\}$ using as few queries to $f(\cdot)$ as…

The sequence A000975 in OEIS can be defined by $A_1=1$, $A_{n+1}=2A_n$ if $n$ is odd, and $A_{n+1}=2A_n+1$ if $n$ is even. This sequence satisfies other recurrence relations, admits some closed formulas, and is known to enumerate several…

We prove super-polynomial lower bounds for low-depth arithmetic circuits using the shifted partials measure [Gupta-Kamath-Kayal-Saptharishi, CCC 2013], [Kayal, ECCC 2012] and the affine projections of partials measure [Garg-Kayal-Saha, FOCS…

We show a new duality between the polynomial margin complexity of $f$ and the discrepancy of the function $f \circ \textsf{XOR}$, called an $\textsf{XOR}$ function. Using this duality, we develop polynomial based techniques for…

In this paper, we investigate an approach to circuit lower bounds via bounded width circuits. The approach consists of two steps: (i) We convert circuits to (deterministic or nondeterministic) bounded width circuits. (ii) We prove lower…