English
Related papers

Related papers: Fully Packed Loop configurations in a triangle

200 papers

The multiplicative fragment of Linear Logic is the formal system in this family with the best understood proof theory, and the categorical models which best capture this theory are the fully complete ones. We demonstrate how the Hyland-Tan…

Logic in Computer Science · Computer Science 2017-01-11 Andrea Schalk , Hugh Paul Steele

We define tropical analogues of the notions of linear space and Plucker coordinate and study their combinatorics. We introduce tropical analogues of intersection and dualization and define a tropical linear space built by repeated…

Combinatorics · Mathematics 2007-05-23 David E Speyer

The aim of XLOOPS is to calculate one-particle irreducible Feynman diagrams with one or two closed loops for arbitrary processes in the Standard model of particles and related theories. Up to now this aim is realized for all one-loop…

High Energy Physics - Phenomenology · Physics 2009-10-30 L. Brücher , J. Franzkowski , D. Kreimer

We study the geometry of fully augmented link complements in $S^3$ by looking at their link diagrams. We extend the method introduced by Thistlethwaite and Tsvietkova to fully augmented links and define a system of algebraic equations in…

Geometric Topology · Mathematics 2018-11-20 Rochy Flint

We consider, for complete bipartite graphs, the convex hulls of characteristic vectors of all matchings, extended by a binary entry indicating whether the matching contains two specific edges. These polytopes are associated to the quadratic…

Discrete Mathematics · Computer Science 2019-04-09 Matthias Walter

We consider arrangements of $n$ pseudo-lines in the Euclidean plane where each pseudo-line $\ell_i$ is represented by a bi-infinite connected $x$-monotone curve $f_i(x)$, $x \in \mathbb{R}$, s.t.\ for any two pseudo-lines $\ell_i$ and…

Computational Geometry · Computer Science 2020-01-24 Stefan Felsner , Alexander Pilz , Patrick Schnider

Linearized polynomials have attracted a lot of attention because of their applications in both geometric and algebraic areas. Let $q$ be a prime power, $n$ be a positive integer and $\sigma$ be a generator of…

Number Theory · Mathematics 2021-07-16 Paolo Santonastaso , Ferdinando Zullo

In this paper, we show that two flat fully augmented links with homeomorphic complements must be equivalent as links in $\mathbb{S}^{3}$. This requires a careful analysis of how totally geodesic surfaces and cusps intersect in these link…

Geometric Topology · Mathematics 2025-11-26 Christian Millichap , Rolland Trapp

We establish a direct map between refined topological vertex and sl(N) homological invariants of the of Hopf link, which include Khovanov-Rozansky homology as a special case. This relation provides an exact answer for homological invariants…

High Energy Physics - Theory · Physics 2014-11-18 Sergei Gukov , Amer Iqbal , Can Kozcaz , Cumrun Vafa

M. Freedman and V. Krushkal introduced the notion of a "filling" link in a 3-manifold: a link $L$ is filling in $M$ if for any spine $G$ of $M$ disjoint from $L$, $\pi_1(G)$ injects into $\pi_1(M \setminus L )$. Freedman and Krushkal show…

Geometric Topology · Mathematics 2021-10-07 William Stagner

This note presents some properties of the variety of planes $F_2(X)\subset G(3,7)$ of a cubic $5$-fold $X\subset \mathbb P^6$. A cotangent bundle exact sequence is first derived from the remark made by Iliev and Manivel that $F_2(X)$ sits…

Algebraic Geometry · Mathematics 2026-05-27 René Mboro

For q > 2, Carlitz proved that the group of permutation polynomials (PPs) over F_q is generated by linear polynomials and x^{q-2}. Based on this result, this note points out a simple method for representing all PPs with full cycle over the…

Number Theory · Mathematics 2010-05-13 Ayca Cesmelioglu

We introduce forest straight-line programs (FSLPs) as a compressed representation of unranked ordered node-labelled trees. FSLPs are based on the operations of forest algebra and generalize tree straight-line programs. We compare the…

Data Structures and Algorithms · Computer Science 2018-02-16 Adrià Gascón , Markus Lohrey , Sebastian Maneth , Carl Philipp Reh , Kurt Sieber

We consider random perfect matchings on a general class of contracting bipartite graphs by letting certain edge weights be 0 on the contracting square-hexagon lattice in a periodic way. We obtain a deterministic limit shape in the scaling…

Probability · Mathematics 2021-01-07 Zhongyang Li

The rankable and compressible sets have been studied for more than a quarter of a century, ever since Allender [1] and Goldberg and Sipser [6] introduced the formal study of polynomial-time ranking. Yet even after all that time, whether the…

Logic in Computer Science · Computer Science 2018-11-01 Jackson Abascal , Lane A. Hemaspaandra , Shir Maimon , Daniel Rubery

We present a first exact study on higher-dimensional packing problems with order constraints. Problems of this type occur naturally in applications such as logistics or computer architecture and can be interpreted as higher-dimensional…

Data Structures and Algorithms · Computer Science 2007-05-23 Sandor P. Fekete , Ekkehard Koehler , Juergen Teich

We investigate the duality relation between linear programs over grids (Grid-LPs) and generalized linear complementarity problems (GLCPs) with hidden K-matrices. The two problems, moreover, share their combinatorial structure with…

Computational Complexity · Computer Science 2015-01-27 Lorenz Klaus

This paper provides some technical results needed in "Formalism for Relative Gromov-Witten Invariants." We study line-bundles on the moduli stacks of relative stable and rubber maps that are used to define relative Gromov-Witten invariants…

Algebraic Geometry · Mathematics 2007-05-23 Eric Katz

Packing of spheres is a problem with a long history dating back to Kepler's conjecture in 1611. The highest density is realized in face-centred-cubic (FCC) and hexagonal-close-packed (HCP) arrangements. These are only limiting examples of…

Statistical Mechanics · Physics 2023-10-17 R. Ganesh , Amna Khairi Nasr

Given a finite set T of maps on a finite ring R, we look at the finite simple graph G=(V,E) with vertex set V=R and edge set E={(a,b) | exists t in T, b=t(a), b not equal to a}. An example is when R=Z_n and T consists of a finite set of…

Dynamical Systems · Mathematics 2013-11-27 Oliver Knill
‹ Prev 1 4 5 6 7 8 10 Next ›