相关论文: Some Ropelength-Critical Clasps

We describe the structure of connected graphs with the minimum and maximum average distance, radius, diameter, betweenness centrality, efficiency and resistance distance, given their order and size. We find tight bounds on these graph…

We define the parametric closure problem, in which the input is a partially ordered set whose elements have linearly varying weights and the goal is to compute the sequence of minimum-weight lower sets of the partial order as the weights…

We construct a new type of geometric knot theory, plumbers' knots, and solve the problems of distinguishing and enumerating such knots at a fixed level of complexity. (v2) Minor edits, added theorem 3.18. (v3) Substantial revisions,…

We consider pure traction problems and we show that incompressible linearized elasticity can be obtained as variational limit of incompressible finite elasticity under suitable conditions on external loads.

The paper contains a discussion on a number of open problems in queueing theory. Some of them are known for decades, some are more recent. They relate to stability and to rare events. There is an idea to prepare a special issue of QUESTA on…

We examine the convexity and tractability of the two-sided linear chance constraint model under Gaussian uncertainty. We show that these constraints can be applied directly to model a larger class of nonlinear chance constraints as well as…

In this paper we investigate the conformation statistics of a Gaussian chain embedded in a medium of finite size, in the presence of quenched random obstacles. The similarities and differences between the case of random obstacles and the…

Network design problems aim to compute low-cost structures such as routes, trees and subgraphs. Often, it is natural and desirable to require that these structures have small hop length or hop diameter. Unfortunately, optimization problems…

Checkerboard surfaces in alternating link complements are used frequently to determine information about the link. However, when many crossings are added to a single twist region of a link diagram, the geometry of the link complement…

We consider a homogeneous chain of spheres linked by liquid bridges under tension. The rupture of a single liquid bridge leads to a fragmentation cascade driven by the inverse relation between the capillary force and the sphere distances.…

I review the definition and types of (closed) trapped surfaces. Surprising global properties are shown, such as their "clairvoyance" and the possibility that they enter into flat portions of the spacetime. Several results on the interplay…

The problem of robust hedging requires to solve the problem of superhedging under a nondominated family of singular measures. Recent progress was achieved by [9,11]. We show that the dual formulation of this problem is valid in a context…

Let $\s^1$ be a circle in Euclidean plane. We consider the problem of finding the shape of a planar curve which is an extremal of the potential energy that measures the distance to $\s^1$. We describe the shape of these curves…

This article discusses random hypergraphs with varying hyperedge sizes, admitting large hyperedges with size tending to infinity, and heavy-tailed limiting hyperedge size distributions. The main result describes a threshold for the random…

Random networks are a powerful tool in the analytical modeling of complex networks as they allow us to write approximate mathematical models for diverse properties and behaviors of networks. One notable shortcoming of these models is that…

We establish the existence of infinitely many synchronized solutions for a class of critical Hamiltonian elliptic systems with Hartree-type nonlocal interactions.

We investigate the entanglement entropy (EE) of gapped S=1 and $S=1/2$ spin chains with dimerization. We find that the effective boundary degrees of freedom as edge states contribute significantly to the EE. For the $S=1/2$ dimerized…

A grid poset -- or grid for short -- is a product of chains. We ask, what does a random linear extension of a grid look like? In particular, we show that the average "jump number," i.e., the number of times that two consecutive elements in…

In the study of long-time correlations extremely long orbits must be calculated. This may be accomplished much more reliably using fixed-point arithmetic. Use of this arithmetic on the Cray-1 computer is illustrated.

In this paper we give necessary and sufficient conditions for a knot type to admit non-loose Legendrian and transverse representatives in some overtwisted contact structure, classify all non-loose rational unknots in lens spaces, and…