Related papers: Surjectively rigid chains
This article considers the relation between the spanning properties of lattice orbits of discrete series representations and the associated lattice co-volume. The focus is on the density theorem, which provides a trichotomy characterizing…
We show that the automorphism groups of countably categorical linear orders are extremely amenable. Using methods of Kechris, Pestov, and Todorcevic, we use this fact to derive a structural Ramsey theorem for certain families of finite…
We first develop some basic facts about certain sorts of rigid local systems on the affine line in characteristic $p>0$. We then apply them to exhibit a number of rigid local systems of rank $23$ on the affine line in characteristic $p=3$…
Real complex systems are not rigidly structured; no clear rules or blueprints exist for their construction. Yet, amidst their apparent randomness, complex structural properties universally emerge. We propose that an important class of…
The study of complex networks is a significant development in modern science, and has enriched the social sciences, biology, physics, and computer science. Models and algorithms for such networks are pervasive in our society, and impact…
We consider the linear complementarity problem with uncertain data modeled by intervals, representing the range of possible values. Many properties of the linear complementarity problem (such as solvability, uniqueness, convexity, finite…
Within the framework of Zermelo-Fraenkel set theory without the Axiom of Choice, we establish equivalents to the assertion "the union of a countable collection of finite sets is countable" in the context of metric spaces, probability…
We develop a rigidity theory for bar-joint frameworks in Euclidean $d$-space in which specified classes of edges are allowed to change length in a coordinated fashion that requires differences of lengths to be preserved within each class.…
Causal rigid particles whose action includes an {\it arbitrary} dependence on the world-line extrinsic curvature are considered. General classes of solutions are constructed, including {\it causal tachyonic} ones. The Hamiltonian…
A linear order $A$ is called strongly surjective if for every non empty suborder $B \preceq A$, there is an epimorphism from $A$ onto $B$ (denoted by $B \trianglelefteq A$). We show, answering some questions of D\'aniel T. Soukup, that…
The main result of this paper is a probabilistic construction of finite rigid structures. It yields a finitely axiomatizable class of finite rigid structures where no L^omega_{infty, omega} formula with counting quantifiers defines a linear…
Many real-world complex networks contain a significant amount of structural redundancy, in which multiple vertices play identical topological roles. Such redundancy arises naturally from the simple growth processes which form and shape many…
Entangled granular systems exhibit mechanical rigidity and resistance to deformation, reminiscent of cohesive materials, due to their reduced degrees of freedom and contact friction. A quantitative understanding of how classical granular…
Rough sets are approximations of concrete sets. The theory of rough sets has been used widely for data-mining. While it is well-known that adjunctions are underlying in rough approximations, such adjunctions are not enough for…
Combining ideas from two of our previous papers, we refine Arhangel'skii Theorem by proving a cardinal inequality of which this is a special case: any increasing union of strongly discretely Lindelof spaces with countable free sequences and…
The rigidity of a network of elastic beams crucially depends on the specific details of its structure. We show both numerically and theoretically that there is a class of isotropic networks which are stiffer than any other isotropic network…
Many set theorists point to the linearity phenomenon in the hierarchy of consistency strength, by which natural theories tend to be linearly ordered and indeed well ordered by consistency strength. Why should it be linear? In this paper I…
New classes of distance-constrained structures are introduced, namely string-node nets and meshes, a mesh being a string-node net for which the nodes are dense in the strings. Various construction schemes are given including the minimal…
We investigate the size of fixed point sets of automorphisms of bounded domains in $\mathbb{C}^n$. In one complex variable, a nontrivial automorphism has at most two fixed points, but in higher dimensions fixed point sets need not be…
We revisit a model of semiflexible Gaussian chains proposed by Winkler \textit{et al}, solve the dynamics of the discrete description of the model and derive exact algebraic expressions for some of the most relevant dynamical observables,…