Related papers: On the Antichain Tree Property
Elasticity property (i.e. no-particle creation) is used in the tree level scattering of scalar particles in 1+1 dimensions to construct the affine Toda field theory(ATFT) associated with root systems of groups $a_2^{(2)}$ and $c_2^{(1)}$. A…
Automatic (i.e., computer-assisted) theorem proving (ATP) can come in many flavors. This document presents early steps in our effort towards defining object-oriented theorem proving (OOTP) as a new style of ATP. Traditional theorem proving…
We study valued fields equipped with an automorphism. We prove that all of them have an extension admitting an equivariant cross-section of the valuation. In residual characteristic zero, and in the presence of such a cross-section, we show…
Pairwise ordered tree alignment are combinatorial objects that appear in RNA secondary structure comparison. However, the usual representation of tree alignments as supertrees is ambiguous, i.e. two distinct supertrees may induce identical…
We present a combinatorial structure of generators of $D(\mathcal{A}).$ This structure permits us to detect the relationship between the combinatorial determined property and the singularity of vector field. Consequently, by using only…
This paper introduces a new methodology for constructing a network of companies called a dynamic asset graph. This is similar to the dynamic asset tree studied recently, as both are based on correlations between asset returns. However, the…
We prove a version of the fundamental theorem of asset pricing (FTAP) in continuous time that is based on the strict no-arbitrage condition and that is applicable to both frictionless markets and markets with proportional transaction costs.…
The classical matrix tree theorem relates the number of spanning trees of a connected graph with the product of the nonzero eigenvalues of its Laplacian matrix. The class of regular matroids generalizes that of graphical matroids, and a…
Property $(P)$, introduced in recent work and rooted in the classical theory of Parter vertices, concerns the existence of a nonsingular matrix $A\in S(G)$ for which every vertex of $G$ is a $P$-vertex. Previous investigations have fully…
In this paper we prove a combinatorial theorem for finite labellings of trees, and show that it is equivalent to a theorem for finite covers of metric trees and a fixed point theorem on metric trees. We trace how these connections mimic the…
The tree share structure proposed by Dockins et al. is an elegant model for tracking disjoint ownership in concurrent separation logic, but decision procedures for tree shares are hard to implement due to a lack of a systematic theoretical…
We prove several preservation theorems for NATP and furnish several examples of NATP. First, we prove preservation of NATP for the parametrization and sum of the theories of Fra\"{i}ss\'{e} limits of Fra\"{i}ss\'{e} classes satisfying…
We introduce the notion of the $k$-closure of a group of automorphisms of a locally finite tree, and give several examples of the construction. We show that the $k$-closure satisfies a new property of automorphism groups of trees that…
We show that for each property $\mathsf{P}\in \{\mathsf{OP}, \mathsf{IP}, \mathsf{TP}_1, \mathsf{TP}_2, \mathsf{ATP}, \mathsf{SOP}_3\}$ there is a poset $\Sigma_{\mathsf{P}}$ such that a theory has property $\mathsf{P}$ if and only if some…
Automated Theorem Proving (ATP) deals with the development of computer programs being able to show that some conjectures (queries) are a logical consequence of a set of axioms (facts and rules). There exists several successful ATPs where…
A syntax tree is a planar rooted tree where internal nodes are labeled on a graded set of generators. There is a natural notion of occurrence of contiguous pattern in such trees. We describe a way, given a set of generators $\mathfrak{G}$…
We study the complexity and expressive power of conjunctive queries over unranked labeled trees represented using a variety of structure relations such as ``child'', ``descendant'', and ``following'' as well as unary relations for node…
In this paper we give a fully combinatorial description of the zero entropy periodic patterns on trees. Unlike previously known characterizations of such patterns, our criterion is independent of any particular topological realization of…
The paper deals with two issues: the existence of universal models of a theory T and related properties when cardinal arithmetic does not give this existence offhand. In the first section we prove that simple theories (e.g., theories…
Mekler constructed a way to produce a pure group from any given structure where the construction preserves $\kappa$-stability for any cardinal $\kappa$. Not only the stability, it is known that his construction preserves various…