Related papers: On the Counting of Fully Packed Loop Configuration…
A linkage is a finite graph with lengths assigned to each edge. A planar realization is a map to the plane which preserves edge lengths. It can be thought of as a mechanical device formed from stiff rods and rotating joints. We look at the…
Understanding the reliability of large language models (LLMs) has recently garnered significant attention. Given LLMs' propensity to hallucinate, as well as their high sensitivity to prompt design, it is already challenging to predict the…
We discuss both simple and more subtle connections between the numbers of permutations and full cycles with some restrictions,in particular, between the numbers of permutations and full cycles with prescribed up-down structure.
Hyperproperties are properties that describe the correctness of a system as a relation between multiple executions. Hyperproperties generalize trace properties and include information-flow security requirements, like noninterference, as…
In this chapter, we review a principled way of defining and measuring contextuality in systems with deterministic inputs and random outputs, recently proposed and developed in \citep{KujalaDzhafarovLarsson2015,DKL2015FooP}.
In an earlier note [arXiv:2301.00295] it was shown that there is an upper bound to the number of disjoint Hopf links (and certain related links) that can be embedded in the unit cube where there is a fixed separation required between the…
In two-dimensional loop models, the scaling properties of critical random curves are encoded in the correlators of connectivity operators. In the dense O($n$) loop model, any such operator is naturally associated to a standard module of the…
We derive a finite-sample probabilistic bound on the parameter estimation error of a system identification algorithm for Linear Switched Systems. The algorithm estimates Markov parameters from a single trajectory and applies a variant of…
We consider the estimation of high-dimensional network structures from partially observed Markov random field data using a penalized pseudo-likelihood approach. We fit a misspecified model obtained by ignoring the missing data problem. We…
Connection formulas relating Frobenius solutions of linear ODEs at different Fuchsian singular points can be expressed in terms of the large order asymptotics of the corresponding power series. We demonstrate that for the usual, confluent…
This paper studies the configuration space of all possible positions of a linkage in R^n. For example, it shows that for every compact algebraic set, there is a linkage whose configuration space is analytically isomorphic to a finite number…
Propositional Typicality Logic (PTL) is a recently proposed logic, obtained by enriching classical propositional logic with a typicality operator capturing the most typical (alias normal or conventional) situations in which a given sentence…
We compute the linking number of two modular knots in the space $\text{PSL}(2, \mathbb{Z})\backslash\text{PSL}(2, \mathbb{R})$ with the trefoil filled in, which answers a question posed by Ghys in 2007. This computation is realized through…
Recently, Freedman [arXiv:2301.00295] introduced the idea of packing a maximal number of links into a bounded region subject to geometric constraints, and produced upper bounds on the packing number in some cases, while commenting that…
Robust estimates for the performance of complicated queueing networks can be obtained by showing that the number of jobs in the network is stochastically comparable to a simpler, analytically tractable reference network. Classical coupling…
Conjectures for analytical expressions for correlations in the dense O$(1)$ loop model on semi infinite square lattices are given. We have obtained these results for four types of boundary conditions. Periodic and reflecting boundary…
The field theory approach to the statistical mechanics of a system of N polymer rings linked together is generalized to the case of links that have a fixed number $2s$ of maxima and minima. Such kind of links are called plats and appear for…
We test a Markov chain approximation to the segment description (Li, 2007) of chaos (and turbulence) on a tent map, the Minea system, the H\'enon map, and the Lorenz system. For the tent map, we compute the probability transition matrix of…
We give a fixed-parameter tractable (FPT) approximation algorithm computing the path-width of a tournament, and more generally, of a semi-complete digraph. Based on this result, we prove that topological containment and rooted immersion…
Ropelength and embedding thickness are related measures of geometric complexity of classical knots and links in Euclidean space. In their recent work, Freedman and Krushkal posed a question regarding lower bounds for embedding thickness of…