English
Related papers

Related papers: The theorem of the complement for nested subpfaffi…

200 papers

For a given transitive binary relation e on a set E, the transitive closures of open (i.e., co-transitive in e) sets, called the regular closed subsets, form an ortholattice Reg(e), the extended permutohedron on e. This construction, which…

Combinatorics · Mathematics 2013-04-05 Luigi Santocanale , Friedrich Wehrung

RO*-algebras are defined and studied. For RO*-algebra T, using properties of partial order, it is established that the set of bounded elements can be endowed with C*-norm. The structure of commutative subalgebras of T is considered and the…

Operator Algebras · Mathematics 2010-12-24 Dmitry Sh. Goldstein , Alexander A. Katz , Roman Sklyar

We present a concise proof for the supporting hyperplane theorem. We then observe that the proof not only establishes the supporting hyperplane theorem but also extends it to a hyperplane separation theorem for certain non-convex sets. The…

Optimization and Control · Mathematics 2023-10-10 Ali Taherinassaj , Yiling Chen

We introduce presheaf automata as a generalisation of different variants of higher-dimensional automata and other automata-like formalisms, including Petri nets and vector addition systems. We develop the foundations of a language theory…

Formal Languages and Automata Theory · Computer Science 2025-08-18 Georg Struth , Krzysztof Ziemiański

An extension $K/k$ of analytic (i.e. real valued complete) fields is called small if it is topologically-algebraically generated by finitely many elements. We prove that this property is inherited by subextensions and hence topological…

Algebraic Geometry · Mathematics 2025-11-04 Michael Temkin

We see how nested sequents, a natural generalisation of hypersequents, allow us to develop a systematic proof theory for modal logics. As opposed to other prominent formalisms, such as the display calculus and labelled sequents, nested…

Logic in Computer Science · Computer Science 2010-04-13 Kai Brünnler

Let k be an algebraically closed field, let R be an associative k-algebra, and let F = {M_a: a in I} be a family of orthogonal points in R-Mod such that End_R(M_a) = k for all a in I. Then Mod(F), the minimal full sub-category of R-Mod…

Representation Theory · Mathematics 2007-05-23 Eivind Eriksen

Let $(\mathfrak{g},[p])$ be a finite dimensional restricted Lie algebra over a perfect field $\mathbbm{k}$ of characteristic $p\!\ge \!3$. By combining methods from recent work of Benson-Carlson \cite{BC20} with those of \cite{CF21,Fa17} we…

Representation Theory · Mathematics 2023-05-16 Hao Chang , Rolf Farnsteiner

The *reciprocal complement* $R(D)$ of an integral domain $D$ is the subring of its fraction field generated by the reciprocals of its nonzero elements. Many properties of $R(D)$ are determined when $D$ is a polynomial ring in $n\geq 2$…

Commutative Algebra · Mathematics 2025-08-27 Neil Epstein , Lorenzo Guerrieri , K. Alan Loper

A method is given that "inverts" a logic grammar and displays it from the point of view of the logical form, rather than from that of the word string. LR-compiling techniques are used to allow a recursive-descent generation algorithm to…

cmp-lg · Computer Science 2008-02-03 Christer Samuelsson

We develop a general theory of extensions of flat functors along geometric morphisms of toposes, and apply it to the study of the class of theories whose classifying topos is equivalent to a presheaf topos. As a result, we obtain a…

Category Theory · Mathematics 2014-06-23 Olivia Caramello

Left invariant affine structures in a Lie group $G$ are in one-to-one correspondence with left-symmetric algebras over its Lie algebra $\mathfrak g=T_eG$ (``over'' means that the commutator $[x,y]=xy-yx$ coincides with the Lie bracket;…

Differential Geometry · Mathematics 2007-05-23 V. M. Gichev

Denote by (R,.) the multiplicative semigroup of an associative algebra R over an infinite field, and let (R,*) represent R when viewed as a semigroup via the circle operation x*y=x+y+xy. In this paper we characterize the existence of an…

Rings and Algebras · Mathematics 2007-05-23 David M. Riley , Mark C. Wilson

We study the set $R$ of nonplanar rational curves of degree $d<q+2$ on a smooth Hermitian surface $X$ of degree $q+1$ defined over an algebraically closed field of characteristic $p>0$, where $q$ is a power of $p$. We prove that $R$ is the…

Algebraic Geometry · Mathematics 2019-05-28 Norifumi Ojiro

We investigate two problems for a class C of regular word languages. The C-membership problem asks for an algorithm to decide whether an input language belongs to C. The C-separation problem asks for an algorithm that, given as input two…

Formal Languages and Automata Theory · Computer Science 2015-01-06 Thomas Place , Marc Zeitoun

We give necessary and sufficient conditions for a polynomially bounded o-minimal expansion of a real closed field (in a language of arbitrary cardinality) to be $\aleph_{\alpha}$-saturated. The conditions are in terms of the value group,…

Logic · Mathematics 2016-03-22 Paola D'Aquino , Salma Kuhlmann

Given a Lie group G whose Lie algebra is endowed with a nondegenerate invariant symmetric bilinear form, we construct a Poisson algebra of continuous functions on a certain open subspace R of the space of representations in G of the…

dg-ga · Mathematics 2007-05-23 Johannes Huebschmann

Although attention-based Neural Machine Translation has achieved remarkable progress in recent layers, it still suffers from issue of making insufficient use of the output of each layer. In transformer, it only uses the top layer of encoder…

Computation and Language · Computer Science 2021-08-02 GuoLiang Li , Yiyang Li

Given two nonlinear systems which only violate incremental passivity when their incremental gains are sufficiently small, we give a condition for their negative feedback interconnection to have finite incremental gain, which generalizes the…

Dynamical Systems · Mathematics 2022-03-29 Thomas Chaffey

In this paper we study the logical aspects of branching automata, as defined by Lodaya and Weil. We first prove that the class of languages of finite N-free posets recognized by branching automata is closed under complementation. Then we…

Formal Languages and Automata Theory · Computer Science 2017-01-11 Bedon Nicolas