On separating systems

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

More on -Separating Systems

The theory of separating systems has been applied in different areas of science and technology such as automata synthesis, technical diagnosis, and authenticating ownership claims. Constructions of (2 2)-separating systems derived from error-correcting codes are given, together with bounds on their parameters based on distance considerations.

متن کامل

On separating systems

We sharpen a result of Hansel on separating set systems. We also extend a theorem of Spencer on completely separating systems by proving an analogue of Hansel’s result.

متن کامل

The effects of suspending medium on dielectrophoretic systems for separating and sorting carbon nanotubes

The separation of two different types of multi-walled carbon nanotubes is studied in a dielectrophoresis-based microchannel system in seven different solvents as the suspending medium.  A simple model was developed to predict the behavior of the multi-walled carbon nanotubes in the above mentioned system. Then, the equations of motion for the multi-walled carbon nanotubes in that system were in...

متن کامل

Splitting systems and separating systems

Suppose m and t are integers such that 0 < t ≤ m. An (m, t) splitting system is a pair (X,B) where |X| = m, B is a set of bm2 c subsets of X, called blocks such that for every Y ⊆ X and |Y | = t, there exists a block B ∈ B such that |B ∩Y | = b t 2c or |(X \B)∩Y | = b t 2c. We will give some results on splitting systems for t = 2 or 4 which often depend on results from uniform separating system...

متن کامل

Separating Path Systems

We study separating systems of the edges of a graph where each member of the separating system is a path. We conjecture that every n-vertex graph admits a separating path system of size O(n) and prove this in certain interesting special cases. In particular, we establish this conjecture for random graphs of all densities and graphs with linear minimum degree. We also obtain tight bounds on the ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: European Journal of Combinatorics

سال: 2007

ISSN: 0195-6698

DOI: 10.1016/j.ejc.2006.04.003