Related papers: Weak CSR expansions and transience bounds in max-p…
In this paper we derive a full expression for the propagation of multiplicative and additive shape measurement biases into the cosmic shear power spectrum. In doing so we identify several new terms that are associated with selection…
The error exponent in lossy source coding characterizes the asymptotic decay rate of error probability with respect to blocklength. The Marton's error exponent provides the theoretically optimal bound on this rate. However, computation…
In this paper, we point out that the definition of weak tracial approximation can be improved and strengthened. An example of weak tracial approximation is also provided.
For elliptic systems with block structure in the upper half-space and t-independent coefficients, we settle the study of boundary value problems by proving compatible well-posedness of Dirichlet, regularity and Neumann problems in optimal…
New lower bounds on the minimum distance of quasi-twisted codes over finite fields are proposed. They are based on spectral analysis and eigenvalues of polynomial matrices. They generalize the Semenov-Trifonov and Zeh-Ling bounds in a…
Let $\mathcal{C}$ be a quasi-cyclic code of index $l(l\geq2)$. Let $G$ be the subgroup of the automorphism group of $\mathcal{C}$ generated by $\rho^l$ and the scalar multiplications of $\mathcal{C}$, where $\rho$ denotes the standard…
This paper gives lower bounds on the spectral radius of vertex-transitive graphs, based on the number of ``prime cycles'' at a vertex. The bounds are obtained by constructing circuits in the graph that resemble ``cactus trees'', and…
Deep Neural Networks are powerful tools for solving machine learning problems, but their training often involves dense and costly parameter updates. In this work, we use a novel Max-Plus neural architecture in which classical addition and…
We provide the first known upper bounds for the packing dimension of weighted singular and weighted $\omega$-singular matrices. We also prove upper bounds for these sets when intersected with fractal subsets. The latter results, even in the…
For a family $\mathcal{F}$ of graphs, let $ex(n,\mathcal{F})$ denote the maximum number of edges in an $n$-vertex graph which contains none of the members of $\mathcal{F}$ as a subgraph. A longstanding problem in extremal graph theory asks…
We provide upper and lower bounds on the semileptonic weak decay form factors for $B \to D^(*)$ and $\Lambda_b \to \Lambda_c$ decays by utilizing inclusive heavy quark effective theory sum rules. These bounds are calculated to second order…
The isotropy of multiples of Pfister forms is studied. In particular, an improved lower bound on the value of their first Witt index is obtained. This result and certain of its corollaries are applied to the study of the weak isotropy index…
In many high-dimensional problems,polynomial-time algorithms fall short of achieving the statistical limits attainable without computational constraints. A powerful approach to probe the limits of polynomial-time algorithms is to study the…
This paper deals with boundedness results for weak solutions of an elliptic equation where the functions are Carath\'eodory functions satisfying certain $p$-structure conditions that have critical growth even on the boundary. Based on a…
We develop a formalism to extract triple crossing symmetric positivity bounds for effective field theories with multiple degrees of freedom, by making use of $su$ symmetric dispersion relations supplemented with positivity of the partial…
We use rigorous numerical techniques to compute a lower bound for the exponent of expansivity outside a neighborhood of the critical point for thousands of intervals of parameter values in the quadratic family. We compute a possibly small…
In the past few years, successive improvements of the asymptotic complexity of square matrix multiplication have been obtained by developing novel methods to analyze the powers of the Coppersmith-Winograd tensor, a basic construction…
This paper defines weak-$\alpha$-supermodularity for set functions. Many optimization objectives in machine learning and data mining seek to minimize such functions under cardinality constrains. We prove that such problems benefit from a…
Motivated by the extensive application of approximate gradients in machine learning and optimization, we investigate inexact subgradient methods subject to persistent additive errors. Within a nonconvex semialgebraic framework, assuming…
In this paper we define cycle-star graph CSk,n-k to be a graph on n vertices consisting of the cycle of length k and n-k leafs appended to the same vertex of the cycle. Also, we define cycle-path graph CPk,n-k to be a graph on n vertices…