Related papers: A product chain without cutoff
The first examples of noncrossed product division algebras were given by Amitsur in 1972. His method is based on two basic steps: (1) If the universal division algebra $U(k,n)$ is a $G$-crossed product then every division algebra of degree…
We consider problems of dimensionality reduction and learning data representations for continuous spaces with two or more independent degrees of freedom. Such problems occur, for example, when observing shapes with several components that…
Posets which are retract of products of chains are characterized by means of two properties: \emph{the chain-gap property} and \emph{the selection property} (Rival and Wille, 1981 \cite {R-W}). Examples of posets with the selection property…
In this note we determine all possible dominations between different products of manifolds, when none of the factors of the codomain is dominated by products. As a consequence, we determine the finiteness of every product-associated…
We prove that, for any type III$_1$ free product factor, its continuous core is full if and only if its $\tau$-invariant is the usual topology on the real line. This trivially implies, as a particular case, the same result for free…
Let X and Y be infinite graphs, such that the automorphism group of X is nonamenable, and the automorphism group of Y has an infinite orbit. We prove that there is no automorphism-invariant measure on the set of spanning trees in the direct…
A graph class $\mathcal{G}$ admits product structure if there exists a constant $k$ such that every $G \in \mathcal{G}$ is a subgraph of $H \boxtimes P$ for a path $P$ and some graph $H$ of treewidth $k$. Famously, the class of planar…
We give two combinatorial proofs of an elegant product formula for the number of spanning trees of the $n$-dimensional hypercube. The first proof is based on the assertion that if one chooses a uniformly random rooted spanning tree of the…
This paper introduces an inner product on chain complexes of finite simplicial complexes that is well-adapted to the harmonic study of subdivisions. Its definition utilizes a decomposition of the chain spaces that suggests a sequence of…
A cyclic proof system is a proof system whose proof figure is a tree with cycles. The cut-elimination in a proof system is fundamental. It is conjectured that the cut-elimination in the cyclic proof system for first-order logic with…
A homomorphism from a completely metrizable topological group into a free product of groups whose image is not contained in a factor of the free product is shown to be continuous with respect to the discrete topology on the range. In…
An unsplittable multiflow routes the demand of each commodity along a single path from its source to its sink node. As our main result, we prove that in series-parallel digraphs, any given multiflow can be expressed as a convex combination…
There are infinite processes (matrix products, continued fractions, $(r,s)$-matrix continued fractions, recurrence sequences) which, under certain circumstances, do not converge but instead diverge in a very predictable way. We give a…
We survey the extensions of a group by a group using crossed products instead of exact sequences of groups. The approach has various advantages, one of them being that the crossed product is an universal object. Several new applications are…
We extend decision tree and random forest algorithms to product space manifolds: Cartesian products of Euclidean, hyperspherical, and hyperbolic manifolds. Such spaces have extremely expressive geometries capable of representing many…
A construction of product measures is given for an arbitrary sequence of measure spaces via outer measure techniques without imposing any condition on the underlying measure spaces. This approach concludes finally the problem of the…
The notion of noncrossing linked partition arose from the study of certain transforms in free probability theory. It is known that the number of noncrossing linked partitions of [n+1] is equal to the n-th large Schroder number $r_n$, which…
We construct a countable infinite graph G that does not contain cycles of length four having the property that the sequence of graphs $G_n$ induced by the first $n$ vertices has minimum degree $\delta(G_n)> n^{\sqrt{2}-1+o(1)}$.
A one dimensional XX spin chain of finite length coupled to reservoirs at both ends is solved exactly in terms of a matrix product state ansatz. An explicit representation of matrices of fixed dimension 4 independent of the chain length is…
Given two graphs, a mapping between their edge-sets is cycle-continuous, if the preimage of every cycle is a cycle. The motivation for this notion is Jaeger's conjecture that for every bridgeless graph there is a cycle-continuous mapping to…