Given a finite graph G, the maximum length of sequence $$(v_1,\ldots ,v_k)$$ vertices in G such that each $$v_i$$ dominates vertex is not dominated by any $$\{v_1,\ldots ,v_{i-1}\}$$ called Grundy domination number, $$\gamma _\mathrm{gr}(G)$$ , G. A small modification definition yields Z-Grundy which dual invariant well-known zero forcing number. In this paper, we prove _\mathrm{gr}(G) \ge \fra...

• Temporal correlation between the desired and interfering signals is considered. Relaxed zero-forcing (RZF) beamformer uses an ellipsoidal constraint. Ellipsoidal constraint bounds interference leakage at output of beamformer. Analytic expression MSE RZF presented for two-user case. Efficacy brain activity reconstruction with EEG shown by simulations. The relaxed a quadratically-and-linearly c...

In this paper we prove that it is consistent that every γ-set is countable while not every strong measure zero set is countable. We also show that it is consistent that every strong γ-set is countable while not every γ-set is countable. On the other hand we show that every strong measure zero set is countable iff every set with the Rothberger property is countable. A set of realsX has strong me...

The objective of this paper is to compare probabilistic models and fuzzy set models for design against uncertainty when there is limited information about the statistics of the uncertainty or modeling error. First, we compare the axioms of probabilistic and fuzzy set methods and the rules governing the arithmetic operations that these methods use. Then, we compare the two methods in designing f...