Search results for "combinatoric"
showing 10 items of 1776 documents
On the satisfiability problem for fragments of two-variable logic with one transitive relation
2019
Abstract We study the satisfiability problem for two-variable first-order logic over structures with one transitive relation. We show that the problem is decidable in 2-NExpTime for the fragment consisting of formulas where existential quantifiers are guarded by transitive atoms. As this fragment enjoys neither the finite model property nor the tree model property, to show decidability we introduce a novel model construction technique based on the infinite Ramsey theorem. We also point out why the technique is not sufficient to obtain decidability for the full two-variable logic with one transitive relation; hence, contrary to our previous claim, [FO$^2$ with one transitive relation is deci…
Probabilistic semantics for categorical syllogisms of Figure II
2018
A coherence-based probability semantics for categorical syllogisms of Figure I, which have transitive structures, has been proposed recently (Gilio, Pfeifer, & Sanfilippo [15]). We extend this work by studying Figure II under coherence. Camestres is an example of a Figure II syllogism: from Every P is M and No S is M infer No S is P. We interpret these sentences by suitable conditional probability assessments. Since the probabilistic inference of \(\bar{P}|S\) from the premise set \(\{M|P,\bar{M}|S\}\) is not informative, we add \(p(S|(S \vee P))>0\) as a probabilistic constraint (i.e., an “existential import assumption”) to obtain probabilistic informativeness. We show how to propagate the…
A branch-price-and-cut algorithm for the capacitated multiple vehicle traveling purchaser problem with unitary demand
2021
Abstract The multiple vehicle traveling purchaser problem (MVTPP) consists of simultaneously selecting suppliers and routing a fleet of homogeneous vehicles to purchase different products at the selected suppliers so that all product demands are fulfilled and traveling and purchasing costs are minimized. We consider variants of the MVTPP in which the capacity of the vehicles can become binding and the demand for each product is one unit. Corresponding solution algorithms from the literature are either branch-and-cut or branch-and-price algorithms, where in the latter case the route-generation subproblem is solved on an expanded graph by applying standard dynamic-programming techniques. Our …
Right-arm rotation distance between binary trees
2003
We consider a transformation on binary trees, named right-arm rotation, which is a special instance of the well-known rotation transformation. Only rotations at nodes of the right arm of the trees are allowed. Using ordinal tools, we give an efficient algorithm for computing the right-arm rotation distance between two binary trees, i.e., the minimum number of rightarm rotations necessary to transform one tree into the other.
Modeling multiple taxis: Tumor invasion with phenotypic heterogeneity, haptotaxis, and unilateral interspecies repellence
2021
We provide a short review of existing models with multiple taxis performed by (at least) one species and consider a new mathematical model for tumor invasion featuring two mutually exclusive cell phenotypes (migrating and proliferating). The migrating cells perform nonlinear diffusion and two types of taxis in response to non-diffusing cues: away from proliferating cells and up the gradient of surrounding tissue. Transitions between the two cell subpopulations are influenced by subcellular (receptor binding) dynamics, thus conferring the setting a multiscale character. We prove global existence of weak solutions to a simplified model version and perform numerical simulations for the full se…
Property (w) for perturbations of polaroid operators
2008
Abstract A bounded linear operator T ∈ L ( X ) acting on a Banach space satisfies property ( w ) , a variant of Weyl’s theorem, if the complement in the approximate point spectrum σ a ( T ) of the Weyl essential approximate-point spectrum σ wa ( T ) is the set of all isolated points of the spectrum which are eigenvalues of finite multiplicity. In this note, we study the stability of property ( w ) for a polaroid operator T acting on a Banach space, under perturbations by finite rank operators, by nilpotent operators and, more generally, by algebraic operators commuting with T.
Induced and reduced unbounded operator algebras
2012
The induction and reduction precesses of an O*-vector space \({{\mathfrak M}}\) obtained by means of a projection taken, respectively, in \({{\mathfrak M}}\) itself or in its weak bounded commutant \({{\mathfrak M}^\prime_{\rm w}}\) are studied. In the case where \({{\mathfrak M}}\) is a partial GW*-algebra, sufficient conditions are given for the induced and the reduced spaces to be partial GW*-algebras again.
Riesz-like bases in rigged Hilbert spaces
2015
The notions of Bessel sequence, Riesz-Fischer sequence and Riesz basis are generalized to a rigged Hilbert space $\D[t] \subset \H \subset \D^\times[t^\times]$. A Riesz-like basis, in particular, is obtained by considering a sequence $\{\xi_n\}\subset \D$ which is mapped by a one-to-one continuous operator $T:\D[t]\to\H[\|\cdot\|]$ into an orthonormal basis of the central Hilbert space $\H$ of the triplet. The operator $T$ is, in general, an unbounded operator in $\H$. If $T$ has a bounded inverse then the rigged Hilbert space is shown to be equivalent to a triplet of Hilbert spaces.
The Average State Complexity of the Star of a Finite Set of Words Is Linear
2008
We prove that, for the uniform distribution over all sets Xof m(that is a fixed integer) non-empty words whose sum of lengths is n, $\mathcal{D}_X$, one of the usual deterministic automata recognizing X*, has on average $\mathcal{O}(n)$ states and that the average state complexity of X*is i¾?(n). We also show that the average time complexity of the computation of the automaton $\mathcal{D}_X$ is $\mathcal{O}(n\log n)$, when the alphabet is of size at least three.
On achieving near-optimal “Anti-Bayesian” Order Statistics-Based classification fora asymmetric exponential distributions
2013
Published version of a Chapter in the book: Computer Analysis of Images and Patterns. Also available from the publisher at: http://dx.doi.org/10.1007/978-3-642-40261-6_44 This paper considers the use of Order Statistics (OS) in the theory of Pattern Recognition (PR). The pioneering work on using OS for classification was presented in [1] for the Uniform distribution, where it was shown that optimal PR can be achieved in a counter-intuitive manner, diametrically opposed to the Bayesian paradigm, i.e., by comparing the testing sample to a few samples distant from the mean - which is distinct from the optimal Bayesian paradigm. In [2], we showed that the results could be extended for a few sym…