Related papers: Weak CSR expansions and transience bounds in max-p…
Dynamic diversification---finding a set of data points with maximum diversity from a time-dependent sample pool---is an important task in recommender systems, web search, database search, and notification services, to avoid showing users…
In this paper, we investigate a class of Collatz-like problems associated with weakly and strongly admissible triplets of integers. This framework extends the classical Collatz mapping, providing a systematic method for generating triplets…
We study the growth rate of the hard squares lattice gas, equivalent to the number of independent sets on the square lattice, and two related models - non-attacking kings and read-write isolated memory. We use an assortment of techniques…
It is critical to understand the properties of spatial correlation matrices in massive multiple-input multiple-output (MIMO) systems. We derive new bounds on the extreme eigenvalues of a spatial correlation matrix that is characterized by…
This paper proposes lower bounds on a quantity called $L^p$-norm joint spectral radius, or in short, $p$-radius, of a finite set of matrices. Despite its wide range of applications to, for example, stability analysis of switched linear…
We establish quantum dynamical lower bounds for a number of discrete one-dimensional Schr\"odinger operators. These dynamical bounds are derived from power-law upper bounds on the norms of transfer matrices. We develop further the approach…
We realize many sharp spectral bounds of the spectral radius of a nonnegative square matrix $C$ by using the largest real eigenvalues of suitable matrices of smaller sizes related to $C$ that are very easy to find. As applications, we give…
We deal with a robust notion of weak normals for a wide class of irregular curves defined in Euclidean spaces of high dimension. Concerning polygonal curves, the discrete normals are built up through a Gram-Schmidt procedure applied to…
We prove a Chernoff-type bound for sums of matrix-valued random variables sampled via a random walk on an expander, confirming a conjecture due to Wigderson and Xiao. Our proof is based on a new multi-matrix extension of the Golden-Thompson…
In this work, we present Fisher matrix forecast of the tomographic weak lensing power spectrum and bispectrum for three physically distinct types of models of beyond-$\Lambda$CDM: the CPL parametrisation of dynamical dark energy,…
Incremental methods are widely utilized for solving finite-sum optimization problems in machine learning and signal processing. In this paper, we study a family of incremental methods -- including incremental subgradient, incremental…
This PhD thesis is concerned with SDP bounds for codes: upper bounds for (non)-binary error correcting codes and lower bounds for (non)-binary covering codes. The methods are based on the method of Schrijver that uses triple distances in…
A coarse grid correction (CGC) approach is proposed to enhance the efficiency of the matrix exponential and $\varphi$ matrix function evaluations. The approach is intended for iterative methods computing the matrix-vector products with…
We introduce novel methods for encoding acyclicity and s-t-reachability constraints for propositional formulas with underlying directed graphs. They are based on vertex elimination graphs, which makes them suitable for cases where the…
We investigate weakly constrained codes, in which specific patterns occur with prescribed frequencies rather than being strictly forbidden as in conventional constrained coding. We propose a capacity-achieving construction of a weakly…
In this paper we introduce {\em weak ascent sequences}, a class of number sequences that properly contains ascent sequences. We show how these sequences uniquely encode each of the following objects: permutations avoiding a particular…
We present and analyze a natural hierarchy of weak theories, develop analysis in them, and show that they are interpretable in bounded quantifier arithmetic $\text{I}\Delta_0$ (and hence in Robinson arithmetic Q). The strongest theories…
This thesis is a study of large sets of unit vectors in $\cx^n$ such that the absolute value of their standard inner products takes on only a small number of values. We begin with bounds: what is the maximal size of a set of lines with only…
The constraints on the minimal supergravity model from the b->s+\gamma decay are studied. A large domain in the parameter space for the model satisfies the CLEO bound, BR(b->s+\gamma)<5.4X10^{-4}. However, the allowed domain is expected to…
Performance of optimization on quadratic problems sensitively depends on the low-lying part of the spectrum. For large (effectively infinite-dimensional) problems, this part of the spectrum can often be naturally represented or approximated…