相关论文: On The Universality Of Central Loops
Classical circuit complexity characterizes parallel computation in purely combinatorial terms, ignoring the physical constraints that govern real hardware. The standard classes $\mathbf{NC}$, $\mathbf{AC}$, and $\mathbf{TC}$ treat unlimited…
A constant-dimension code (CDC) is a set of subspaces of constant dimension in a common vector space with upper bounded pairwise intersection. We improve and generalize two constructions for CDCs, the improved linkage construction and the…
Let $\mathcal{F} $ be a pointwise almost periodic decomposition of a compact metrizable space $X$. Then $\mathcal{F} $ is $R$-closed if and only if $\hat{\mathcal{F}} $ is usc. Moreover, if there is a finite index normal subgroup $H$ of an…
An equilibrium of a planar, piecewise-$C^1$, continuous system of differential equations that crosses a curve of discontinuity of the Jacobian of its vector field can undergo a number of discontinuous or border-crossing bifurcations. Here…
A ring R is called an E-ring if the canonical homomorphism from R to the endomorphism ring End(R_Z) of the additive group R_Z, taking any r in R to the endomorphism left multiplication by r turns out to be an isomorphism of rings. In this…
We consider a simple random walk (dimension one, nearest neighbour jumps) in a quenched random environment. The goal of this work is to provide sufficient conditions, stated in terms of properties of the environment, under which the Central…
An associative ring $R$ with identity is left pseudo-morphic if for every $a$$\in$$R$, there exists $b$$\in$$R$ such that $Ra=l_R(b)$. If, in addition, $l_R(a)=Rb$, then $R$ is called left morphic. $R$ is morphic if it is both left and…
A theorem is presented on existence and uniqueness up to the topological *-isomorphism of universal locally C*-algebra for an arbitrary locally JB-algebra.
Let $(X_i)_{i \geq 1}$ and $(Y_i)_{i\geq1}$ be two independent sequences of independent identically distributed random variables taking their values in a common finite alphabet and having the same law. Let $LC_n$ be the length of the…
Rectangular diagrams of links are link diagrams in the plane ${\mathbb R}^2$ such that they are composed of vertical line segments and horizontal line segments and vertical segments go over horizontal segments at all crossings. P. R.…
The decomposition theorem for torsion abelian groups holds analogously for torsion commutative diassociative loops. With this theorem in mind, we investigate commutative diassociative loops satisfying the additional condition (trivially…
Betweenness centrality is a centrality measure based on the overall amount of shortest paths passing through a given vertex. A graph is betweenness-uniform if all its vertices have the same betweenness centrality. We study the properties of…
A function $f:\{0,...,q-1\}^n\to\{0,...,q-1\}$ invertible in each argument is called a latin hypercube. A collection $(\pi_0,\pi_1,...,\pi_n)$ of permutations of $\{0,...,q-1\}$ is called an autotopism of a latin hypercube $f$ if…
Given any $\epsilon >0$ and any planar region $\Omega$ bounded by a simple n-gon $P$ we construct a ($1 + \epsilon)$-quasiconformal map between $\Omega$ and the unit disk in time $C(\epsilon)n$. One can take $ C(\epsilon) = C + C \log…
We present a new proof of the necessary and sufficient condition for the existence of a triangle that is simultaneously inscribed in a circle and circumscribed about a central conic (an ellipse or a hyperbola). In the limiting case where…
An important task in trajectory analysis is clustering. The results of a clustering are often summarized by a single representative trajectory and an associated size of each cluster. We study the problem of computing a suitable…
We consider the entanglement between two one-dimensional quantum wires (Luttinger Liquids) coupled by tunneling through a quantum impurity. The physics of the system involves a crossover between weak and strong coupling regimes…
A group $G$ is called logically cyclic, if it contains an element $s$ such that every element of $G$ can be defined by a first order formula with parameter $s$. The aim of this paper is to investigate the structure of such groups.
Let $R$ be a ring with unity. The upper ideal relation graph $\Gamma_U(R)$ of the ring $R$ is a simple undirected graph whose vertex set is the set of all non-unit elements of $R$ and two distinct vertices $x, y$ are adjacent if and only if…
Universal cycles are generalizations of de Bruijn cycles and Gray codes that were introduced originally by Chung, Diaconis, and Graham in 1990. They have been developed by many authors since, for various combinatorial objects such as…