Search results for "cardinality"
showing 10 items of 42 documents
Fuzzy portfolio selection based on the analysis of efficient frontiers
2011
We present an algorithm for analyzing the geometry of the efficient frontier of the portfolio selection problem with semicontinuous variable and cardinality constraints, and use it as a basis to solve a fuzzy version of the problem, designed to obtain efficient portfolios, in the Markowitz's sense, for which the trade-off between expected return and assumed risk fits better the investor's subjective criteria. We illustrate our proposal with an example solved with LINGO and Mathematica.
Efficient CNF Encoding of Boolean Cardinality Constraints
2003
In this paper, we address the encoding into CNF clauses of Boolean cardinality constraints that arise in many practical applications. The proposed encoding is efficient with respect to unit propagation, which is implemented in almost all complete CNF satisfiability solvers. We prove the practical efficiency of this encoding on some problems arising in discrete tomography that involve many cardinality constraints. This encoding is also used together with a trivial variable elimination in order to re-encode parity learning benchmarks so that a simple Davis and Putnam procedure can solve them.
Minimal Absent Words in Rooted and Unrooted Trees
2019
We extend the theory of minimal absent words to (rooted and unrooted) trees, having edges labeled by letters from an alphabet \(\varSigma \) of cardinality \(\sigma \). We show that the set \(\text {MAW}(T)\) of minimal absent words of a rooted (resp. unrooted) tree T with n nodes has cardinality \(O(n\sigma )\) (resp. \(O(n^{2}\sigma )\)), and we show that these bounds are realized. Then, we exhibit algorithms to compute all minimal absent words in a rooted (resp. unrooted) tree in output-sensitive time \(O(n+|\text {MAW}(T)|)\) (resp. \(O(n^{2}+|\text {MAW}(T)|)\) assuming an integer alphabet of size polynomial in n.
On a Linear Diophantine Problem of Frobenius: Extending the Basis
1998
LetXk={a1, a2, …, ak},k>1, be a subset of N such that gcd(Xk)=1. We shall say that a natural numbernisdependent(onXk) if there are nonnegative integersxisuch thatnhas a representationn=∑ki=1 xiai, elseindependent. The Frobenius numberg(Xk) ofXkis the greatest integer withnosuch representation. Selmer has raised the problem of extendingXkwithout changing the value ofg. He showed that under certain conditions it is possible to add an elementc=a+kdto the arithmetic sequencea,a+d,a+2d, …, a+(k−1) d, gcd(a, d)=1, without alteringg. In this paper, we give the setCof all independent numberscsatisfyingg(A, c)=g(A), whereAcontains the elements of the arithmetic sequence. Moreover, ifa>kthen we give …
Binary Patterns in Infinite Binary Words
2002
In this paper we study the set P(w) of binary patterns that can occur in one infinite binary word w, comparing it with the set F(w) of factors of the word. Since the set P(w) can be considered as an extension of the set F(w), we first investigate how large is such extension, by introducing the parameter ?(w) that corresponds to the cardinality of the difference set P(w) \ F(w). Some non trivial results about such parameter are obtained in the case of the Thue-Morse and the Fibonacci words. Since, in most cases, the parameter ?(w) is infinite, we introduce the pattern complexity of w, which corresponds to the complexity of the language P(w). As a main result, we prove that there exist infini…
On Sets of Words of Rank Two
2019
Given a (finite or infinite) subset X of the free monoid A∗ over a finite alphabet A, the rank of X is the minimal cardinality of a set F such that X⊆ F∗. A submonoid M generated by k elements of A∗ is k-maximal if there does not exist another submonoid generated by at most k words containing M. We call a set X⊆ A∗ primitive if it is the basis of a |X|-maximal submonoid. This extends the notion of primitive word: indeed, w is a primitive set if and only if w is a primitive word. By definition, for any set X, there exists a primitive set Y such that X⊆ Y∗. The set Y is therefore called a primitive root of X. As a main result, we prove that if a set has rank 2, then it has a unique primitive …
Countably compact weakly Whyburn spaces
2015
The weak Whyburn property is a generalization of the classical sequential property that was studied by many authors. A space X is weakly Whyburn if for every non-closed set \({A \subset X}\) there is a subset \({B \subset A}\) such that \({\overline{B} \setminus A}\) is a singleton. We prove that every countably compact Urysohn space of cardinality smaller than the continuum is weakly Whyburn and show that, consistently, the Urysohn assumption is essential. We also give conditions for a (countably compact) weakly Whyburn space to be pseudoradial and construct a countably compact weakly Whyburn non-pseudoradial regular space, which solves a question asked by Angelo Bella in private communica…
Cardinal inequalities involving the Hausdorff pseudocharacter
2023
We establish several bounds on the cardinality of a topological space involving the Hausdorff pseudocharacter $H\psi(X)$. This invariant has the property $\psi_c(X)\leq H\psi(X)\leq\chi(X)$ for a Hausdorff space $X$. We show the cardinality of a Hausdorff space $X$ is bounded by $2^{pwL_c(X)H\psi(X)}$, where $pwL_c(X)\leq L(X)$ and $pwL_c(X)\leq c(X)$. This generalizes results of Bella and Spadaro, as well as Hodel. We show additionally that if $X$ is a Hausdorff linearly Lindel\"of space such that $H\psi(X)=\omega$, then $|X|\le 2^\omega$, under the assumption that either $2^{<\mathfrak{c}}=\mathfrak{c}$ or $\mathfrak{c}<\aleph_\omega$. The following game-theoretic result is shown: i…
A characterization of the line set of an odd-dimensional Baer subspace
1990
Generalizing a theorem of Beutelspacher and Seeger, we consider line sets\(\mathcal{L}\) inP=PG(2t + 1,q),t ∈ IN, with the following properties: (1) any (t + 1)-dimensional subspace ofP contains at least one line of\(\mathcal{L}\), (2) if a pointx ofP is incident with at least two lines of\(\mathcal{L}\) then the points in the factor geometryP/x which are induced by the lines of\(\mathcal{L}\) throughx form a blocking set of type (t, 1) inP/x, (3) any line of\(\mathcal{L}\) is coplanar with at least one further line of\(\mathcal{L}\). We will show that the examples of minimal cardinality are exactly the line sets of Baer subspaces ofP.
A Nonlinear Label Compression and Transformation Method for Multi-label Classification Using Autoencoders
2016
Multi-label classification targets the prediction of multiple interdependent and non-exclusive binary target variables. Transformation-based algorithms transform the data set such that regular single-label algorithms can be applied to the problem. A special type of transformation-based classifiers are label compression methods, which compress the labels and then mostly use single label classifiers to predict the compressed labels. So far, there are no compression-based algorithms that follow a problem transformation approach and address non-linear dependencies in the labels. In this paper, we propose a new algorithm, called Maniac (Multi-lAbel classificatioN usIng AutoenCoders), which extra…