Related papers: A central limit theorem for general orthogonal arr…
This paper develops a unified framework for partial identification and inference in stratified experiments with attrition, accommodating both equal and heterogeneous treatment shares across strata. For equal-share designs, we apply recent…
In this paper, we revisit the problem of classifying real algebraic and semialgebraic sets by their topological types, focusing on establishing the effectiveness of bounds rather than deriving new quantitative estimates. Building on Hardt's…
The restriction problem is better understood for hypersurfaces and recent progresses have been made by bilinear and multilinear approaches and most recently polynomial partitioning method which is combined with those estimates. However, for…
Unitary designs are essential tools in several quantum information protocols. Similarly to other design concepts, unitary designs are mainly used to facilitate averaging over a relevant space, in this case, the unitary group…
Orthogonal Fractional Factorial Designs and in particular Orthogonal Arrays are frequently used in many fields of application, including medicine, engineering and agriculture. In this paper we present a methodology and an algorithm to find…
We give a central limit theorem, which has applications to Bayesian statistics and urn problems. The latter are investigated, by paying special attention to multicolor randomly reinforced generalized Polya urns.
Estimation of structure, such as in variable selection, graphical modelling or cluster analysis is notoriously difficult, especially for high-dimensional data. We introduce stability selection. It is based on subsampling in combination with…
The SetCover problem has been extensively studied in many different models of computation, including parallel and distributed settings. From an approximation point of view, there are two standard guarantees: an $O(\log…
We obtain new linear programming (LP) and constructive bounds for the covering radius of binary orthogonal arrays of strength $2k$. Our LP bounds develop in two alternative scenarios. First, if a point $y \in F_2^n$, where the covering…
Linear codes with few weights have applications in consumer electronics, communication, data storage system, secret sharing, authentication codes, association schemes, and strongly regular graphs. This paper first generalizes the method of…
We develop general theory for finding locally optimal designs in a class of single-covariate models under any differentiable optimality criterion. Yang and Stufken [Ann. Statist. 40 (2012) 1665-1681] and Dette and Schorning [Ann. Statist.…
We present a novel de-homogenization approach for efficient design of high-resolution load-bearing structures. The proposed approach builds upon a streamline-based parametrization of the design domain, using a set of space-filling and…
We study pushdown systems where control states, stack alphabet, and transition relation, instead of being finite, are first-order definable in a fixed countably-infinite structure. We show that the reachability analysis can be addressed…
We establish the central limit theorem for linear processes with dependent innovations including martingales and mixingale type of assumptions as defined in McLeish [Ann. Probab. 5 (1977) 616--621] and motivated by Gordin [Soviet Math.…
We consider a class of non-conformal expanding maps on the $d$-dimensional torus. For an equilibrium measure of an H\"older potential, we prove an analogue of the Central Limit Theorem for the fluctuations of the logarithm of the measure of…
For a certain parametrized family of maps on the circle, with critical points and logarithmic singularities where derivatives blow up to infinity, a positive measure set of parameters was constructed in [19], corresponding to maps which…
We prove results about uniform convergence of densities in the free central limit theorem without assumptions of boundedness on the support.
We generalized to higher dimensions the notions of optical orthogonal codes. We establish uper bounds on the capacity of general $ n $-dimensional OOCs, and on specific types of ideal codes (codes with zero off-peak autocorrelation). The…
Parity declustering allows faster reconstruction of a disk array when some disk fails. Moreover, it guarantees uniform reconstruction workload on all surviving disks. It has been shown that parity declustering for one-failure tolerant array…
By using main properties of uniformly distributed sequences of increasing finite sets in infinite-dimensional rectangles in $R^{\infty}$ described in [G.R. Pantsulaia, On uniformly distributed sequences of an increasing family of finite…