Related papers: Breaking Generator Symmetry
In the context of Answer Set Programming, this paper investigates symmetry-breaking to eliminate symmetric parts of the search space and, thereby, simplify the solution process. We propose a reduction of disjunctive logic programs to a…
Representing graphs by their homomorphism counts has led to the beautiful theory of homomorphism indistinguishability in recent years. Moreover, homomorphism counts have promising applications in database theory and machine learning, where…
The PMNS matrix displays an obvious symmetry, but not exact. There are several textures proposed in literature, which possess various symmetry patterns and seem to originate from different physics scenarios at high energy scales. To be…
Many classical constructions, such as Plotkin's and Turyn's, were generalized by matrix product (MP) codes. Quasi-twisted (QT) codes, on the other hand, form an algebraically rich structure class that contains many codes with best-known…
Generators of SO(8) group have been described by using direct product of the Gamma matrices and the Pauli Sigma matrices. We have obtained these generators in terms of generalized split octonion also. These generators have been used to…
We consider the problem of training generative models with deep neural networks as generators, i.e. to map latent codes to data points. Whereas the dominant paradigm combines simple priors over codes with complex deterministic models, we…
An effective method for generating linear equations of maximal symmetry in their much general normal form is obtained. In the said normal form, the coefficients of the equation are differential functions of the coefficient of the term of…
We consider the symmetric Toeplitz matrix completion problem, whose matrix under consideration possesses specific row and column structures. This problem, which has wide application in diverse areas, is well-known to be computationally…
This paper investigates why and when the edge-based districting problem becomes computationally intractable. The overall problem is represented as an exact mathematical programming formulation consisting of an objective function and several…
This paper describes the synthesis of matrices with good correlation, from cyclic shifts of pseudonoise columns. Optimum matrices result whenever the shift sequence satisfies the constant difference property. Known shift sequences with the…
A conservative class of constraint satisfaction problems CSPs is a class for which membership is preserved under arbitrary domain reductions. Many well-known tractable classes of CSPs are conservative. It is well known that lexleader…
Analog layout synthesis requires some elements in the circuit netlist to be matched and placed symmetrically. However, the set of symmetries is very circuit-specific and a versatile algorithm, applicable to a broad variety of circuits, has…
Symmetries are fundamental to dynamical processes in complex networks such as cluster synchronization, which have attracted a great deal of current research. Finding symmetric nodes in large complex networks, however, has relied on…
We obtain new explicit pseudorandom generators for several computational models involving groups. Our main results are as follows: 1. We consider read-once group-products over a finite group $G$, i.e., tests of the form $\prod_{i=1}^n…
Matroids, particularly linear ones, have been a powerful tool in parameterized complexity for algorithms and kernelization. They have sped up or replaced dynamic programming. Delta-matroids generalize matroids by encapsulating structures…
We consider a supersymmetric matrix model which is related to the non-critical superstring theory. We find new non-singlet terms in the supersymmetric matrix quantum mechanics. The new non-singlet terms give rise to nontrivial interactions.…
2$\leftrightarrow$3 symmetry is realized by the breaking from alterating group of degree 4 ($A4$) symmetry. $A4$ explains why the generation number is three. However the mass matrices are realized in the form of the breaking to…
A new method to construct event-generators based on next-to-leading order QCD matrix-elements and leading-logarithmic parton showers is proposed. Matrix elements of loop diagrams as well as those of a tree level can be generated using an…
We study the problems of multi-person pose segmentation in natural images and instance segmentation in biological images with crowded cells. We formulate these distinct tasks as integer programs where variables correspond to poses/cells. To…
Efficient omission of symmetric solution candidates is essential for combinatorial problem-solving. Most of the existing approaches are instance-specific and focus on the automatic computation of Symmetry Breaking Constraints (SBCs) for…