相关论文: Minimal elements of stopping time $\sigma$-algebra…
A program is a finite piece of data that produces a (possibly infinite) sequence of primitive instructions. From scratch we develop a linear notation for sequential, imperative programs, using a familiar class of primitive instructions and…
We give an operator space characterization of subalgebras of $C(\Omega,M_n)$. We also describe injective subspaces of $C(\Omega,M_n)$ and then give applications to sub-TROs of $C(\Omega,M_n)$. Finally, we prove an `$n$-minimal version' of…
A minimal system of homogeneous generating elements of the algebra of covariants for the binary form of degree 8 is calculated.
A physical applicability of normed split-algebras, such as hyperbolic numbers, split-quaternions and split-octonions is considered. We argue that the observable geometry can be described by the algebra of split-octonions. In such a picture…
In this paper, we define a special class of elements in the algebras obtained by the Cayley Dickson process, called l elements. We find conditions such that these elements to be invertible. These conditions can be very useful for finding…
We give a short and elementary proof that the first hitting time of an open set by the jump process of a c\`adl\`ag adapted process is a stopping time.
Given two permutations $\sigma$ and $\pi$, the \textsc{Permutation Pattern} problem asks if $\sigma$ is a subpattern of $\pi$. We show that the problem can be solved in time $2^{O(\ell^2\log \ell)}\cdot n$, where $\ell=|\sigma|$ and…
We extend the definition of algebraic entropy to a class of differential-delay equations. The vanishing of the entropy, as a structural property of an equation, signals its integrability. We suggest a simple way to produce…
We consider cylindrical algebraic decompositions (CADs) as a tool for representing semi-algebraic subsets of $\mathbb{R}^n$. In this framework, a CAD $\mathscr{C}$ is adapted to a given set $S$ if $S$ is a union of cells of $\mathscr{C}$.…
The paper examines machines of the type of the $\Gamma$-spaces of Segal which describe homotopy structures on topological spaces. The main result of the paper shows that for any such machine one can find an algebraic theory characterizing…
In the paper we study what sets can be obtained as $\alpha$-limit sets of backward trajectories in graph maps. We show that in the case of mixing maps, all those $\alpha$-limit sets are $\omega$-limit sets and for all but finitely many…
Small representations of a group bring us to large symmetries in a representation space. Analysis on minimal representations utilises large symmetries in their geometric models, and serves as a driving force in creating new interesting…
Suppose $R$ is a commutative ring with identity and a fixed invertible element $q^{\frac{1}{2}}$ such that $q+q^{-1}$ is invertible. For an oriented surface $\Sigma$, let $\mathcal{S}(\Sigma;R)$ denote the Kauffman bracket skein algebra of…
A theory of cyclic elements in semisimple Lie algebras is developed. It is applied to an explicit construction of regular elements in Weyl groups.
A minimal system of homogeneous generating elements of the invariants algebra for the binary form of degree 7 is calculated.
The existence of small amounts of advanced radiation, or a tilt in the arrow of time, makes the basic equations of physics mixed-type functional differential equations. The novel features of such equations point to a microphysical structure…
We show that the distance from an element of a C*-algebra to the set of regular elements is the infimum of the $\delta>0$ for which the $\delta$-cut-down of the element admits a polar decomposition within the algebra. This parallels results…
Given an algebra $F[H]^G$ of polynomial invariants of an action of the group $G$ over the vector space $H$, a subset $S$ of $F[H]^G$ is called separating if $S$ separates all orbits that can be separated by $F[H]^G$. A minimal separating…
In this paper we exhibit a minimal set of generators form the annihilator of even neat elements of the exterior algebra of a vector space, when the base field is of positive characteristic and thus we prove the conjecture we established in…
The decision time of an infinite time algorithm is the supremum of its halting times over all real inputs. The decision time of a set of reals is the least decision time of an algorithm that decides the set; semidecision times of…