Related papers: The LP Relaxation Orthogonal Array Polytope and it…
The concept of p-orthogonality (1=< p =< n) between n-particle states is introduced. It generalizes common orthogonality, which is equivalent to n-orthogonality, and strong orthogonality between fermionic states, which is equivalent to…
A permutiple is a natural number whose representation in some base, $b>1$, is an integer multiple of a number whose base-$b$ representation has the same collection of digits. Previous efforts have made progress in finding such numbers using…
Statistical inference problems arising within signal processing, data mining, and machine learning naturally give rise to hard combinatorial optimization problems. These problems become intractable when the dimensionality of the data is…
Automating the solutions of multiple network information theory problems, stretching from fundamental concerns such as determining all information inequalities and the limitations of linear codes, to applied ones such as designing coded…
In recent work, Rosenbaum and Wagner showed that isomorphism of explicitly listed $p$-groups of order $n$ could be tested in $n^{\frac{1}{2}\log_p n + O(p)}$ time, roughly a square root of the classical bound. The $O(p)$ term is entirely…
We consider families of symmetric linear programs (LPs) that decide a property of graphs (or other relational structures) in the sense that, for each size of graph, there is an LP defining a polyhedral lift that separates the integer points…
Motivated by proving the loss of ergodicity in expanding systems of piecewise affine coupled maps with arbitrary number of units, all-to-all coupling and inversion symmetry, we provide ad-hoc substitutes - namely inversion-symmetric maps of…
We study creating and analyzing symmetry and broken symmetry in digital art. Our focus is not so much on computer-generating artistic images, but rather on analyzing concepts and templates for incorporating symmetry and symmetry breaking…
We introduce reflexive polytopes of index l as a natural generalisation of the notion of a reflexive polytope of index 1. These l-reflexive polytopes also appear as dual pairs. In dimension two we show that they arise from reflexive…
In 1991, Yannakakis (J. Comput. System Sci., 1991) proved that no symmetric extended formulation for the matching polytope of the complete graph K_n with n nodes has a number of variables and constraints that is bounded subexponentially in…
In the literature, the matchings between spacetimes have been most of the times implicitly assumed to preserve some of the symmetries of the problem involved. But no definition for this kind of matching was given until recently. Loosely…
The spaces of flattenings of a simplicial sphere played a key role in the study of existence and uniqueness of differentiable structures on a simplicial sphere. In this paper, we will establish that the spaces of flattenings of some…
This paper proposes tight semidefinite relaxations for polynomial optimization. The optimality conditions are investigated. We show that generally Lagrange multipliers can be expressed as polynomial functions in decision variables over the…
We revisit the residual symmetries that survive the orbifold projections, and find additional transformations that have been overlooked in the past. Some of these transformations are outer automorphisms of the downstairs continuous symmetry…
Uniform covers with a finite-dimensional nerve are rare (i.e., do not form a cofinal family) in many separable metric spaces of interest. To get hold on uniform homotopy properties of these spaces, a reasonably behaved notion of an…
The randomly pinned planar flux line array is supposed to show a phase transition to a vortex glass phase at low temperatures. This transition has been examined by using a mapping onto a 2D XY-model with random an\-iso\-tropy but without…
In this paper, we study properties and patterns on permutations of multisets whose multivariate generating functions are symmetric. We interpret this phenomenon through the lens of group actions and define such a property or pattern as…
Any permutation statistic $f:\sym\to\CC$ may be represented uniquely as a, possibly infinite, linear combination of (classical) permutation patterns: $f= \Sigma_\tau\lambda_f(\tau)\tau$. To provide explicit expansions for certain…
The weight systems of finite-dimensional representations of complex, simple Lie algebras exhibit patterns beyond Weyl-group symmetry. These patterns occur because weight systems can be decomposed into lattice polytopes in a natural way.…
Correlation factors are constructed that are consistent with the permutation symmetry group of N Fermions at given value of the filling factor.