相关论文: The pinning ideal of a multiloop

A multiloop with $s\in \mathbb{N}$ strands is a generic immersion $\gamma\colon \sqcup_1^s \mathbb{S}^1 \looparrowright \Sigma$ of the union of $s$ circles into a surface $\Sigma$, considered up to homeomorphisms. A pinning set of $\gamma$…

We study the interplay between the recently defined concept of minimum homotopy area and the classical topic of self-overlapping curves. The latter are plane curves which are the image of the boundary of an immersed disk. Our first…

We consider the problem of counting and of listing topologically inequivalent "planar" {4-valent} maps with a single component and a given number n of vertices. This enables us to count and to tabulate immersions of a circle in a sphere…

Given a set $P$ of $n$ weighted points and a set $S$ of $m$ disks in the plane, the hitting set problem is to compute a subset $P'$ of points of $P$ such that each disk contains at least one point of $P'$ and the total weight of all points…

A scheme for systematically achieving accurate numerical evaluation of multi-loop Feynman diagrams is developed. This shows the feasibility of a project aimed to produce a complete calculation for two-loop predictions in the Standard Model.…

We compute the polynomial entropy of the induced maps on hyperspace for a homeomorphism $f$ of an interval or a circle with finitely many non-wandering points.

In a statistical cluster or loop model such as percolation, or more generally the Potts models or O(n) models, a pinch point is a single bulk point where several distinct clusters or loops touch. In a polygon P harboring such a model in its…

Motivated by several applications, we consider the problem of randomly rounding a fractional solution in a matroid (base) polytope to an integral one. We consider the pipage rounding technique and also present a new technique, randomized…

We consider the question about the number of master integrals for a multiloop Feynman diagram. We show that, for a given set of denominators, this number is totally determined by the critical points of the polynomials entering either of the…

A hitting set for a collection of sets is a set that has a non-empty intersection with each set in the collection; the hitting set problem is to find a hitting set of minimum cardinality. Motivated by instances of the hitting set problem…

Multi-critical point principle (MPP) is one of the interesting theoretical possibilities that can explain the fine-tuning problems of the Universe. It simply claims that "the coupling constants of a theory are tuned to one of the…

A detailed investigation is presented of a set of algorithms which form the basis for a fast and reliable numerical integration of one-loop multi-leg (up to six) Feynman diagrams, with special attention to the behavior around (possibly)…

We study the number of clusters in two-dimensional (2d) critical percolation, N_Gamma, which intersect a given subset of bonds, Gamma. In the simplest case, when Gamma is a simple closed curve, N_Gamma is related to the entanglement entropy…

We study two aspects of the loop group formulation for isometric immersions with flat normal bundle of space forms. The first aspect is to examine the loop group maps along different ranges of the loop parameter. This leads to various…

This paper is about minimum cost constrained selection of inputs and outputs for generic arbitrary pole placement. The input-output set is constrained in the sense that the set of states that each input can influence and the set of states…

The singular set of a generic map $f: M\to F$ of a manifold $M$ of dimension $m\ge 2$ to an oriented surface $F$ is a closed smooth curve $\Sigma(f)$. We study the parity of the number of components of $\Sigma(f)$. The image $f(\Sigma)$ of…

Given an undirected, edge-weighted graph G together with pairs of vertices, called pairs of terminals, the minimum multicut problem asks for a minimum-weight set of edges such that, after deleting these edges, the two terminals of each pair…

For $m,n \in \mathbb{N}$, $m\geq 1$ and a given function $f : \mathbb{R}^m\longrightarrow \mathbb{R}$, the polynomial interpolation problem (PIP) is to determine a unisolvent node set $P_{m,n} \subseteq \mathbb{R}^m$ of…

Let pi = pi_1 pi_2 ... pi_n be a permutation in the symmetric group S_n written in one-line notation. The pinnacle set of pi, denoted Pin pi, is the set of all pi_i such that pi_{i-1} < pi_i > pi_{i+1}. This is an analogue of the…

Let $P$ be a set of at most $n$ points and let $R$ be a set of at most $n$ geometric ranges, such as for example disks or rectangles, where each $p \in P$ has an associated supply $s_{p} > 0$, and each $r \in R$ has an associated demand…