Search results for "Finite set"

showing 10 items of 101 documents

Optimal Locations and Inner Products

1997

Abstract In a normed space X , we consider objective functions which depend on the distances between a variable point and the points of certain finite sets A . A point where such a function attains its minimum on X is generically called an optimal location. In this paper we obtain characterizations of inner product spaces with properties connecting optimal locations and the convex hull of A or barycenters of points of A with well chosen weights. We thus generalize several classical results about characterization of inner product spaces.

CombinatoricsConvex hullInner product spaceApplied MathematicsMathematical analysisPoint (geometry)Function (mathematics)Characterization (mathematics)Finite setAnalysisNormed vector spaceVariable (mathematics)MathematicsJournal of Mathematical Analysis and Applications
researchProduct

Coding Partitions: Regularity, Maximality and Global Ambiguity

2007

The canonical coding partition of a set of words is the finest partition such that the words contained in at least two factorizations of a same sequence belong to a same class. In the case the set is not uniquely decipherable, it partitions the set into one unambiguous class and other parts that localize the ambiguities in the factorizations of finite sequences. We firstly prove that the canonical coding partition of a regular set contains a finite number of regular classes. We give an algorithm for computing this partition. We then investigate maximality conditions in a coding partition and we prove, in the regular case, the equivalence between two different notions of maximality. As an ap…

CombinatoricsDiscrete mathematicsFormal languagesinformation ratemedia_common.quotation_subjectPartition (number theory)AmbiguityPartition of a setFinite automataFinite setCoding (social sciences)media_commonMathematics
researchProduct

Extensions of cocycles for hyperfinite actions and applications

1997

Given a countable, hyperfinite, ergodic and measure-preserving equivalence relationR on a standard probability space (X, ℬ, μ) and an elementW of the normalizerN (R) ofR, we investigate the problem of extendingR-cocycles to\(\bar R\), where\(\bar R\) is the relation generated byR andW. As an application, we obtain that for a Bernoulli automorphism the smallest family of natural factors in sense of [6] consists of all factors. Given an automorphism which is embeddable in a measurable flow and a compact, metric group, we show that for a typical cocycle we cannot lift the whole flow to the centralizer of the corresponding group extension.

CombinatoricsGroup extensionGeneral MathematicsErgodic theoryCountable setStandard probability spaceAutomorphismEquivalence (measure theory)Hyperfinite setCentralizer and normalizerMathematicsMonatshefte für Mathematik
researchProduct

4-Manifold topology I: Subexponential groups

1995

The technical lemma underlying the 5-dimensional topological s-cobordism conjecture and the 4-dimensional topological surgery conjecture is a purely smooth category statement about locating ~-null immersions of disks. These conjectures are theorems precisely for those fundamental groups ("good groups") where the ~l-null disk lemma (NDL) holds. We expand the class of known good groups to all groups of subexponential growth and those that can be formed from these by a finite number of application of two opera- tions: (1) extension and (2) direct limit. The finitely generated groups in this class are amenable and no amenable group is known to lie outside this class.

CombinatoricsLemma (mathematics)4-manifoldConjectureGeneral MathematicsAmenable groupCobordismDirect limitTopologyFinite setGroup theoryMathematicsInventiones Mathematicae
researchProduct

A generalization of Sardinas and Patterson's algorithm to z-codes

1993

Abstract This paper concerns the framework of z-codes theory. The main contribution consists in an extension of the algorithm of Sardinas and Patterson for deciding whether a finite set of words X is a z-code. To improve the efficiency of this test we have found a tight upper bound on the length of the shortest words that might have a double z-factorization over X. Some remarks on the complexity of the algorithm are also given. Moreover, a slight modification of this algorithm allows us to compute the z-deciphering delay of X.

CombinatoricsSardinas–Patterson algorithmGeneral Computer ScienceGeneralizationCode (cryptography)Extension (predicate logic)Finite setUpper and lower boundsAlgorithmComputer Science(all)Theoretical Computer ScienceMathematicsAutomatonTheoretical Computer Science
researchProduct

The Equationally-Defined Commutator in Quasivarieties Generated by Two-Element Algebras

2018

The notion of the equationally-defined commutator was introduced and thoroughly investigated in (Czelakowski, 2015). In this work the properties of the equationally-defined commutator in quasivarieties generated by two-element algebras are examined. It is proved: If a quasivariety Q is generated by a finite set of two-element algebras, then the equationally-defined commutator of Q is additive (Theorem 3.1) Moreover it satisfies the associativity law (Theorem 3.6). The second result is strengthened if the quasivariety is generated by a single two-element algebra 2: If Q = SP(2), then the equationally-defined commutator of Q universally validates one of the following laws: [x,y] = x^y or [x,y…

CommutatorPure mathematicsQuasivariety010102 general mathematicsCharacterization (mathematics)01 natural sciencesCongruence (geometry)0103 physical sciences010307 mathematical physics0101 mathematicsAbelian groupElement (category theory)Finite setAssociative propertyMathematics
researchProduct

Elementary Newtonian Mechanics

2010

This chapter deals with the kinematics and the dynamics of a finite number of mass points that are subject to internal, and possibly external, forces, but whose motions are not further constrained by additional conditions on the coordinates. Constraints such as requiring some mass points to follow given curves in space, to keep their relative distance fixed, or the like, are introduced in Chap. 2. Unconstrained mechanical systems can be studied directly by means of Newton’s equations and do not require the introduction of new, generalized coordinates that incorporate the constraints and are dynamically independent. This is what is meant by “elementary” in the heading of this chapter — thoug…

Conservation lawClassical mechanicsGeneralized coordinatesInertial frame of referenceCentral forceKinematicsFinite setConstructiveAnalytical dynamics
researchProduct

A new approximation procedure for fractals

2003

AbstractThis paper is based upon Hutchinson's theory of generating fractals as fixed points of a finite set of contractions, when considering this finite set of contractions as a contractive set-valued map.We approximate the fractal using some preselected parameters and we obtain formulae describing the “distance” between the “exact fractal” and the “approximate fractal” in terms of the preselected parameters. Some examples and also computation programs are given, showing how our procedure works.

ContractionComputationNumerical analysisApplied MathematicsMathematical analysisAttractorHausdorff–Pompeiu distanceFixed pointFixed pointComputational MathematicsFractalNumerical approximationAttractorApproximation procedureFractalFinite setMathematicsJournal of Computational and Applied Mathematics
researchProduct

On dependence of sets of functions on the mean value of their elements

2009

The paper considers, for a given closed bounded set M ⊂ R m and K = (0,1) n ⊂ R n , the set M = {h ϵ L2 (K;R m ) | h(x) ϵ M a.e.x ϵ K} and its subsets It is shown that, if a sequence {hk } ⊂ coM converges to an element hk ϵ M(hk ) there is h‘k ϵ M(ho ) such that h'k - hk → 0 as k → ∞ . If, in addition, the set M is finite or M is the convex hull of a finite set of elements, then the multivalued mapping h → M(h) is lower semicontinuous on coM. First published online: 14 Oct 2010

Convex hullDiscrete mathematicsSequenceBounded setMean valuemultivalued mappingsubsets of functions with fixed mean valueModeling and Simulationcontinuous dependenceQA1-939Element (category theory)Finite setAnalysisMathematicsMathematicsMathematical Modelling and Analysis
researchProduct

Generalized finite difference schemes with higher order Whitney forms

2021

Finite difference kind of schemes are popular in approximating wave propagation problems in finite dimensional spaces. While Yee’s original paper on the finite difference method is already from the sixties, mathematically there still remains questions which are not yet satisfactorily covered. In this paper, we address two issues of this kind. Firstly, in the literature Yee’s scheme is constructed separately for each particular type of wave problem. Here, we explicitly generalize the Yee scheme to a class of wave problems that covers at large physics field theories. For this we introduce Yee’s scheme for all problems of a class characterised on a Minkowski manifold by (i) a pair of first ord…

Differential equationDifferential formsähkömagnetismiFirst-order partial differential equationdifferential formselectromagnetism010103 numerical & computational mathematics01 natural sciencesdifferentiaaligeometriaMinkowski spaceApplied mathematicsdifferential geometry0101 mathematicsFinite setfinite difference methodMathematicsNumerical AnalysisSpacetimeApplied MathematicsFinite difference methodFinite differencevector-valued formswhitney forms010101 applied mathematicsComputational MathematicsModeling and Simulationelasticityco-vector valued formsAnalysisESAIM: Mathematical Modelling and Numerical Analysis
researchProduct