Search results for "combinatoric"
showing 10 items of 1776 documents
The mixed general routing polyhedron
2003
[EN] In Arc Routing Problems, ARPs, the aim is to find on a graph a minimum cost traversal satisfying some conditions related to the links of the graph. Due to restrictions to traverse some streets in a specified way, most applications of ARPs must be modeled with a mixed graph. Although several exact algorithms have been proposed, no polyhedral investigations have been done for ARPs on a mixed graph. In this paper we deal with the Mixed General Routing Problem which consists of finding a minimum cost traversal of a given link subset and a given vertex subset of a mixed graph. A formulation is given that uses only one variable for each link (edge or arc) of the graph. Some properties of the…
On set-valued cone absolutely summing maps
2009
Spaces of cone absolutely summing maps are generalizations of Bochner spaces Lp(μ, Y), where (Ω, Σ, μ) is some measure space, 1 ≤ p ≤ ∞ and Y is a Banach space. The Hiai-Umegaki space \( \mathcal{L}^1 \left[ {\sum ,cbf(X)} \right] \) of integrably bounded functions F: Ω → cbf(X), where the latter denotes the set of all convex bounded closed subsets of a separable Banach space X, is a set-valued analogue of L1(μ, X). The aim of this work is to introduce set-valued cone absolutely summing maps as a generalization of \( \mathcal{L}^1 \left[ {\sum ,cbf(X)} \right] \) , and to derive necessary and sufficient conditions for a set-valued map to be such a set-valued cone absolutely summing map. We …
Characterizing extreme points of polyhedra an extension of a result by Wolfgang Bühler
1982
This paper reconsiders the characterization given by Buhler admitting convex polyhedra of probability distributions on a finite or countable set which are given by systems of linear inequalities more complex than those considered before.
An automata-theoretic approach to the study of the intersection of two submonoids of a free monoid
2008
We investigate the intersection of two finitely generated submonoids of the free monoid on a finite alphabet. To this purpose, we consider automata that recognize such submonoids and we study the product automata recognizing their intersection. By using automata methods we obtain a new proof of a result of Karhumaki on the cha- racterization of the intersection of two submonoids of rank two, in the case of prefix (or suffix) generators. In a more general setting, for an arbitrary number of generators, we prove that if H and K are two finitely generated submonoids generated by prefix sets such that the product automaton associated to H ∩ K has a given special property then �(H ∩ K) ≤ �(H)�(K…
Generating restricted classes of involutions, Bell and Stirling permutations
2010
AbstractWe present a recursive generating algorithm for unrestricted permutations which is based on both the decomposition of a permutation as a product of transpositions and that as a union of disjoint cycles. It generates permutations at each recursive step and slight modifications of it produce generating algorithms for Bell permutations and involutions. Further refinements yield algorithms for these classes of permutations subject to additional restrictions: a given number of cycles or/and fixed points. We obtain, as particular cases, generating algorithms for permutations counted by the Stirling numbers of the first and second kind, even permutations, fixed-point-free involutions and d…
Nondeterministic Unitary OBDDs
2017
We investigate the width complexity of nondeterministic unitary OBDDs (NUOBDDs). Firstly, we present a generic lower bound on their widths based on the size of strong 1-fooling sets. Then, we present classically “cheap” functions that are “expensive” for NUOBDDs and vice versa by improving the previous gap. We also present a function for which neither classical nor unitary nondeterminism does help. Moreover, based on our results, we present a width hierarchy for NUOBDDs. Lastly, we provide the bounds on the widths of NUOBDDs for the basic Boolean operations negation, union, and intersection.
Irreducible components of Hurwitz spaces parameterizing Galois coverings of curves of positive genus
2014
Let Y be a smooth, projective, irreducible complex curve. A G-covering p : C → Y is a Galois covering, where C is a smooth, projective, irreducible curve and an isomorphism G ∼ −→ Aut(C/Y ) is fixed. Two G-coverings are equivalent if there is a G-equivariant isomorphism between them. We are concerned with the Hurwitz spaces H n (Y ) and H G n (Y, y0). The first one parameterizes Gequivalence classes of G-coverings of Y branched in n points. The second one, given a point y0 ∈ Y , parameterizes G-equivalence classes of pairs [p : C → Y, z0], where p : C → Y is a G-covering unramified at y0 and z0 ∈ p (y0). When G = Sd one can equivalently consider coverings f : X → Y of degree d with full mon…
Very Narrow Quantum OBDDs and Width Hierarchies for Classical OBDDs
2014
In the paper we investigate a model for computing of Boolean functions – Ordered Binary Decision Diagrams (OBDDs), which is a restricted version of Branching Programs. We present several results on the comparative complexity for several variants of OBDD models. We present some results on the comparative complexity of classical and quantum OBDDs. We consider a partial function depending on a parameter k such that for any k > 0 this function is computed by an exact quantum OBDD of width 2, but any classical OBDD (deterministic or stable bounded-error probabilistic) needs width 2 k + 1. We consider quantum and classical nondeterminism. We show that quantum nondeterminism can be more efficient …
Fixed point theory in partial metric spaces via φ-fixed point’s concept in metric spaces
2014
Abstract Let X be a non-empty set. We say that an element x ∈ X is a φ-fixed point of T, where φ : X → [ 0 , ∞ ) and T : X → X , if x is a fixed point of T and φ ( x ) = 0 . In this paper, we establish some existence results of φ-fixed points for various classes of operators in the case, where X is endowed with a metric d. The obtained results are used to deduce some fixed point theorems in the case where X is endowed with a partial metric p. MSC:54H25, 47H10.
An integral representation for decomposable measures of measurable functions
1994
We start with a measurem on a measurable space (Ω,A), decomposable with respect to an Archimedeant-conorm ⊥ on a real interval [0,M], which generalizes an additive measure. Using the integral introduced by the second author, a Radon-Nikodym type theorem, needed in what follows, is given.