Related papers: Splitting chains, tunnels and twisted sums
Let $(x_n)$ be a sequence in a Banach space $X$ which does not converge in norm, and let $E$ be an isomorphically precisely norming set for $X$ such that \[ \sum_n |x^*(x_{n+1}-x_n)|< \infty, \; \forall x^* \in E. \qquad (*) \] Then there…
In this Phd. thesis, a structural analysis of construction schemes is developed. The importance of this study will be justified by constructing several distinct combinatorial objects which have been of great interest in mathematics. We then…
We investigate sigma-entangled linear orders and narrowness of Boolean algebras. We show existence of sigma-entangled linear orders in many cardinals, and we build Boolean algebras with neither large chains nor large pies. We study the…
A special type of binomial splitting process is studied. Such a process can be used to model a high-dimensional corner parking problem, as well as the depth of random PATRICIA tries (a special class of digital tree data structures). The…
The splitting algorithms of monotone operator theory find zeros of sums of relations. This corresponds to solving series or parallel one-port electrical circuits, or the negative feedback interconnection of two subsystems. One-port circuits…
We compute the dispersion laws of chaotic periodic systems using the semiclassical periodic orbit theory to approximate the trace of the powers of the evolution operator. Aside from the usual real trajectories, we also include complex…
Given a map $f \colon E \longrightarrow F$ between Banach spaces (or Banach lattices), a set $A$ of $E$-valued bounded sequences, ${\bf x} \in A$ and a vector topology $\tau$ on $F$, we investigate the existence of an infinite dimensional…
The study of substructures in random objects has a long history, beginning with Erd\H{o}s and R\'enyi's work on subgraphs of random graphs. We study the existence of certain substructures in random subsets of vector spaces over finite…
Suppose that $(x_s)_{s\in S}$ is a normalized family in a Banach space indexed by the dyadic tree $S$. Using Stern's combinatorial theorem we extend important results from sequences in Banach spaces to tree-families. More precisely,…
We study spaces of realisations of linkages (weighted graphs) whose underlying graph is a series parallel graph. In particular, we describe an algorithm for determining whether or not such spaces are connected.
The double-well potential is a good example, where we can compute the splitting in the bound state energy of the system due to the tunneling effect with various methods, namely WKB or instanton calculations. All these methods are…
The splitting-off operation in undirected graphs is a fundamental reduction operation that detaches all edges incident to a given vertex and adds new edges between the neighbors of that vertex while preserving their degrees. Lov\'asz (1974)…
We prove that if there exists a simplified $(\omega_1,2)$-morass, then there is a ccc forcing which adds an $\omega_3$-chain in P($\omega_1$) mod finite and a ccc forcing which adds a family of $\omega_3$-many strongly almost disjoint…
The idea of slicing divergences has been proven to be successful when comparing two probability measures in various machine learning applications including generative modeling, and consists in computing the expected value of a `base…
This paper describes a process for clustering concepts into chains from data presented randomly to an evaluating system. There are a number of rules or guidelines that help the system to determine more accurately what concepts belong to a…
We prove `twisted' versions of Kirchhoff's network theorem and Kirchhoff's matrix-tree theorem on connected finite graphs. Twisting here refers to chains with coefficients in a flat unitary line bundle.
Analysis of higher-order organizations, usually small connected subgraphs called motifs, is a fundamental task on complex networks. This paper studies a new problem of testing higher-order clusterability: given query access to an undirected…
We consider problems concerning the partial order structure of the set of spreading models of Banach spaces. We construct examples of spaces showing that the possible structure of these sets include certain classes of finite semi-lattices…
We show in ZFC that the existence of completely separable maximal almost disjoint families of subsets of $\omega$ implies that the modal logic S4.1.2 is complete with respect to the \v{C}ech-Stone compactification of the natural numbers,…
The paper deals with ring extensions $R\subseteq S$ and their lattices $[R,S]$ of subextensions and is mainly devoted to FCP extensions (extensions whose lattices are Artinian and Noetherian). The object of the paper is the introduction and…