相关论文: The theorem of the complement for nested subpfaffi…

In this paper we address the problem of generating all elements obtained by the saturation of an initial set by some operations. More precisely, we prove that we can generate the closure by polymorphisms of a boolean relation with a…

In this paper we prove that if R is a left Noetherian and left regular ring such that all finitely generated projective left R-modules are stably free, then the same is true for the completion R[[x;\sigma,\delta]] of any Ore extension…

Nested graphs have been used in different applications, for example to represent knowledge in semantic networks. On the other hand, graphs with cycles are really important in surface reconstruction, periodic schedule and network analysis.…

Let $R$ be an indecomposable root system. It is well known that any root is part of a basis $B$ of $R$. But when can you extend a set of two or more roots to a basis $B$ of $R$? A $\pi$-system is a linearly independent set of roots, $C$,…

A subalgebra $B$ of a Lie algebra $L$ is {\em c-supplemented} in $L$ if there is a subalgebra $C$ of $L$ with $L = B + C$ and $B \cap C \leq B_L$, where $B_L$ is the core of $B$ in $L$. This is analogous to the corresponding concept of a…

We define pullback and separated presentations of modules over pullback rings, and, if the ring is a pullback of epimorphisms over a semisimple ring, an algorithm reducing such a presentation of a module to an $R$-diagram. The latter is the…

We consider the foundational relation between arithmetic and set theory. Our goal is to criticize the construction of standard arithmetic models as providing grounds for arithmetic truth (even in a relative sense). Our method is to…

This paper is the second in a series of three, the aim of which is to construct algebraic geometry over a free metabelian Lie algebra $F$. For the universal closure of free metabelian Lie algebra of finite rank $r \ge 2$ over a finite field…

Given a simple graph $G$ with $n$ vertices and a natural number $i \leq n$, let $L_G(i)$ be the maximum number of leaves that can be realized by an induced subtree $T$ of $G$ with $i$ vertices. We introduce a problem that we call the…

Fix a language L extending the language of real closed fields by at least one new predicate or function symbol. Call an L-structure R pseudo-o-minimal if it is (elementarily equivalent to) an ultraproduct of o-minimal structures. We show…

The Lefschetz hyperplane section theorem asserts that an affine variety is homotopy equivalent to a space obtained from its generic hyperplane section by attaching some cells. The purpose of this paper is to describe attaching maps of these…

A Lie algebra $K$ over a field of characteristic zero $E$ is called a completion of a rational Lie algebra $L$, if it contains $L$ as $\mathbb{Q}$-subalgebra and the $E$-span of $L$ is equal to $K$. The class of all completions of a…

Let F be a non-Archimedean locally compact field of residue characteristic p, let D be a finite dimensional central division F-algebra and let R be an algebraically closed field of characteristic different from p. To any irreducible smooth…

We employ a recently developed methodology -- called "structural refinement" -- to extract nested sequent systems for a sizable class of intuitionistic modal logics from their respective labelled sequent systems. This method can be seen as…

Let $K$ be an algebraically closed field endowed with a complete non-archimedean norm with valuation ring $R$. Let $f\colon Y\to X$ be a map of $K$-affinoid varieties. In this paper we study the analytic structure of the image $f(Y)\subset…

We solve the problem of characterizing the existence of a polynomial matrix of fixed degree when its eigenstructure (or part of it) and some of its rows (columns) are prescribed. More specifically, we present a solution to the row (column)…

We show that for any $i > 0$, it is decidable, given a regular language, whether it is expressible in the $\Sigma_i[<]$ fragment of first-order logic FO[<]. This settles a question open since 1971. Our main technical result relies on the…

A tree-based dictionary learning model is developed for joint analysis of imagery and associated text. The dictionary learning may be applied directly to the imagery from patches, or to general feature vectors extracted from patches or…

A regular realizability (RR) problem is testing nonemptiness of intersection of some fixed language (filter) with given regular language. We study here complexity of RR problems. It appears that for any language L there exists RR problem…

This note concerns the still open question of representability of Noetherian PI-algebras. Extending a result of Rowen and Small (with an observation of Bergman) that every finitely generated module over a commutative Noetherian ring…