Related papers: Surjectively rigid chains
We define and study slider-pinning rigidity, giving a complete combinatorial characterization. This is done via direction-slider networks, which are a generalization of Whiteley's direction networks.
In simple models side chains are often represented implicitly (e.g., by spin-states) or simplified as one atom. We study side chain effects using square lattice and tetrahedral lattice models, with explicitly side chains of two atoms. We…
We study an atomistic model that describes the microscopic formation of material voids inside elastically stressed solids under an additional curvature regularization at the discrete level. Using a discrete-to-continuum analysis, by means…
This thesis concerns embeddings and self-embeddings of foundational structures in both set theory and category theory. The first part of the work on models of set theory consists in establishing a refined version of Friedman's theorem on…
This paper contributes to the theory of large cardinals beyond the Kunen inconsistency, or choiceless large cardinal axioms, in the context where the Axiom of Choice is not assumed. The first part of the paper investigates a periodicity…
We study the problem of checking whether an existential sentence (that is, a first-order sentence in prefix form built using existential quantifiers and all Boolean connectives) is true in a finite partially ordered set (in short, a poset).…
The pattern avoidance problem seeks to construct a set $X\subset \mathbb{R}^d$ with large dimension that avoids a prescribed pattern. Examples of such patterns include three-term arithmetic progressions (solutions to $x_1 - 2x_2 + x_3 =…
Odifreddi asked whether every non-irreducible many-one degree must contain an infinite antichain of one-one degrees. Positive answers are known for computably enumerable many-one degrees (Degtev) and, more recently, for many-one degrees…
Definitions of dense linear orders (with/without endpoints), separable linear orders, complete linear orders, the countable chain condition for linear orders, a Suslin line/Suslin tree and Suslin's problem Statement and proof of Cantor's…
Diversities are an extension of the concept of a metric space which assign a non-negative value to every finite set of points, rather than just pairs. A general theory of diversities has been developed which exhibits many deep analogies to…
A random dense countable set is characterized (in distribution) by independence and stationarity. Two examples are `Brownian local minima' and `unordered infinite sample'. They are identically distributed; the former ad hoc proof of this…
Chirality is known to play a central role in the properties of many physical systems across a wide range of spatial and temporal scales. Chemical and optical properties of materials are only two of the many examples where transformation…
The paper is devoted to discretization of integral norms of functions from a given finite dimensional subspace. This problem is very important in applications but there is no systematic study of it. We present here a new technique, which…
We examine a class of embeddings based on structured random matrices with orthogonal rows which can be applied in many machine learning applications including dimensionality reduction and kernel approximation. For both the…
We extend our generic rigidity theory for periodic frameworks in the plane to frameworks with a broader class of crystallographic symmetry. Along the way we introduce a new class of combinatorial matroids and associated linear…
In this paper we introduce and explore the notion of rigidity group, associated with a collection of finitely many sequences, and show that this concept has many, somewhat surprising characterizations of algebraic, spectral, and unitary…
We provide a framework for modeling social network formation through conditional multinomial logit models from discrete choice and random utility theory, in which each new edge is viewed as a "choice" made by a node to connect to another…
We apply ideas from the theory of limits of dense combinatorial structures to study order types, which are combinatorial encodings of finite point sets. Using flag algebras we obtain new numerical results on the Erd\H{o}s problem of finding…
In a Monte Carlo study the conductivity of two-dimensional random stick systems is investigated from the percolation threshold up to ten times the percolation threshold density. We propose a model explicitly depending on the stick density…
The idea of this paper is to explore the existence of canonical countably saturated models for different classes of structures. It is well-known that, under CH, there exists a unique countably saturated linear order of cardinality…