相关论文: Small Extended Formulations for Cyclic Polytopes
Factorization into spheres is achieved for skeleta of the simplex, cube, and cross-polytope, both explicitly and using Keevash's proof of existence of designs.
We explore a new form of DFT, which we call the Polynomial Transform. It functions over finite fields, and a size $n$ transform takes $O(n)$ operations. In the multitape Turing machine model, it allows us to multiply two $n$ bit numbers in…
We demonstrate a method for general linear optical networks that allows one to factorize any SU($n$) matrix in terms of two SU($n-1)$ blocks coupled by an SU(2) entangling beam splitter. The process can be recursively continued in an…
The Maxwell algebra, an enlargement of Poincare algebra by Abelian tensorial generators, can be obtained in arbitrary dimension D by the suitable contraction of O(D-1,1) \oplus O(D-1,2) (Lorentz algebra \oplus AdS algebra). We recall that…
We investigate factorisation at small x using a variety of analytical and numerical techniques. Previous results on factorisation in collinear models are generalised to the case of the full BFKL equation, and illustrated in the example of a…
We consider the QCD factorization of DIS structure functions at small x and amplitudes of 2->2 -hadronic forward scattering at high energy. We show that both collinear and k_T-factorization for these processes can be obtained approximately…
In this paper we give the enumeration formulas for Euclidean self-dual skew-cyclic codes over finite fields when $(n,|\theta|)=1$ and for some cases when $(n,|\theta|)>1,$ where $n$ is the length of the code and $|\theta|$ is the order of…
We calculate an effective Polyakov line action of QCD at large Nc and large Nf from a combined lattice strong coupling and hopping expansion working to second order in both, where the order is defined by the number of windings in the…
The factorization of nonlinear second-order differential equations proposed by Rosu and Cornejo-Perez in 2005 is extended to equations containing quadratic and cubic forms in the first derivative. A few illustrative examples encountered in…
This paper is devoted to the computation of the number of ordered factorizations of a long cycle in the symmetric group where the number of factors is arbitrary and the cycle structure of the factors is given. Jackson (1988) derived the…
We construct 2^{\Omega(n^{5/4})} combinatorial types of triangulated 3-spheres on n vertices. Since by a result of Goodman and Pollack (1986) there are no more than 2^{O(n log n)} combinatorial types of simplicial 4-polytopes, this proves…
We present a variational approach to a general Lienard-type equation in order to linearize it and, as an example, the Van der Pol oscillator is discussed. The new equation which is almost linear is factorized. The point symmetries of the…
We compute for the first time the two-loop corrections to arbitrary n-gon lightlike Wilson loops in N=4 supersymmetric Yang-Mills theory, using efficient numerical methods. The calculation is motivated by the remarkable agreement between…
We describe a provably complete algorithm for the generation of a tight, possibly exact superset of all combinatorially distinct simple n-facet polytopes in R^d, along with their graphs, f-vectors, and face lattices. The technique applies…
Recent work by Huang, Lewis, Morales, Reiner, and Stanton suggests that the regular elliptic elements of $\mathrm{GL}_n \mathbb{F}_q$ are somehow analogous to the $n$-cycles of the symmetric group. In 1981, Stanley enumerated the…
A manifestly Lorentz-covariant calculus based on two matrix-coordinates and their associated derivatives is introduced. It allows formulating relativistic field theories in any even-dimensional spacetime. The construction extends a…
Some widely known compact extended formulations have the property that each vertex of the corresponding extension polytope is projected onto a vertex of the target polytope. In this paper, we prove that for heptagons with vertices in…
An analogue of the Euclidean algorithm for square matrices of size 2 with integral non-negative entries and strictly positive determinant $n$ defines a finite set $\mathcal{R}(n)$ of Euclid-reduced matrices corresponding to elements of…
In this work, we study a class of skew cyclic codes over the ring $R:=\mathbb{Z}_4+v\mathbb{Z}_4,$ where $v^2=v,$ with an automorphism $\theta$ and a derivation $\Delta_\theta,$ namely codes as modules over a skew polynomial ring…
We investigate the minimum number of cycles of specified lengths in planar $n$-vertex triangulations $G$. It is proven that this number is $\Omega(n)$ for any cycle length at most $3 + \max \{ {\rm rad}(G^*), \lceil…