Results 251 to 260 of about 5,740,582 (295)
Some of the next articles are maybe not open access.
Journal of Combinatorial Designs, 2013
AbstractBlokhuis and Mazzocca (A. Blokhuis and F. Mazzocca, The finite field Kakeya problem (English summary). Building bridges. Bolyai Soc Math Stud 19 (2008) 205–218) provide a strong answer to the finite field analog of the classical Kakeya problem, which asks for the minimum size of a point set in an affine plane π that contains a line in every ...
Dover, Jeremy M. +2 more
openaire +2 more sources
AbstractBlokhuis and Mazzocca (A. Blokhuis and F. Mazzocca, The finite field Kakeya problem (English summary). Building bridges. Bolyai Soc Math Stud 19 (2008) 205–218) provide a strong answer to the finite field analog of the classical Kakeya problem, which asks for the minimum size of a point set in an affine plane π that contains a line in every ...
Dover, Jeremy M. +2 more
openaire +2 more sources
Minimal sets alternative to minimal Geršgorin sets
Applied Numerical Mathematics, 2010Localization regions for the real eigenvalues or the real parts of the eigenvalues of a given real matrix \(A\) were studied by \textit{J. M. Penã} [SIAM J. Matrix Anal. Appl. 22, No.~4, 1027--1037 (2001; Zbl 0986.15015)], who introduced the notions of row \(\mathcal B\)-set and \(\mathcal B\)-set.
Cvetković, Lj., Peña, J. M.
openaire +1 more source
Journal of Symbolic Logic, 1971
The purpose of this paper is twofold. In §1 and §2 which are largely expository we develop the known theory of ℵ1-categoricity in terms of strongly minimal sets. In §3 we settle affirmatively Vaught's conjecture that a complete ℵ1-categorical theory has either just one or just ℵ0 countable models, and in §4 we present an example which serves to ...
John T. Baldwin 0001 +1 more
openaire +3 more sources
The purpose of this paper is twofold. In §1 and §2 which are largely expository we develop the known theory of ℵ1-categoricity in terms of strongly minimal sets. In §3 we settle affirmatively Vaught's conjecture that a complete ℵ1-categorical theory has either just one or just ℵ0 countable models, and in §4 we present an example which serves to ...
John T. Baldwin 0001 +1 more
openaire +3 more sources
SIAM Journal on Scientific and Statistical Computing, 1985
Minimizing the size or cost of a set of tests without losing any discrimination power is a common problem in fault testing and diagnosis, pattern recognition, and biological identification. This problem, referred to as the minimum test set problem, is known to be NP-hard, so that determining an optimal solution is not always computationally feasible ...
Moret, Bernard M. E., Shapiro, Henry D.
openaire +1 more source
Minimizing the size or cost of a set of tests without losing any discrimination power is a common problem in fault testing and diagnosis, pattern recognition, and biological identification. This problem, referred to as the minimum test set problem, is known to be NP-hard, so that determining an optimal solution is not always computationally feasible ...
Moret, Bernard M. E., Shapiro, Henry D.
openaire +1 more source
1995
A unification algorithm is said to be minimal for a unification problem if it generates exactly a complete set of minimal unifiers, without instances, without repetitions. Aim of this paper is to describe a new set unification algorithm minimal for a significant collection of sample problems that can be used as benchmarks for testing any set ...
Arenas Sanchez P, DOVIER, Agostino
openaire +3 more sources
A unification algorithm is said to be minimal for a unification problem if it generates exactly a complete set of minimal unifiers, without instances, without repetitions. Aim of this paper is to describe a new set unification algorithm minimal for a significant collection of sample problems that can be used as benchmarks for testing any set ...
Arenas Sanchez P, DOVIER, Agostino
openaire +3 more sources
Minimal Sets on Graphs and Dendrites
International Journal of Bifurcation and Chaos, 2003The topological structure of minimal sets of continuous maps on graphs, dendrites and dendroids is studied. A full characterization of minimal sets on graphs and a partial characterization of minimal sets on dendrites are given. An example of a minimal set containing an interval on a dendroid is given.
Francisco Balibrea +2 more
openaire +1 more source