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

The purpose of this paper is to prove a Fourier restriction estimate for certain 2-dimensional surfaces in $\bbR^{2d}$, $d\ge 3$. These surfaces are defined by a complex curve $\gamma(z)$ of simple type, which is given by a mapping of the…

A graph $G$ is well-covered if all its maximal stable sets have the same size, denoted by alpha(G) (M. D. Plummer, 1970). If for any $k$ the $k$-th coefficient of a polynomial I(G;x) is equal to the number of stable sets of cardinality $k$…

We study the well-posedness and stability of an impedance passive infinite-dimensional linear system under nonlinear feedback of the form $u(t)=\phi(v(t)-y(t))$, where $\phi$ is a monotone function. Our first main result introduces…

We study the exact boundary controllability of a nonlinear coupled system of two Korteweg-de Vries equations on a bounded interval. The model describes the interactions of two weakly nonlinear gravity waves in a stratified fluid. Due to the…

We prove a structure theorem for multiplicative functions which states that an arbitrary bounded multiplicative function can be decomposed into two terms, one that is approximately periodic and another that has small Gowers uniformity norm…

In this paper we compute the coefficients of the reliability polynomial of a consecutive-$k$-out-of-$n$:$F$ system, in Bernstein basis, using the generalized Pascal coefficients. Based on well-known combinatorial properties of the…

We study a generalization of the Fr\'echet mean on metric spaces, which we call $\phi$-means. Our generalization is indexed by a convex function $\phi$. We find necessary and sufficient conditions for $\phi$-means to be finite and provide a…

Topological phase transitions in generic multiband systems are mediated by band-touching defects whose codimension -- the number of momentum directions along which the gap closes linearly -- varies across universality classes. Although…

For a fixed graph property $\Phi$ and integer $k \geq 1$, consider the problem of counting the induced $k$-vertex subgraphs satisfying $\Phi$ in an input graph $G$. This problem can be solved by brute-force in time $O(n^{k})$. Under ETH, we…

We describe methods for proving bounds on infinite-time averages in differential dynamical systems. The methods rely on the construction of nonnegative polynomials with certain properties, similarly to the way nonlinear stability can be…

Given a graph property $\Phi$, the problem $\#\mathsf{IndSub}(\Phi)$ asks, on input a graph $G$ and a positive integer $k$, to compute the number of induced subgraphs of size $k$ in $G$ that satisfy $\Phi$. The search for explicit criteria…

We investigate the problem $\#\mathsf{IndSub}(\Phi)$ of counting all induced subgraphs of size $k$ in a graph $G$ that satisfy a given property $\Phi$. This continues the work of Jerrum and Meeks who proved the problem to be…

In this paper we consider a general class $\mathcal E$ of self-similar sets with complete overlaps. Given a self-similar iterated function system $\Phi=(E, \{f_i\}_{i=1}^m)\in\mathcal E$ on the real line, for each point $x\in E$ we can find…

We continue the study of real polynomials acting entrywise on matrices of fixed dimension to preserve positive semidefiniteness, together with the related analysis of order properties of Schur polynomials. Previous work has shown that,…

We consider fully nonlinear obstacle-type problems of the form \begin{equation*} \begin{cases} F(D^{2}u,x)=f(x) & \text{a.e. in}B_{1}\cap\Omega,|D^{2}u|\le K & \text{a.e. in}B_{1}\backslash\Omega, \end{cases} \end{equation*} where $\Omega$…

Let $\Phi(x,y)\in\mathbb{C}[x,y]$ be a symmetric polynomial of partial degree $d$. The graph $G(\Phi)$ is defined by taking $\mathbb{C}$ as set of vertices and the points of $\mathbb{V}(\Phi(x,y))$ as edges. We study the following problem:…

Let $p$ be a prime, let $S$ be a non-empty subset of $\mathbb{F}_p$ and let $0<\epsilon\leq 1$. We show that there exists a constant $C=C(p, \epsilon)$ such that for every positive integer $k$, whenever $\phi_1, \dots, \phi_k:…

We investigate sufficient conditions for the presence of coexistence states for different genotypes in a diploid diallelic population with dominance distributed on a heterogeneous habitat, considering also the interaction between genes at…

Schaefer's theorem is a complexity classification result for so-called Boolean constraint satisfaction problems: it states that every Boolean constraint satisfaction problem is either contained in one out of six classes and can be solved in…

In prior work, we showed that subsets of $\mathbb{F}_{p}^{n}$ of $\mathrm{VC_{2}}$-dimension at most $k$ are well approximated by a union of atoms of a quadratic factor of complexity $(\ell,q)$, where the complexity $\ell$ of the linear…