Related papers: Triangular norms on bounded trellises
Recent work in percolation has led to exact solutions for the site and bond critical thresholds of many new lattices. Here we show how these results can be extended to other classes of graphs, significantly increasing the number and variety…
We use a new algorithm to find the stress-carrying backbone of ``generic'' site-diluted triangular lattices of up to 10^6 sites. Generic lattices can be made by randomly displacing the sites of a regular lattice. The percolation threshold…
The aim of this paper is to give a unifying description of various constructions (subanalytic, semialgebraic, o-minimal site) using the notion of T-topology. We then study the category of T-sheaves.
The second author has introduced non-crossing tableaux, objects whose non-nesting analogues are semi-standard Young tableaux. We relate non-crossing tableaux to Gelfand-Tsetlin patterns and develop the non-crossing analogue of standard…
Extreme localization of damage in conventional brittle materials is the source of a host of undesirable effects. We show how artificially engineered metamaterials with all brittle constituents can be designed to ensure that every breakable…
Owing to security implications of adversarial vulnerability, adversarial robustness of deep metric learning models has to be improved. In order to avoid model collapse due to excessively hard examples, the existing defenses dismiss the…
A common representation of a three dimensional object in computer applications, such as graphics and design, is in the form of a triangular mesh. In many instances, individual or groups of triangles in such representation need to satisfy…
We present a general result about generating group topologies by pseudo-norms. Namely, we show that if a topology has a base of sets which are closed in a certain sense, then it can be generated by a collection of pseudo-norms such that the…
The constraint of a progressive decrease in residual renormalization scale dependence with increasing loop order is developed as a method for obtaining bounds on unknown higher-order perturbative corrections to renormalization-group…
This paper presents a novel control design for vehicular formations, which is an alternative to the conventional second-order consensus protocol. The design is motivated by the closed-loop system, which we construct as first-order systems…
In this work, we establish an analogue result of the Erd\"os-Stone theorem of weighted digraphs using Regularity Lemma of digraphs. We give a stability result of oriented graphs and digraphs with forbidden blow-up transitive triangle and…
Let M be the interior of a compact 3-manifold with non-empty boundary, and T be an ideal (topological) triangulation of M. This paper describes necessary and sufficient conditions for the existence of angle structures, semi-angle structures…
We effectively bound T-singularities on non-rational projective surfaces with an arbitrary amount of T-singularities and ample canonical class. This fully generalizes the previous work for the case of one singularity, and illustrates the…
For a fixed set $X$, an arbitrary \textit{weight structure} $d \in [0,\infty]^{X \times X}$ can be interpreted as a distance assignment between pairs of points on $X$. Restrictions (i.e. \textit{metric axioms}) on the behaviour of any such…
We introduce a model-independent strategy to study narrow resonances which we apply to a heavy vector triplet of the Standard Model (SM) group for illustration. The method is based on a simplified phenomenological Lagrangian which…
A regularity lemma for polynomials provides a decomposition in terms of a bounded number of approximately independent polynomials. Such regularity lemmas play an important role in numerous results, yet suffer from the familiar shortcoming…
We study the structures of arbitrary split Leibniz triple systems. By developing techniques of connections of roots for this kind of triple systems, under certain conditions, in the case of $T$ being of maximal length, the simplicity of the…
The recent paper \cite{GSZ2023} on estimation and inference for top-ranking problem in Bradley-Terry-Lice (BTL) model presented a surprising result: component-wise estimation and inference can be done under much weaker conditions on the…
We propose a novel weakly supervised learning segmentation based on several global constraints derived from box annotations. Particularly, we leverage a classical tightness prior to a deep learning setting via imposing a set of constraints…
We propose algorithms for performing model checking and control synthesis for discrete-time uncertain systems under linear temporal logic (LTL) specifications. We construct temporal logic trees (TLT) from LTL formulae via reachability…