Related papers: A rank based on Shelah trees
We classify $\mathcal{R}$- and $\mathcal{L}$-cross-sections of partial wreath product of inverse semigroups. As a corollary, we get the description of $\mathcal{R}$- and $\mathcal{L}$-cross-sections of the semigroupof partial automorphisms…
We give a local classification of generalized complex structures. About a point, a generalized complex structure is equivalent to a product of a symplectic manifold with a holomorphic Poisson manifold. We use a Nash-Moser type argument in…
Over some types of trees with a given number of vertices, which trees minimize or maximize the total number of subtrees or leaf containing subtrees are studied. Here are some of the main results:\ (1)\, Sharp upper bound on the total number…
Given a Borel class of trees, we show that there is a tree in that class whose Scott sentence is not too much more complicated than the definition of the class. In particular, if the class is definable by a $\Pi_\alpha$ sentence, then there…
We determine the rank of a random matrix over an arbitrary field with prescribed numbers of non-zero entries in each row and column. As an application we obtain a formula for the rate of low-density parity check codes. This formula…
We prove general fomulas for the deviations of two overpartition ranks from the average. These formulas are in terms of Appell--Lerch series and sums of quotients of theta functions and can be used, among other things, to recover any of the…
We introduce the notion of the definable rank of an ordered field, ordered abelian group and ordered set, respectively. We study the relation between the definable rank of an ordered field and the definable rank of the value group of its…
We generalize the results from [X.-D. Zhang, X.-P. Lv, Y.-H. Chen, \textit{Ordering trees by the Laplacian coefficients}, Linear Algebra Appl. (2009), doi:10.1016/j.laa.2009.04.018] on the partial ordering of trees with given diameter. For…
We construct a model category (in the sense of Quillen) for set theory, starting from two arbitrary, but natural, conventions. It is the simplest category satisfying our conventions and modelling the notions of finiteness, countability and…
We consider an elliptic surface $\pi: \mathcal{E}\rightarrow \mathbb{P}^1$ defined over a number field $k$ and study the problem of comparing the rank of the special fibres over $k$ with that of the generic fibre over $k(\mathbb{P}^1)$. We…
It implicitly follows from the work of [Colbourn, El-Mallah: On two dual classes of planar graphs. Discrete Mathematics 80(1): 21-40 (1990)] that every planar partial 3-tree is a subgraph of a planar 3-tree. This fact has already enabled to…
In this paper, we analyze and compare three of the many algebraic structures that have been used for modeling dependent type theories: categories with families, split type-categories, and representable maps of presheaves. We study these in…
In "Faces of a Hyperplane Arrangement Enumerated by Ideal Dimension, with Applications to Plane, Plaids, and Shi," Zaslavsky showed how to compute the number $r_\ell(\mathcal{A})$ of regions of a real hyperplane arrangement $\mathcal{A}$…
Suppose $X$ is a smooth quasiprojective variety over $\cc$ and $\rho : \pi _1(X,x) \to SL(2,\cc)$ is a Zariski-dense representation with quasiunipotent monodromy at infinity. Then $\rho$ factors through a map $X\to Y$ with $Y$ either a…
Skew lattices are non-commutative generalizations of lattices. The coset structure decomposition is an original approach to the study of these algebras describing the relation between its rectangular classes. In this paper we will look at…
We present a physically-inspired model and an efficient algorithm to infer hierarchical rankings of nodes in directed networks. It assigns real-valued ranks to nodes rather than simply ordinal ranks, and it formalizes the assumption that…
In recent years, saliency ranking has emerged as a challenging task focusing on assessing the degree of saliency at instance-level. Being subjective, even humans struggle to identify the precise order of all salient instances. Previous…
Based on decision trees, many fields have arguably made tremendous progress in recent years. In simple words, decision trees use the strategy of "divide-and-conquer" to divide the complex problem on the dependency between input features and…
We present a unification and generalization of what is known in the literature as sequentially and hierarchically semi-separable (SSS and HSS) representations for matrices. Describing rank-structured representations of (inverses of) sparse…
We show that the quantifier elimination result for the Shelah-Spencer almost sure theories of sparse random graphs $G(n,n^{-\alpha})$ given by Laskowski in $[7]$ extends to their various analogues. The analogues will be obtained as theories…