Search results for "combinatoric"

showing 10 items of 1776 documents

Polskie nazwy miejscowości z sufiksem -at-ka

2017

The article analyses Polish oikonyms ending in -atka, discussing whether this ending is a suffix, i.e. -at-ka, or simply appears to be one. Based on the method of morphological division, the findings suggest the existence of two distinctive groups of oikonyms: those with the suffix -at-ka, and those with three extended variants of this suffix: -ow-at-ka, -aw-at-ka and -ew-at-ka.

CombinatoricsLinguistics and LanguageSuffixDivision (mathematics)Language and LinguisticsMathematicsOnomastica
researchProduct

On Certain Metrizable Locally Convex Spaces

1986

Publisher Summary This chapter discusses on certain metrizable locally convex spaces. The linear spaces used are defined over the field IK of real or complex numbers. The word "space" will mean "Hausdorff locally convex space". This chapter presents a proposition which states if U be a neighborhood of the origin in a space E. If A is a barrel in E which is not a neighborhood of the origin and F is a closed subspace of finite codimension in E’ [σ(E’,E)], then U° ∩ F does not contain A° ∩ F. Suppose that U° ∩ F contain A° ∩ F. Then A° ∩ F is equicontinuous hence W is also equicontinuous. Since W° is contained in A, it follows that A is a neighborhood of the origin, a contradiction.

CombinatoricsLocally convex topological vector spaceMetrization theoremConvex setHausdorff spaceMathematics::General TopologyField (mathematics)CodimensionSpace (mathematics)EquicontinuityMathematics
researchProduct

Finite groups which are products of pairwise totally permutable subgroups

1998

Finite groups which are products of pairwise totally permutable subgroups are studied in this paper. The -residual, -projectors and -normalizers in such groups are obtained from the corresponding subgroups of the factor subgroups under suitable hypotheses.

CombinatoricsLocally finite groupGeneral MathematicsPairwise comparisonPermutable primeResidualMathematicsProceedings of the Edinburgh Mathematical Society
researchProduct

On 2-groups with no abelian subgroups of rank four

1975

CombinatoricsLocally finite groupGeneral MathematicsRank (graph theory)Abelian groupRank of an abelian groupMathematicsMathematische Zeitschrift
researchProduct

Wedge filling and interface delocalization in finite Ising lattices with antisymmetric surface fields

2003

Theoretical predictions by Parry et al. for wetting phenomena in a wedge geometry are tested by Monte Carlo simulations. Simple cubic $L\ifmmode\times\else\texttimes\fi{}L\ifmmode\times\else\texttimes\fi{}{L}_{y}$ Ising lattices with nearest neighbor ferromagnetic exchange and four free $L\ifmmode\times\else\texttimes\fi{}{L}_{y}$ surfaces, at which antisymmetric surface fields $\ifmmode\pm\else\textpm\fi{}{H}_{s}$ act, are studied for a wide range of linear dimensions $(4l~Ll~320,30l~{L}_{y}l~1000),$ in an attempt to clarify finite size effects on the wedge filling transition in this ``double-wedge'' geometry. Interpreting the Ising model as a lattice gas, the problem is equivalent to a li…

CombinatoricsMagnetizationCondensed matter physicsFerromagnetismTransition temperatureLattice (order)Periodic boundary conditionsIsing modelInverse functionCubic crystal systemMathematicsPhysical Review E
researchProduct

Convergence of Markov Chains

2020

We consider a Markov chain X with invariant distribution π and investigate conditions under which the distribution of X n converges to π as n→∞. Essentially it is necessary and sufficient that the state space of the chain cannot be decomposed into subspaces that the chain does not leave, or that are visited by the chain periodically; e.g., only for odd n or only for even n.

CombinatoricsMarkov chain mixing timeMarkov chainChain (algebraic topology)Markov renewal processBalance equationAdditive Markov chainMarkov propertyExamples of Markov chainsMathematics
researchProduct

Maslov Anomaly and the Morse Index Theorem

2001

Our starting point is again the phase space integral $$\displaystyle{ \text{e}^{\text{i}\hat{\varGamma }[\tilde{M}]} =\int \mathcal{D}\chi ^{a}\,\text{e}^{\text{i}S_{\text{fl}}[\chi,\tilde{M}]} }$$ (31.1) with periodic boundary conditions χ(0) = χ(T) and $$\displaystyle{ S_{\text{fl}}[\chi,\tilde{M}] = \frac{1} {2}\int _{0}^{T}dt\,\bar{\chi }_{ a}(t)\left [ \frac{\partial } {\partial t} -\tilde{M}(t)\right ]_{\phantom{a}b}^{a}\chi ^{b}(t)\;. }$$ (31.2) Here we have indicated that Sfl and \(\hat{\varGamma }\) depend on ηcl a and A i only through \(\tilde{M}_{\phantom{a}b}^{a}\): $$\displaystyle{ \tilde{M}(t)_{\phantom{a}b}^{a} =\omega ^{ac}\partial _{ c}\partial _{b}\mathcal{H}{\bigl (\eta _…

CombinatoricsMathematical analysisAnomaly (physics)Atiyah–Singer index theoremOmegaMathematics
researchProduct

Orientation matters

2008

The optimal communication spanning tree (OCST) problem is a well known $\mathcal{NP}$-hard combinatorial optimization problem which seeks a spanning tree that satisfies all given communication requirements for minimal total costs. It has been shown that optimal solutions of OCST problems are biased towards the much simpler minimum spanning tree (MST) problem. Therefore, problem-specific representations for EAs like heuristic variants of edge-sets that are biased towards MSTs show high performance.In this paper, additional properties of optimal solutions for Euclidean variants of OCST problems are studied. Experimental results show that not only edges in optimal trees are biased towards low-…

CombinatoricsMathematical optimizationSpanning treeHeuristicCrossoverEvolutionary algorithmGraph (abstract data type)Orientation (graph theory)Minimum spanning treeHeuristicsMathematicsofComputing_DISCRETEMATHEMATICSMathematicsProceedings of the 10th annual conference on Genetic and evolutionary computation
researchProduct

Optional Sampling Sätze

2020

In Kapitel 9 haben wir den Stabilitatssatz fur Martingale kennengelernt, der besagt, dass Martingale durch die Anwendung gewisser Spielstrategien wieder in Martingale uberfuhrt werden. Wir untersuchen in diesem Kapitel ahnliche Stabilitatseigenschaften fur zufallig gestoppte Martingale zeigen. Um die Aussagen auch fur Submartingale und Supermartingale zu bekommen, geben wir im ersten Abschnitt einen Zerlegungssatz fur adaptierte Prozesse an. Im zweiten Abschnitt kommen dann die Optional Sampling und Optional Stopping Satze.

CombinatoricsMathematics
researchProduct

Nullstellen bei Lösungen der Differentialgleichung y(n) + gy(n−1)+ fy = 0

1990

CombinatoricsMathematics (miscellaneous)Applied MathematicsMathematicsResults in Mathematics
researchProduct