相关论文: One-way permutations, computational asymmetry and …

We study aspects of the enumeration of permutation classes, sets of permutations closed downwards under the subpermutation order. First, we consider monotone grid classes of permutations. We present procedures for calculating the generating…

We introduce symmetric arithmetic circuits, i.e. arithmetic circuits with a natural symmetry restriction. In the context of circuits computing polynomials defined on a matrix of variables, such as the determinant or the permanent, the…

We show that integral representation of universal volume function of compact simple Lie groups gives rise to six analytic functions on $CP^2$, which transform as two triplets under group of permutations of Vogel's projective parameters.…

Boolean matching is an important problem in logic synthesis and verification. Despite being well-studied for conventional Boolean circuits, its treatment for reversible logic circuits remains largely, if not completely, missing. This work…

Consider the representations of an algebraic group G. In general, polynomial invariant functions may fail to separate orbits. The invariant subring may not be finitely generated, or the number and complexity of the generators may grow…

The group algebra of the permutation group is spanned by a set of elements called projectors. The coordinates of permutations expanded in projectors are matrix elements of irreducible representations. The projectors of the permutation group…

Symmetry is conventionally described in a contrariety manner that the system is either completely symmetric or completely asymmetric. Using group theoretical approach to overcome this dichotomous problem, we introduce the degree of symmetry…

Many computational problems are unchanged under some symmetry operation. In classical machine learning, this can be reflected with the layer structure of the neural network. In quantum machine learning, the ansatz can be tuned to correspond…

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 a Sinkhorn-type algorithm for producing quantum permutation matrices encoding symmetries of graphs. Our algorithm generates square matrices whose entries are orthogonal projections onto one-dimensional subspaces satisfying a…

We investigate the complexity of uniform OR circuits and AND circuits of polynomial-size and depth. As their name suggests, OR circuits have OR gates as their computation gates, as well as the usual input, output and constant (0/1) gates.…

Gauge theories are important descriptions for many physical phenomena and systems in quantum computation. Automorphism of gauge group naturally gives global symmetries of gauge theories. In this work we study such symmetries in gauge…

We consider random permutations on $\Sn$ with logarithmic growing cycles weights and study asymptotic behavior as the length $n$ tends to infinity. We show that the cycle count process converges to a vector of independent Poisson variables…

The Galois/monodromy group of a family of geometric problems or equations is a subtle invariant that encodes the structure of the solutions. Computing monodromy permutations using numerical algebraic geometry gives information about the…

We perform a comprehensive study of a certain class of discrete symmetries of families of Feynman integrals, defined as affine changes of variables that map different sectors of the family into each other. We show that these transformations…

Symmetry plays a crucial role in understanding the properties of mathematical structures and optimization problems. Recent work has explored this phenomenon in the context of neural networks, where the loss function is invariant under…

A symmetric pseudo-Boolean function is a map from Boolean tuples to real numbers which is invariant under input variable interchange. We prove that any such function can be equivalently expressed as a power series or factorized. The kernel…

We introduce a new theoretical framework for deriving lower bounds on data movement in bilinear algorithms. Bilinear algorithms are a general representation of fast algorithms for bilinear functions, which include computation of matrix…

Symmetry plays a fundamental role in understanding natural phenomena and mathematical structures. This work develops a comprehensive theory for studying the persistent symmetries and degree of asymmetry of finite point configurations over…

Permutation codes have recently garnered substantial research interest due to their potential in various applications including cloud storage systems, genome resequencing and flash memories. In this paper, we study the theoretical bounds…