Related papers: Triangular norms on bounded trellises
We develop a new lower bound for k-set agreement in synchronous message-passing systems connected by an arbitrary directed communication network, where up to t processes may crash. Our result thus generalizes the t/k+1 lower bound for…
The first main results of this note establish forms of the hyperbolic laws of cosines and sines for certain classes of quadrilaterals and pentagons in the hyperbolic plane, having at least one ideal vertex and right angles at non-ideal…
We prove lower bounds on $||T_t||$, where $T_t$ is a one-parameter semigroup, starting from information on the resolvent norms, i.e. the pseudospectra. We provide a physically important example in which the growth of the semigroup norm…
In structured output learning, obtaining labelled data for real-world applications is usually costly, while unlabelled examples are available in abundance. Semi-supervised structured classification has been developed to handle large amounts…
For elliptic systems with block structure in the upper half-space and t-independent coefficients, we settle the study of boundary value problems by proving compatible well-posedness of Dirichlet, regularity and Neumann problems in optimal…
Limits of graphs were initiated recently in the two extreme contexts of dense and bounded degree graphs. This led to elegant limiting structures called graphons and graphings. These approach have been unified and generalized by authors in a…
This paper gives sharp linear bounds on the genus of a normal surface in a triangulated compact, orientable 3--manifold in terms of the quadrilaterals in its cell decomposition---different bounds arise from varying hypotheses on the surface…
We show the existence of regular combinatorial objects which previously were not known to exist. Specifically, for a wide range of the underlying parameters, we show the existence of non-trivial orthogonal arrays, t-designs, and t-wise…
In this paper we propose a wide class of truncated stochastic approximation procedures with moving random bounds. While we believe that the proposed class of procedures will find its way to a wider range of applications, the main motivation…
An important source of high clustering coefficient in real-world networks is transitivity. However, existing approaches for modeling transitivity suffer from at least one of the following problems: i) they produce graphs from a specific…
We investigate the intersection problem for finite semigroups, which asks for a given set of regular languages, represented by recognizing morphisms to finite semigroups, whether there exists a word contained in their intersection. We…
This paper develops new limit theory for data that are generated by networks or more generally display cross-sectional dependence structures that are governed by observable and unobservable characteristics. Strategic network formation…
We propose a dimensionless bendability parameter, $\epsilon^{-1} = [\left(h/W\right)^2 T^{-1}]^{-1}$ for wrinkling of thin, twisted ribbons with thickness $h$, width $W$, and tensional strain $T$. Bendability permits efficient collapse of…
The current paper investigates the bounded distance decoding (BDD) problem for ensembles of lattices whose generator matrices have sub-Gaussian entries. We first prove that, for these ensembles the BDD problem is NP-hard in the worst case.…
Given a pseudoconvex hypersurface in C^n and an arbitrary weight, we show the existence of local coordinates in which the polynomial model contains a particularly simple sum of squares of monomials. Our second main result provides a…
We review the recent, mainly theoretical, progress in the study of topological nodal line semimetals in three dimensions. In these semimetals, the conduction and the valence bands cross each other along a one-dimensional curve in the…
Distances are pervasive in machine learning. They serve as similarity measures, loss functions, and learning targets; it is said that a good distance measure solves a task. When defining distances, the triangle inequality has proven to be a…
It is natural that we can extend Structural Operational Semantics (SOS) to SOS for true concurrency. From SOS to SOS for true concurrency, it is in nature to give the related concepts in SOS a truly concurrent semantics foundation, i.e., a…
Multi-output inference tasks, such as multi-label classification, have become increasingly important in recent years. A popular method for multi-label classification is classifier chains, in which the predictions of individual classifiers…
Let $X$ be a finite-dimensional, noetherian scheme. Antieau, Gepner and Heller conjectured that its derived category of perfect complexes has a bounded t-structure if and only if $X$ is regular. We prove a generalization, and to do so we…