Related papers: Delandtsheer--Doyen parameters for block-transitiv…
In a recent work, Coronel et al. initiated the study of the relation between the diversity-multiplexing tradeoff (DMT) performance of a multiuser multiple-input multiple-output (MU-MIMO) lattice code and the rate of the decay of the…
We present a unified, SI-consistent framework to constrain minimal SME coefficients $a_\mu$ and $b_\mu$ using magnetically confined two-dimensional electron systems under a uniform magnetic field. Working in the nonrelativistic…
We revise the enumeration of the imprimitive rank two quaternionic reflection groups, adding missing groups and establishing isomorphisms between groups in the published tables. The isomorphisms are obtained as a consequence of the…
Tight bounds on the block entropy of patterns of sequences generated by independent and identically distributed (i.i.d.) sources are derived. A pattern of a sequence is a sequence of integer indices with each index representing the order of…
We start by introducing a nonlinear involution operator which maps the space of solutions of Sturm-Liouville equations into the space of solutions of the associated equations which turn out to be nonlinear ordinary differential equations.…
In this paper we consider binary linear codes spanned by incidence matrices of Steiner 2-designs associated with maximal arcs in projective planes of even order, and their dual codes. Upper and lower bounds on the 2-rank of the incidence…
We present a novel class of real symmetric matrices in arbitrary dimension $d$, linearly dependent on a parameter $x$. The matrix elements satisfy a set of nontrivial constraints that arise from asking for commutation of pairs of such…
The results of the computer simulation of the aggregates growth of the similarly charged particles in the framework of deterministic Laplacian growth model on a square lattice are presented. Cluster growth is controlled by three parameters…
We give one more proof of the first linear programming bound for binary codes, following the line of work initiated by Friedman and Tillich. The new argument is somewhat similar to previous proofs, but we believe it to be both simpler and…
In this paper we study a new model for patterns in two dimensions, inspired by diblock copolymer melts with a dominant phase. The model is simple enough to be amenable not only to numerics but also to analysis, yet sophisticated enough to…
We examine nonparametric dose-finding designs that use toxicity estimates based on all available data at each dose allocation decision. We prove that one such design family, called here "interval design", converges almost surely to the…
In some practical learning tasks, such as traffic video analysis, the number of available training samples is restricted by different factors, such as limited communication bandwidth and computation power. Determinantal Point Process (DPP)…
This paper investigates the behavior of statistical ensembles under iteration map induced by discrete integrable Hamiltonian systems in deterministic case and stochastic case, addressing the problem from two perspectives: the Law of Large…
We study the multiplicative statistics associated to the limiting determinantal point process describing unitary random matrices with a critical edge point, where limiting density vanishes like a power 5/2. We prove that these statistics…
The Liouvillian exceptional points for a quantum Markovian master equation of an oscillator in a generic environment are obtained. They occur at the points when the modified frequency of the oscillator vanishes, whereby the eigenvalues of…
In 1991, Weidong Fang and Huiling Li proved that there are only finitely many non-trivial linear spaces that admit a line-transitive, point-imprimitive group action, for a given value of gcd(k,r), where k is the line size and r is the…
We consider two particles with a local interaction $U$ in a random potential at a scale $L_1$ (the one particle localization length). A simplified description is provided by a Gaussian matrix ensemble with a preferential basis. We define…
We prove identifiability of parameters for a broad class of random graph mixture models. These models are characterized by a partition of the set of graph nodes into latent (unobservable) groups. The connectivities between nodes are…
We consider the asymptotic power performance under local alternatives of the Cochran-Mantel-Haenszel test. Our setting is non-traditional: we investigate randomized experiments that assign subjects via Fisher's blocking design. We show that…
In this paper, we establish the super Poincar\'e inequality for the two-parameter Dirichlet process when the partition number of the state space is finite. Furthermore, if the partition number is infinite, the super Poincar'e inequality…