Search results for "Crete"

showing 10 items of 2495 documents

A Loopless Generation of Bitstrings without p Consecutive Ones

2001

Let F n (p) be the set of all n-length bitstrings such that there are no p consecutive ls. F n (p) is counted with the pth order Fibonacci numbers and it may be regarded as the subsets of {1, 2,…, n} without p consecutive elements and bitstrings in F n (p) code a particular class of trees or compositions of an integer. In this paper we give a Gray code for F n (p) which can be implemented in a recursive generating algorithm, and finally in a loopless generating algorithm.

CombinatoricsGray codeSet (abstract data type)Discrete mathematicssymbols.namesakeCode (set theory)Fibonacci numberBinary treeIntegersymbolsOrder (group theory)Hamiltonian pathMathematics
researchProduct

On Fine and Wilf's theorem for bidimensional words

2003

AbstractGeneralizations of Fine and Wilf's Periodicity Theorem are obtained for the case of bidimensional words using geometric arguments. The domains considered constitute a large class of convex subsets of R2 which include most parallelograms. A complete discussion is provided for the parallelogram case.

CombinatoricsLarge classDiscrete mathematicsGeneral Computer ScienceGeneralizationRegular polygonParallelogramWord (group theory)MathematicsTheoretical Computer ScienceComputer Science(all)Theoretical Computer Science
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

On closures of discrete sets

2018

The depth of a topological space $X$ ($g(X)$) is defined as the supremum of the cardinalities of closures of discrete subsets of $X$. Solving a problem of Mart\'inez-Ruiz, Ram\'irez-P\'aramo and Romero-Morales, we prove that the cardinal inequality $|X| \leq g(X)^{L(X) \cdot F(X)}$ holds for every Hausdorff space $X$, where $L(X)$ is the Lindel\"of number of $X$ and $F(X)$ is the supremum of the cardinalities of the free sequences in $X$.

CombinatoricsMathematics (miscellaneous)Cardinal invariants Lindelof space Discrete set Elementary submodel CellularityGeneral Topology (math.GN)FOS: MathematicsHausdorff spaceMathematics::General TopologySettore MAT/03 - GeometriaTopological spaceDiscrete setInfimum and supremumMathematics - General TopologyMathematics
researchProduct

The case of equality in the dichotomy of Mohammadi–Oh

2019

If $n \geq 3$ and $\Gamma$ is a convex-cocompact Zariski-dense discrete subgroup of $\mathbf{SO}^o(1,n+1)$ such that $\delta_\Gamma=n-m$ where $m$ is an integer, $1 \leq m \leq n-1$, we show that for any $m$-dimensional subgroup $U$ in the horospheric group $N$, the Burger-Roblin measure associated to $\Gamma$ on the quotient of the frame bundle is $U$-recurrent.

CombinatoricsMathematics::Group TheoryIntegerDiscrete groupGroup (mathematics)Astrophysics::High Energy Astrophysical PhenomenaApplied MathematicsErgodicityGeometry and TopologyMeasure (mathematics)Frame bundleQuotientMathematicsJournal of Fractal Geometry
researchProduct

Explicit Measure Computations for Simplicial Trees and Graphs of Groups

2019

In this chapter, we compute skinning measures and Bowen{Margulis measures for some highly symmetric simplicial trees X endowed with a nonelementary discrete subgroup Г of Aut(X).

CombinatoricsMathematics::Group TheorySkinningMathematics::Dynamical SystemsDiscrete groupComputationMeasure (mathematics)Mathematics
researchProduct

Random Walks on Weighted Graphs of Groups

2019

Let X be a locally finite simplicial tree without terminal vertices, and let X = ∣X∣1 be its geometric realisation. Let Γ be a nonelementary discrete subgroup of Aut(X).

CombinatoricsMathematics::Group TheoryTree (descriptive set theory)Terminal (electronics)Discrete groupRealisationRandom walkMathematics
researchProduct

On the lattice of J-subnormal subgroups

1992

CombinatoricsMiller indexReciprocal latticeParticle in a one-dimensional latticeAlgebra and Number TheoryLattice constantLattice planeEmpty lattice approximationHexagonal latticeLattice (discrete subgroup)MathematicsJournal of Algebra
researchProduct

On the Deskins index complex of a maximal subgroup of a finite group

1999

AbstractLet M be a maximal subgroup of a finite group G. A subgroup C of G is said to be a completion of M in G if C is not contained in M while every proper subgroup of C which is normal in G is contained in M. The set, I(M), of all completions of M is called the index complex of M in G. Set P(M) = {C ϵ I(M) ¦ C} is maximal in I(M) and G = CM. The purpose of this note is to prove: A finite group G is solvable if and only if, for each maximal subgroup M of G, P(M) contains element C with CK(C) nilpotent.

CombinatoricsNormal subgroupDiscrete mathematicsMathematics::Group TheoryNilpotentFinite groupMaximal subgroupAlgebra and Number TheorySubgroupIndex of a subgroupSubgroup CMathematicsJournal of Pure and Applied Algebra
researchProduct

The Bourgain property and convex hulls

2007

Let (Ω, Σ, μ) be a complete probability space and let X be a Banach space. We consider the following problem: Given a function f: Ω X for which there is a norming set B ⊂ BX * such that Zf,B = {x * ○ f: x * ∈ B } is uniformly integrable and has the Bourgain property, does it follow that f is Birkhoff integrable? It turns out that this question is equivalent to the following one: Given a pointwise bounded family ℋ ⊂ ℝΩ with the Bourgain property, does its convex hull co(ℋ) have the Bourgain property? With the help of an example of D. H. Fremlin, we make clear that both questions have negative answer in general. We prove that a function f: Ω X is scalarly measurable provided that there is a n…

CombinatoricsPointwiseDiscrete mathematicsConvex hullGeneral MathematicsBounded functionRegular polygonBanach spaceContinuum (set theory)Function (mathematics)Separable spaceMathematicsMathematische Nachrichten
researchProduct