Related papers: Small Extended Formulations for Cyclic Polytopes
We give a short proof, based on symmetric function theory, of a formula due to Goupil and Schaeffer, counting the number of factorizations of a cycle of maximal length in the symmetric group, into the product of two permutations of given…
We construct a new family of entire solutions to the Yamabe equation $$-\Delta u=\frac{n(n-2)}{4}|u|^{\frac{4}{n-2}}u \mbox{ in }\mathcal{D}^{1,2}(\mathbb{R}^n).$$ If $n=3$, our solutions have maximal rank, being the first example in odd…
We study proportions of consecutive occurrences of permutations of a given size. Specifically, the feasible limits of such proportions on large permutations form a region, called feasible region. We show that this feasible region is a…
We present the two-loop corrected operator matrix elements calculated in N-dimensional regularization up to the finite terms which survive in the limit $\epsilon = N - 4 \to 0 $. The anomalous dimensions of the local operators have been…
We describe constructions of extended formulations that establish a certain relaxed version of the Hirsch conjecture and prove that if there is a pivot rule for the simplex algorithm for which one can bound the number of steps by a…
We prove that the extension complexity of the independence polytope of every regular matroid on $n$ elements is $O(n^6)$. Past results of Wong and Martin on extended formulations of the spanning tree polytope of a graph imply a $O(n^2)$…
An explicit construction of theories of spinning particles, both massive and massless, is given with arbitrary extended supersymmetry on the world-line. As an application of our results, we give a universal description of 3D (and via…
Using the modified factorization method employed by Mielnik for the harmonic oscillator, we show that isospectral structures associated with a second order operator $H$, can always be constructed whenever $H$ could be factored, or exist…
Using Littlewood's map, which decomposes a partition into its $r$-core and $r$-quotient, Han and Ji have shown that many well-known hook-length formulas admit modular analogues. In this paper we present a variant of the Han-Ji…
It is known that the $(2k-1)$-sphere has at most $2^{O(n^k \log n)}$ combinatorially distinct triangulations with $n$ vertices, for every $k\ge 2$. Here we construct at least $2^{\Omega(n^k)}$ such triangulations, improving on the previous…
We show that the largest possible diameter $\delta(d,k)$ of a $d$-dimensional polytope whose vertices have integer coordinates ranging between $0$ and $k$ is at most $kd-\lceil2d/3\rceil$ when $k\geq3$. In addition, we show that…
We consider a light-like Wilson loop in N=4 SYM evaluated on a regular n-polygon contour. Sending the number of edges to infinity the polygon approximates a circle and the expectation value of the light-like WL is expected to tend to the…
We discuss a refinement of triangular factorization for loops into SU(2).
We study the four-dimensional (4D) scalar potential arising from a generalized type IIA flux superpotential including the (non-)geometric fluxes. First, we show that using a set of peculiar flux combinations, the 4D scalar potential can be…
Multidimensional factorization method is formulated in arbitrary curvilinear coordinates. Particular cases of polar and spherical coordinates are considered and matrix potentials with separating variables are constructed. A new class of…
We discuss the structure of infrared singularities in on-shell QCD amplitudes with massive partons and present a general factorization formula in the limit of small parton masses. The factorization formula gives rise to an all-order…
We investigate the ``generalized Heron polynomial'' that relates the squared area of an n-gon inscribed in a circle to the squares of its side lengths. For a (2m+1)-gon or (2m+2)-gon, we express it as the defining polynomial of a certain…
Extending our prior investigation, we give a new off-shell construction of theories of spinning particles propagating in Minkowski spaces with arbitrary $N$-extended supersymmetry on the world-line. The basis of the new off-shell…
A lattice (d, k)-polytope is the convex hull of a set of points in dimension d whose coordinates are integers between 0 and k. Let {\delta}(d, k) be the largest diameter over all lattice (d, k)-polytopes. We develop a computational…
We develop cluster algorithms for a broad class of loop models on two-dimensional lattices, including several standard O(n) loop models at n \ge 1. We show that our algorithm has little or no critical slowing-down when 1 \le n \le 2. We use…