Search results for "Combinatorics"

showing 10 items of 1770 documents

Trace and density results on regular trees

2019

We give characterizations for the existence of traces for first order Sobolev spaces defined on regular trees.

Trace (linear algebra)Mathematics::Analysis of PDEsBoundary (topology)01 natural sciencesMeasure (mathematics)Potential theorySet (abstract data type)Combinatoricsregular treeMathematics - Metric Geometry0103 physical sciencesEuclidean geometryClassical Analysis and ODEs (math.CA)FOS: Mathematics0101 mathematicsMathematicsdensityMathematics::Functional Analysis010102 general mathematicsMetric Geometry (math.MG)Functional Analysis (math.FA)Sobolev spaceMathematics - Functional AnalysisMathematics - Classical Analysis and ODEs010307 mathematical physicsTree (set theory)46E35 30L99funktionaalianalyysiAnalysisboundary traceNewtonian space
researchProduct

Local maximal operators on fractional Sobolev spaces

2016

In this note we establish the boundedness properties of local maximal operators MG on the fractional Sobolev spaces Ws;p(G) whenever G is an open set in Rn, 0 < s < 1 and 1 < p < 1. As an application, we characterize the fractional (s;p)-Hardy inequality on a bounded open set by a Maz'ya-type testing condition localized to Whitney cubes. pq(G) whenever G is an open set in R n , 0 < s < 1 and 1 < p;q <1. Our main focus lies in the mapping properties of MG on a fractional Sobolev space W s;p (G) with 0 < s < 1 and 1 < p < 1, see Section 2 for the denition or (3) for a survey of this space. The intrinsically dened function space W s;p (G) on a given domain G coincides with the trace space F s …

Trace spaceFunction spaceGeneral MathematicsOpen setSpace (mathematics)01 natural sciencesDomain (mathematical analysis)CombinatoricsHardy inequality0103 physical sciencesClassical Analysis and ODEs (math.CA)FOS: Mathematics46E350101 mathematicsfractional Sobolev spaceMathematicsMathematics::Functional Analysista111010102 general mathematicsMathematical analysis42B25 46E35 47H99Functional Analysis (math.FA)Mathematics - Functional AnalysisSobolev spaceSection (category theory)Mathematics - Classical Analysis and ODEsBounded function47H99010307 mathematical physics42B25local maximal operator
researchProduct

Highly transitive actions of free products

2013

We characterize free products admitting a faithful and highly transitive action. In particular, we show that the group $\PSL_2(\Z)\simeq (\Z/2\Z)*(\Z/3\Z)$ admits a faithful and highly transitive action on a countable set.

Transitive actionHighly transitive actionsMSC: Primary: 20B22 20E06Group Theory (math.GR)01 natural sciencesBaire category Theorem[MATH.MATH-GR]Mathematics [math]/Group Theory [math.GR]CombinatoricsFree products0103 physical sciencesFOS: MathematicsCountable set0101 mathematics20B22MathematicsTransitive relation20E06Group (mathematics)Mathematics::Operator Algebras010102 general mathematics20E06 20B2216. Peace & justiceFree productBaire category theorem010307 mathematical physicsGeometry and TopologyMathematics - Group Theory
researchProduct

Algebraic (2, 2)-transformation groups

2009

This paper contains the more significant part of the article with the same title that will appear in the Volume 12 of Journal of Group Theory (2009). In this paper we determine all algebraic transformation groups $G$, defined over an algebraically closed field $\sf k$, which operate transitively, but not primitively, on a variety $\Omega$, provided the following conditions are fulfilled. We ask that the (non-effective) action of $G$ on the variety of blocks is sharply 2-transitive, as well as the action on a block $\Delta$ of the normalizer $G_\Delta$. Also we require sharp transitivity on pairs $(X,Y)$ of independent points of $\Omega$, i.e. points contained in different blocks.

Transitive relationAlgebra and Number TheoryNaturwissenschaftliche Fakultät -ohne weitere Spezifikation-14L30permutation groupsBlock (permutation group theory)-Group Theory (math.GR)Permutation groupCentralizer and normalizerAction (physics)CombinatoricsFOS: Mathematicsddc:510Variety (universal algebra)Algebraically closed fieldAlgebraic numberMathematics - Group TheoryMathematicsJournal of Group Theory
researchProduct

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…

Transitive relationLogic010102 general mathematics0102 computer and information sciences01 natural sciencesTheoretical Computer ScienceCombinatoricsVariable (computer science)Arts and Humanities (miscellaneous)010201 computation theory & mathematicsHardware and Architecture0101 mathematicsBoolean satisfiability problemSoftwareMathematicsJournal of Logic and Computation
researchProduct

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…

Transitive relationSequenceSettore MAT/06 - Probabilita' E Statistica MatematicaProbabilistic logicSyllogismConditional probability02 engineering and technologyCoherence (philosophical gambling strategy)Imprecise probabilityCombinatoricscoherence conditional events defaults generalized quantifiers imprecise probability.020204 information systems0202 electrical engineering electronic engineering information engineering020201 artificial intelligence & image processingCategorical variableMathematics
researchProduct

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 …

Traveling purchaser problemApplied Mathematics0211 other engineering and technologies021107 urban & regional planning0102 computer and information sciences02 engineering and technology01 natural sciencesUnitary statePurchasing010201 computation theory & mathematicsHomogeneousDiscrete Mathematics and CombinatoricsAlgorithmMathematicsDiscrete Applied Mathematics
researchProduct

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.

Tree rotationBinary treeData_MISCELLANEOUSWeight-balanced treeRandom binary treeComputer Science ApplicationsTheoretical Computer ScienceCombinatoricsBinary search treeGeometry of binary search treesSignal ProcessingTernary search treeRotation (mathematics)Information SystemsMathematicsInformation Processing Letters
researchProduct

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…

Tumor invasionTaxisComputational biologyBiologyMutually exclusive events01 natural sciencesHaptotaxisMultiple taxis and review of modelsRC0254Mathematics - Analysis of PDEsSDG 3 - Good Health and Well-beingCell Behavior (q-bio.CB)Numerical simulationsFOS: MathematicsDiscrete Mathematics and CombinatoricsNonlinear diffusionQA Mathematics0101 mathematicsGlobal existenceQARC0254 Neoplasms. Tumors. Oncology (including Cancer)Genetic heterogeneityInterspecies repellenceApplied Mathematics010102 general mathematicsI-PWCell subpopulationsPhenotypeAC010101 applied mathematicsFOS: Biological sciencesQuantitative Biology - Cell Behavior35Q92 (Primary) 92C17 92C50 (Secondary)Analysis of PDEs (math.AP)Discrete &amp; Continuous Dynamical Systems - B
researchProduct

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.

Unbounded operatorDiscrete mathematicsNumerical AnalysisPure mathematicsAlgebra and Number TheoryApproximation propertyProperty (w)Weyl’s theoremsFredholm operatorSpectrum (functional analysis)Banach spaceProperty (w) Weyl’s theorems Polaroid operatorsFinite-rank operatorOperator theoryBounded operatorPolaroid operatorsDiscrete Mathematics and CombinatoricsGeometry and TopologyMathematicsLinear Algebra and its Applications
researchProduct