Related papers: Balanced diagonals in frequency squares
A $(d-1)$-dimensional simplicial complex is called balanced if its underlying graph admits a proper $d$-coloring. We show that many well-known face enumeration results have natural balanced analogs (or at least conjectural analogs).…
The energy spectra of quasi-one dimensional quasiperiodic ladder networks are analyzed within a tight binding description. In particular, we show that if a selected set of sites in each strand of a ladder is tunnel-coupled to quantum dots…
The randomized row method is a popular representative of the iterative algorithm because of its efficiency in solving the overdetermined and consistent systems of linear equations. In this paper, we present an extended randomized multiple…
Patterned random matrices such as the reverse circulant, the symmetric circulant, the Toeplitz and the Hankel matrices and their almost sure limiting spectral distribution (LSD), have attracted much attention. Under the assumption that the…
A defining set of a Latin square is a partially filled-in Latin square which completes to no other Latin square of the same order. We introduce the concept of a $k$-strong defining set, in which if less than $k$ entries are deleted, the…
We consider the stochastically driven one dimensional nonlinear oscillator $\ddot{x}+2\Gamma\dot{x}+\omega^2_0 x+\lambda x^3 = f(t)$ where f(t) is a Gaussian noise which, for the bulk of the work, is delta correlated (white noise). We…
We study a class of square matrices with non-negative elements which have cyclically monotone rows in the sense that each row of a matrix from the class consists of a cyclically non-increasing sequence of numbers starting from a maximal…
The periodogram is a popular tool that tests whether a signal consists only of noise or if it also includes other components. The main issue of this method is to define a critical detection threshold that allows identification of a…
Superconducting resonators are now found in a broad range of applications that require high-fidelity measurement of low-energy signals. A common feature across almost all of these applications is the need for increased numbers of resonators…
In frequency-selective channels linear receivers enjoy significantly-reduced complexity compared with maximum likelihood receivers at the cost of performance degradation which can be in the form of a loss of the inherent frequency diversity…
We extend a recent argument of Kahn, Narayanan and Park (Proceedings of the AMS, to appear) about the threshold for the appearance of the square of a Hamilton cycle to other spanning structures. In particular, for any spanning graph, we…
On the linear level elliptic equilibria of Hamiltonian systems are mere superpositions of harmonic oscillators. Non-linear terms can produce instability, if the ratio of frequencies is rational and the Hamiltonian is indefinite. In this…
Given a graph G with n vertices and k players, each of which is placing a facility on one of the vertices of G, we define the score of the i'th player to be the number of vertices for which, among all players, the facility placed by the…
It is shown that every scalar linear quadrilateral lattice equation lies within a family of similar equations, members of which are compatible between one another on a higher dimensional lattice. There turn out to be two such families, a…
A regular linear line complex is a three-parameter set of lines in space, whose Pl\"ucker vectors lie in a hyperplane, which is not tangent to the Klein quadric. Our main result is a bound $O(n^{1/2}m^{3/4} + m+n)$ for the number of…
Let $(P,\leq)$ be a finite poset (partially ordered set), where $P$ has cardinality $n$. Consider linear extensions of $P$ as permutations $x_1x_2\cdots x_n$ in one-line notation. For distinct elements $x,y\in P$, we define…
A $\{0,1\}$-matrix $\mathsf{A}$ is balanced if it does not contain a submatrix of odd order having exactly two 1's per row and per column. A graph is balanced if its clique-matrix is balanced. No characterization of minimally unbalanced…
Frankl and F\"uredi conjectured in 1989 that the maximum Lagrangian of all $r$-uniform hypergraphs of fixed size $m$ is realised by the initial segment of the colexicographic order. In particular, in the principal case $m=\binom{t}{r}$…
A mode of a multiset $S$ is an element $a \in S$ of maximum multiplicity; that is, $a$ occurs at least as frequently as any other element in $S$. Given a list $A[1:n]$ of $n$ items, we consider the problem of constructing a data structure…
In the complex plane, the frequency response of a univariate polynomial is the set of values taken by the polynomial when evaluated along the imaginary axis. This is an algebraic curve partitioning the plane into several connected…