相关论文: Quasi-martingales with a linearly ordered index se…
We introduce a partial order structure on the set of interval orders of a given size, and prove that such a structure is in fact a lattice. We also provide a way to compute meet and join inside this lattice. Finally, we show that, if we…
The matching and linear matroid intersection problems are solvable in quasi-NC, meaning that there exist deterministic algorithms that run in polylogarithmic time and use quasi-polynomially many parallel processors. However, such a parallel…
In this paper, the ordered set of rough sets determined by a quasiorder relation $R$ is investigated. We prove that this ordered set is a complete, completely distributive lattice. We show that on this lattice can be defined three different…
We give a semi-small orthogonal decomposition of the Chow ring of a matroid M. The decomposition is used to give simple proofs of Poincar\'e duality, the hard Lefschetz theorem, and the Hodge-Riemann relations for the Chow ring, recovering…
We prove the existence of quasi-left continuous semimartingales with continuous local semimartingale characteristics which satisfy a Lyapunov-type or a linear growth condition, where latter takes the whole history of the paths into…
It seems that the index theory for non-compact spaces has found its ultimate formulation in realm of coarse spaces and $K$-theory of related operator algebras. Relative and partitioned index theorems may be mentioned as two important and…
In this work, we give a decomposition of a martingale into three martingales with applications to certain types of inequalities in the new theory of Stochastic Analysis in Vector Lattices
Suppose that $X_1, \ldots , X_n$ are continuous semimartingales that are reversible and have nondegenerate crossings. Then the corresponding rank processes can be represented by generalized Stratonovich integrals, and this representation…
We prove thin-thick decompositions, for the class of Hardy martingales and thereby strengthen its square function characterization. We apply the underlying method to several classical martingale inequalities, for which we give new proofs .
In this paper we survey and further study partial sums of a stationary process via approximation with a martingale with stationary differences. Such an approximation is useful for transferring from the martingale to the original process the…
We introduce the notion of \tau-like partial order, where \tau is one of the linear order types \omega, \omega*, \omega+\omega*, and \zeta. For example, being \omega-like means that every element has finitely many predecessors, while being…
In this paper, we introduce two new forms of the dual Hartwig-Spindelb{\"o}ck decomposition and employ them to derive explicit representations for several classes of dual generalized inverses. Building on these representations, we further…
We shall present an elementary approach to extremal decompositions of (quantum) covariance matrices determined by densities. We give a new proof on former results and provide a sharp estimate of the ranks of the densities that appear in the…
We give $\operatorname{CMSO}$-transductions that, given a graph $G$, output its modular decomposition, its split decomposition and its bi-join decomposition. This improves results by Courcelle [Logical Methods in Computer Science, 2006] who…
We develop new, easily computable exponential decay bounds for inverses of banded matrices, based on the quasiseparable representation of Green matrices. The bounds rely on a diagonal dominance hypothesis and do not require explicit…
In this paper, a linearized asymptotic stability result for a Caputo-Katugampola fractional-order systems is described. An application is given to demonstrate the validity of the proposed results.
In this article almost semi-continuous processes with stationary independent increments on a finite irreducible Markov chain are considered. For these processes the components of matrix factorization identity are concretely defined. On the…
Given a reference filtration $\mathbb{F}$, we develop in this work a generic method for computing the semimartingale decomposition of $\mathbb{F}$-martingales in some specific enlargements of $\mathbb{F}$. This method is then applied to the…
A polynomial algorithm is obtained for the NP-complete linear ordering problem.
We show that there exist ordered orthogonal arrays, whose sizes deviate from the Rao bound by a factor that is polynomial in the parameters of the ordered orthogonal array. The proof is nonconstructive and based on a probabilistic method…