Related papers: Stable Lifting of Polynomial Traces on Triangles
Consider a normal function $f$ on the ordinals (i. e. a function $f$ that is strictly increasing and continuous at limit stages). By enumerating the fixed points of $f$ we obtain a faster normal function $f'$, called the derivative of $f$.…
In this work, a higher regularized trace formula has been found for a regular Sturm-Liouville differential operator with operator coefficient.
We study an inverse drift problem for a two-dimensional parabolic equation on the unit square with mixed boundary conditions, where the drift coefficient is recovered from terminal observation data $g=u(\cdot,T)$. A monotone operator is…
We consider the general higher derivative field theories of derived type. At free level, the wave operator of derived-type theory is a polynomial of the order $n\geq 2$ of another operator $W$ which is of the lower order. Every symmetry of…
Given a closed, convex cone $K\subseteq \mathbb{R}^n$, a multivariate polynomial $f\in\mathbb{C}[\mathbf{z}]$ is called $K$-stable if the imaginary parts of its roots are not contained in the relative interior of $K$. If $K$ is the…
In this paper we consider in detail the composition of an irreducible polynomial with X^2 and suggest a recurrent construction of irreducible polynomials of fixed degree over finite fields of odd characteristics. More precisely, given an…
We show that there are Salem numbers of every trace. The nontrivial part of this result is for Salem numbers of negative trace. The proof has two main ingredients. The first is a novel construction, using pairs of polynomials whose zeros…
Gessel and Sagan investigated the Tutte polynomial, $T(x,y)$ using depth first search, and applied their techniques to show that the number of acyclic partial orientations of a graph is $2^gT(3,1/2)$. We provide a short deletion-contraction…
We prove stable versions of trace theorems on the sphere in $L^2$ with optimal constants, thus obtaining rather precise information regarding near-extremisers. We also obtain stability for the trace theorem into $L^q$ for $q > 2$, by…
We establish a strong, geometric lower bound on the (sequential) topological complexity of the unordered configuration spaces of a general graph. As an application, we show that, for most graphs, the topological complexity eventually…
We believe three ingredients are needed for further progress in persistence and its use: invariants not relying on decomposition theorems to go beyond 1-dimension, outcomes suitable for statistical analysis and a setup adopted for…
Stable gonality is a multigraph parameter that measures the complexity of a graph. It is defined using maps to trees. Those maps, in some sense, divide the edges equally over the edges of the tree; stable gonality asks for the map with the…
In the trace reconstruction problem our goal is to learn an unknown string $x\in \{0,1\}^n$ given independent traces of $x$. A trace is obtained by independently deleting each bit of $x$ with some probability $\delta$ and concatenating the…
The deletion channel takes as input a bit string $\mathbf{x} \in \{0,1\}^n$, and deletes each bit independently with probability $q$, yielding a shorter string. The trace reconstruction problem is to recover an unknown string $\mathbf{x}$…
We show a stability-type theorem for foliations on projective spaces which arise as pullbacks of foliations with a split tangent sheaf on weighted projective spaces. As a consequence, we will be able to construct many irreducible components…
Suppose that $X$ is a bounded-degree polynomial with nonnegative coefficients on the $p$-biased discrete hypercube. Our main result gives sharp estimates on the logarithmic upper tail probability of $X$ whenever an associated extremal…
Assume that the vertices of a graph $G$ are always operational, but the edges of $G$ are operational independently with probability $p \in[0,1]$. For fixed vertices $s$ and $t$, the \emph{two-terminal reliability} of $G$ is the probability…
A fourientation of a graph is a choice for each edge of the graph whether to orient that edge in either direction, leave it unoriented, or biorient it. Fixing a total order on the edges and a reference orientation of the graph, we…
We study the problem of reconstructing a function on a manifold satisfying some mild conditions, given data on the values and some derivatives of the function at arbitrary points on the manifold. While the problem of finding a polynomial of…
In this paper, we present a concise development of the well-studied theory of trace class operators on infinite dimensional (separable) Hilbert spaces suitable for an advanced undergraduate, as well as a construction of the inverse…