English
Related papers

Related papers: On sets with rank one in simple homogeneous struct…

200 papers

Context-free languages can be characterized in several ways. This article studies projective linearisations of languages of simple dependency trees, i.e., dependency trees in which a node can govern at most one node with a given syntactic…

Formal Languages and Automata Theory · Computer Science 2024-01-17 Carles Cardó

Let $K$ denote prefix-free Kolmogorov Complexity, and $K^A$ denote it relative to an oracle $A$. We show that for any $n$, $K^{\emptyset^{(n)}}$ is definable purely in terms of the unrelativized notion $K$. It was already known that…

Logic · Mathematics 2022-08-08 Rodney Downey , Lu Liu , Keng Meng Ng , Daniel Turetsky

Consider a matrix $M$ chosen uniformly at random from a class of $m \times n$ matrices of zeros and ones with prescribed row and column sums. A partially filled matrix $D$ is a $\mathit{defining}$ $\mathit{set}$ for $M$ if $M$ is the unique…

Combinatorics · Mathematics 2020-06-26 Carly Bodkin , Anita Liebenau , Ian M. Wanless

We define an easily verifiable notion of an atomic formula having uniformly bounded arrays in a structure $M$. We prove that if $T$ is a complete $L$-theory, then $T$ is mutually algebraic if and only if there is some model $M$ of $T$ for…

Logic · Mathematics 2020-11-11 Michael C. Laskowski , Caroline A. Terry

One of the common obstacles for learning causal models from data is that high-order conditional independence (CI) relationships between random variables are difficult to estimate. Since CI tests with conditioning sets of low order can be…

Machine Learning · Computer Science 2020-10-07 Marcel Wienöbst , Maciej Liśkiewicz

In the context of learning formal languages, data about an unknown target language L is given in terms of a set of (word,label) pairs, where a binary label indicates whether or not the given word belongs to L. A (polynomial-size)…

Formal Languages and Automata Theory · Computer Science 2026-05-19 S. Mahmoud Mousawi , Sandra Zilles

We initiate a systematic study of the class of theories without the tree property of the second kind - NTP2. Most importantly, we show: the burden is "sub-multiplicative" in arbitrary theories (in particular, if a theory has TP2 then there…

Logic · Mathematics 2013-08-15 Artem Chernikov

Let $X$ be a smooth variety defined over an algebraically closed field of arbitrary characteristic and $\O_X(H)$ be a very ample line bundle on $X$. We show that for a semistable $X$-bundle $E$ of rank two, there exists an integer $m$…

Algebraic Geometry · Mathematics 2016-09-07 Georg Hein

Let $M$ be a $n\times m$ $(0,1)$-matrix. We define the $s$-binary rank, $br_s(M)$, of $M$ to be the minimal integer $d$ such that there are $d$ monochromatic rectangles that cover all the $1$-entries in the matrix, and each $1$-entry is…

Data Structures and Algorithms · Computer Science 2023-01-12 Nader H. Bshouty

A \emph{sign pattern (matrix)} is a matrix whose entries are from the set $\{+, -, 0\}$. The \emph{minimum rank} (respectively, \emph{rational minimum rank}) of a sign pattern matrix $\cal A$ is the minimum of the ranks of the real…

Combinatorics · Mathematics 2013-12-24 Guangming Jing , Wei Gao , Yubin Gao , Fei Gong , Zhongshan Li , Yanling Shao , Lihua Zhang

Let $f:V\times V\to F$ be a totally arbitrary bilinear form defined on a finite dimensional vector space $V$ over a a field $F$, and let $L(f)$ be the subalgebra of $\gl(V)$ of all skew-adjoint endomorphisms relative to $f$. Provided $F$ is…

Rings and Algebras · Mathematics 2013-08-22 S. Ruhallah Ahmadi , Martin Chaktoura , Fernando Szechtman

Let $X(\RR)$ be a geometrically connected variety defined over $\RR$ and such that the set of all its (also complex) points $X(\CC)$ is non-degenerate. We introduce the notion of \emph{admissible rank} of a point $P$ with respect to $X$ to…

Algebraic Geometry · Mathematics 2016-04-11 Edoardo Ballico , Alessandra Bernardi

We present a stable uniqueness theorem for non-unital C*-algebras. Generalized tracial rank one is defined for stably projectionless simple C*-algebras. Let $A$ and $B$ be two stably projectionless separable simple amenable C*-algebras with…

Operator Algebras · Mathematics 2017-02-28 Guihua Gong , Huaxin Lin

We study the cancellation property of projective modules of rank $2$ with a trivial determinant over Noetherian rings of dimension $\leq 4$. If $R$ is a smooth affine algebra of dimension $4$ over an algebraically closed field $k$ such that…

Algebraic Geometry · Mathematics 2021-04-20 Tariq Syed

We give an example of two ordered structures M, N in the same language L with the same universe, the same order and admitting the same one-variable definable subsets such that M is a model of the common theory of o-minimal L-structures and…

Logic · Mathematics 2023-09-15 Nadav Meir

The classical Ulam sequence is defined recursively as follows: $a_1=1$, $a_2=2$, and $a_n$, for $n > 2$, is the smallest integer not already in the sequence that can be written uniquely as the sum of two distinct earlier terms. This…

Combinatorics · Mathematics 2020-11-03 Tej Bade , Kelly Cui , Antoine Labelle , Deyuan Li

Undecidability of various properties of first order term rewriting systems is well-known. An undecidable property can be classified by the complexity of the formula defining it. This gives rise to a hierarchy of distinct levels of…

Logic in Computer Science · Computer Science 2009-03-02 Joerg Endrullis , Herman Geuvers , Hans Zantema

Given an algebraic differential equation of order greater than one, it is shown that if there is any nontrivial algebraic relation amongst any number of distinct nonalgebraic solutions, along with their derivatives, then there is already…

Algebraic Geometry · Mathematics 2022-11-23 James Freitag , Rémi Jaoui , Rahim Moosa

We give an easily checkable algebraic condition which implies that two elements of a finitely generated free group are members of distinct doubly-twisted conjugacy classes with respect to a pair of homomorphisms. We further show that this…

Group Theory · Mathematics 2010-06-03 P. Christopher Staecker

An algebraic structure is said to be congruence permutable if its arbitrary congruences $\alpha$ and $\beta$ satisfy the equation $\alpha \circ \beta =\beta \circ \alpha$, where $\circ$ denotes the usual composition of binary relations. For…

Group Theory · Mathematics 2018-02-27 Attila Nagy