Related papers: Trees, linear orders and G\^ateaux smooth norms
We introduce a sequent calculus with a simple restriction of Lambek's product rules that precisely captures the classical Tamari order, i.e., the partial order on fully-bracketed words (equivalently, binary trees) induced by a…
In a recent article (2022) we proved with L. Zaj\'i\v{c}ek that if $ G\subset\R^n $ is an unbounded open convex set that does not contain a translation of a convex cone with non-empty interior, then there exist $ f:G\to\R $ and a concave…
We present three natural combinatorial properties for class forcing notions, which imply the forcing theorem to hold. We then show that all known sufficent conditions for the forcing theorem (except for the forcing theorem itself),…
Problems related to projections on closed convex cones are frequently encountered in optimization theory and related fields. To study these problems, various unifying ideas have been introduced, including asymmetric vector-valued norms and…
This is a survey article on trees, with a modest number of proofs to give a flavor of the way these topologies can be efficiently handled. Trees are defined in set-theorist fashion as partially ordered sets in which the elements below each…
It is shown that the coset lattice of a finite group has shellable order complex if and only if the group is complemented. Furthermore, the coset lattice is shown to have a Cohen-Macaulay order complex in exactly the same conditions. The…
This paper gives a complete classification of linear repetitivity (LR) for a natural class of aperiodic Euclidean cut and project schemes with convex polytopal windows. Our results cover those cut and project schemes for which the lattice…
The paper is a first of two and aims to show that (assuming large cardinals) set theory is a tractable (and we dare to say tame) first order theory when formalized in a first order signature with natural predicate symbols for the basic…
Let $X$ be a finite set. We give criterion to say if a system of trees ${\cal P}=\{T_i\}_i$ with leaf sets $L(T_i) \in {X \choose 5}$ can be amalgamated into a supertree, that is, if there exists a tree $T$ with $L(T)=X$ such that $T$…
Given a nonempty set $\mathcal{L}$ of linear orders, we say that the linear order $L$ is $\mathcal{L}$-convex embeddable into the linear order $L'$ if it is possible to partition $L$ into convex sets indexed by some element of $\mathcal{L}$…
The $k$-th spectral moment $M_k(G)$ of the adjacency matrix of a graph~$G$ represents the number of closed walks of length~$k$ in~$G$. We study here the partial order $\preceq$ of graphs, defined by $G\preceq H$ if $M_k(G)\leq M_k(H)$ for…
We give sufficient conditions for the asymptotic normality of linear combinations of order statistics (L-statistics) in the case of simple random samples without replacement. In the first case, restrictions are imposed on the weights of…
The standard assumption for proving linear convergence of first order methods for smooth convex optimization is the strong convexity of the objective function, an assumption which does not hold for many practical applications. In this…
Trees are partial orderings where every element has a linearly ordered set of smaller elements. We define and study several natural notions of completeness of trees, extending Dedekind completeness of linear orders and Dedekind-MacNeille…
We show that the first order theory of the lattice of open sets in some natural topological spaces is $m$-equivalent to second order arithmetic. We also show that for many natural computable metric spaces and computable domains the first…
In this paper, it is proved that, for the truth value algebra of interval-valued fuzzy sets, the distributive laws do not imply the monotonicity condition for the set inclusion operation. Then, a lattice-ordered $t_{r}$-norm, which is not…
We obtain lattice models whose continuum limits correspond to $N=2$ superconformal coset models. This is done by taking the well known vertex model whose continuum limit is the $G \times G/G$ conformal field theory, and twisting the…
The computational complexity of the isomorphism problem for regular trees, regular linear orders, and regular words is analyzed. A tree is regular if it is isomorphic to the prefix order on a regular language. In case regular languages are…
We show that several classes of ordered structures (namely, convex linear orders, layered permutations, and compositions) admit first-order logical limit laws.
The theory of Ihara zeta functions is extended to non-compact arithmetic quotients of Bruhat-Tits trees. This new zeta function turns out to be a rational function, despite the infinite-dimensional setting. In general it has zeros and…