Related papers: Good Bounds in Certain Systems of True Complexity …

Given a map $\phi:X\rightarrow Y$ between $F$-analytic manifolds over a local field $F$ of characteristic $0$, we introduce an invariant $\epsilon_{\star}(\phi)$ which quantifies the integrability of pushforwards of smooth compactly…

For a real-valued measurable function $f$ and a nonnegative, nondecreasing function $\phi$, we first obtain a Chebyshev type inequality which provides an upper bound for $\displaystyle \phi(\lambda_{1}) \mu(\{x \in \Omega : f(x) \geq…

Every Boolean function can be uniquely represented as a multilinear polynomial. The entropy and the total influence are two ways to measure the concentration of its Fourier coefficients, namely the monomial coefficients in this…

We study the parameterized complexity of #IndSub($\Phi$), where given a graph $G$ and an integer $k$, the task is to count the number of induced subgraphs on $k$ vertices that satisfy the graph property $\Phi$. Focke and Roth [STOC 2022]…

Solving polynomial systems arising from applications is frequently made easier by the structure of the systems. Weighted homogeneity (or quasi-homogeneity) is one example of such a structure: given a system of weights…

Given a graph $G$, a set $T$ of terminal vertices, and a demand graph $H$ on $T$, the \textsc{Multicut} problem asks for a set of edges of minimum weight that separates the pairs of terminals specified by the edges of $H$. The…

It is shown that a class of optical physical unclonable functions (PUFs) can be learned to arbitrary precision with arbitrarily high probability, even in the presence of noise, given access to polynomially many challenge-response pairs and…

In this paper, we consider the problem of recovering a compactly supported multivariate function from a collection of pointwise samples of its Fourier transform taken nonuniformly. We do this by using the concept of weighted Fourier frames.…

Consider a system \Psi of non-constant affine-linear forms \psi_1,...,\psi_t: Z^d -> Z, no two of which are linearly dependent. Let N be a large integer, and let K be a convex subset of [-N,N]^d. A famous and difficult open conjecture of…

Let $r \geq 2$ be a real number. A complex nowhere-zero $r$-flow on a graph $G$ is an orientation of $G$ together with an assignment $\varphi\colon E(G)\to \mathbb{C}$ such that, for all $e \in E(G)$, the modulus of the complex number…

Suppose that $f(z)$ is a transcendental entire function and that the Fatou set $F(f)\neq\emptyset$. Set $$B_1(f):=\sup_{U}\frac{\sup_{z\in U}\log(|z|+3)}{\inf_{w\in U}\log(|w|+3)}$$ and $$B_2(f):=\sup_{U}\frac{\sup_{z\in…

In 2009, Roeglin and Teng showed that the smoothed number of Pareto optimal solutions of linear multi-criteria optimization problems is polynomially bounded in the number $n$ of variables and the maximum density $\phi$ of the semi-random…

We show that if $\Phi: X \dashrightarrow X$ is a dominant rational self-map of a projective surface $X$ over $\mathbb{C}$ with a regular and non-invertible iterate $\Phi^n$, then we can take $n \leq 12$. This bound is sharp and realized on…

Within the derivative expansion of conformally reduced gravity, the modified split Ward identities are shown to be compatible with the flow equations if and only if either the anomalous dimension vanishes or the cutoff profile is chosen to…

For every natural number k we prove a decomposition theorem for bounded measurable functions on compact abelian groups into a structured part, a quasi random part and a small error term. In this theorem quasi randomness is measured with the…

Let $f$ be a homogeneous polynomial over a field. For many fields, including number fields and function fields, we prove that the strength of $f$ is bounded above by a constant multiple of the Birch rank of $f.$ The constant depends only on…

In this work, a boundary control problem for the following generalized Burgers-Huxley (GBH) equation: $$u_t=\nu u_{xx}-\alpha u^{\delta}u_x+\beta u(1-u^{\delta})(u^{\delta}-\gamma), $$ where $\nu,\alpha,\beta>0,$ $1\leq\delta<\infty$,…

Partition functions arise in statistical physics and probability theory as the normalizing constant of Gibbs measures and in combinatorics and graph theory as graph polynomials. For instance the partition functions of the hard-core model…

Let $\pi_1$ be a standard representation of $\mathrm{GL}_{n+1}(F)$ and let $\pi_2$ be the smooth dual of a standard representation of $\mathrm{GL}_n(F)$. When $F$ is non-Archimedean, we prove that $\mathrm{Ext}^i_{\mathrm{GL}_n(F)}(\pi_1,…

Let $F,E\subseteq \mathbb{R}^2$ be two self similar sets. First, assuming $F$ is generated by an IFS $\Phi$ with strong separation, we characterize the affine maps $g:\mathbb{R}^2 \rightarrow \mathbb{R}^2$ such that $g(F)\subseteq F$. Our…