Related papers: On the normal cycles of subanalytic sets
For a symmetric 2t-cycle in the tope graph of a simple oriented matroid M on the ground set {1,...,t}, where t is even, we describe decompositions of topes and subtopes of M with respect to the subtopes corresponding to the edges of the…
We generalise a fundamental graph-theoretical fact, stating that every element of the cycle space of a graph is a sum of edge-disjoint cycles, to arbitrary continua. To achieve this we replace graph cycles by topological circles, and…
We develop an axiomatic set theory -- the Theory of Hyperfinite Sets THS, which is based on the idea of existence of proper subclasses of big finite sets. We demonstrate how theorems of classical continuous mathematics can be transfered to…
In this m\'emoire we study quasiperiodic cocycles in semi-simple compact Lie groups. For the greatest part of our study, we will focus ourselves to one-frequency cocyles. We will prove that $C^{\infty}$ reducible cocycles are dense in the…
The compactness phenomenon is one of the featured aspects of structuralism in mathematics. In simple and broad words, a compactness property holds in a structure if a related property is satisfied by sufficiently many substructures of that…
The Tits core G^+ of a totally disconnected locally compact group G is defined as the abstract subgroup generated by the closures of the contraction groups of all its elements. We show that a dense subgroup is normalised by the Tits core if…
For any dynamical system $T:X\rightarrow X$ of a compact metric space $X$ with $g-$almost product property and uniform separation property, under the assumptions that the periodic points are dense in $X$ and the periodic measures are dense…
In 2003, Bohman, Frieze, and Martin initiated the study of randomly perturbed graphs and digraphs. For digraphs, they showed that for every $\alpha>0$, there exists a constant $C$ such that for every $n$-vertex digraph of minimum…
This paper provides a unified framework connecting dynamical systems with tools from topological data analysis and geometric topology and inspires new interactions among dynamical systems, topology, and nonlinear analysis. To this end, we…
We prove, assuming Souslin's Hypothesis, that each uncountable subspace of each zero-dimensional monotonically normal compact space contains an uncountable subset of the real line with either the metric, the Sorgenfrey, or the discrete…
Proof-theoretic methods are developed for subsystems of Johansson's logic obtained by extending the positive fragment of intuitionistic logic with weak negations. These methods are exploited to establish properties of the logical systems.…
We study the evolution, under convex Hamiltonian flows on cotangent bundles of compact manifolds, of certain distinguished subsets of the phase space. These subsets are generalizations of Lagrangian graphs, we call them pseudographs. They…
A real semisimple Lie group G_0 embedded in its complexification G has only finitely many orbits in any G-fag manifold Z = G/Q. The complex geometry of its open orbits D (flag domains) is studied from the point of view of compact complex…
A connected digraph in which the in-degree of any vertex equals its out-degree is Eulerian, this baseline result is used as the basis of existence proofs for universal cycles (also known as generalized deBruijn cycles or U-cycles) of…
We give a new short proof for the uniqueness of the universal minimal space. The proof holds for the uniqueness of the universal object in every collection of topological dynamical systems closed under taking projective limits and…
A connected digraph in which the in-degree of any vertex equals its out-degree is Eulerian; this baseline result is used as the basis of existence proofs for universal cycles (also known as deBruijn cycles or $U$-cycles) of several…
We show that there is a bijection between the renormalizations and proper completely invariant closed sets of expanding Lorenz map, which enable us to distinguish periodic and non-periodic renormalizations. Based on the properties of…
A loose Hamilton cycle in a hypergraph is a cyclic sequence of edges covering all vertices in which only every two consecutive edges intersect and do so in exactly one vertex. With Dirac's theorem in mind, it is natural to ask what minimum…
The class of $\mu$-compact sets can be considered as a natural extension of the class of compact metrizable subsets of locally convex spaces, to which the particular results well known for compact sets can be generalized. This class…
We define a simple graph as compact if it lacks even cycles and satisfies the odd-cycle condition. Our focus is on classifying all compact graphs and examining the characteristics of their edge rings. Let $G$ be a compact graph and…