Related papers: Complete Symmetry Breaking for Finite Models
A quantitative measure of symmetry breaking is introduced that allows the quantification of which symmetries are most strongly broken due to the introduction of some kind of defect in a perfect structure. The method uses a statistical…
Let $\Lambda$ be a finite-dimensional associative algebra over a field. A semibrick pair is a finite set of $\Lambda$-modules for which certain Hom- and Ext-sets vanish. A semibrick pair is completable if it can be enlarged so that a…
Finite symmetries abound in particle physics, from the weak doublets and generation triplets to the baryon octet and many others. These are usually studied by starting from a Lie group, and breaking the symmetry by choosing a particular…
We describe the structure of module categories of finite dimensional algebras over an algebraically closed field for which the cycles of nonzero nonisomorphisms between indecomposable finite dimensional modules are finite (do not belong to…
We deal with equations over free semilattice of infinite rank and prove that any infinite consistent system of equations is equivalent to its finite subsystem. Moreover, we describe irreducible algebraic sets and solve some algorithmic…
In this introductory lecture, some basic features of the spontaneous symmetry breaking are discussed. More specifically, $\sigma $-model, non-linear realization, and some examples of spontaneous symmetry breaking in the non-relativistic…
En esta serie de tres articulos, damos una exposicion de varios resultados y problemas abiertos en tres areas de la combinatoria algebraica y geometrica: las matrices totalmente no negativas, las representaciones del grupo simetrico, y los…
If supersymmetric particles are discovered, an important problem will be to determine how supersymmetry has been broken. At collider energies, supersymmetry breaking can be parameterised by soft supersymmetry breaking parameters. Several…
Automatic structures are finitely presented structures where the universe and all relations can be recognized by finite automata. It is known that the isomorphism problem for automatic structures is complete for $\Sigma^1_1$; the first…
We define a class of algebras describing links of binary semi-isolating formulas on a set of realizations for a family of 1-types of a complete theory. These algebras include algebras of isolating formulas considered before. We prove that a…
Left invariant affine structures in a Lie group $G$ are in one-to-one correspondence with left-symmetric algebras over its Lie algebra $\mathfrak g=T_eG$ (``over'' means that the commutator $[x,y]=xy-yx$ coincides with the Lie bracket;…
In this paper we define infinite-dimensional algebra and its representation, whose basis is naturally identified with semi-infinite configurations of the square ladder model. We also extrapolate the ideas for the cyclic 3-leg triangular…
Building on the classification of modules for algebraic groups with finitely many orbits on subspaces, we determine all faithful irreducible modules for simple and maximal-semisimple connected algebraic groups that are orthogonal and have…
We survey the theory of totally symmetric sets, with applications to homomorphisms of symmetric groups, braid groups, linear groups, and mapping class groups.
We propound the thesis that there is a limitation to the number of possible structures which are axiomatically endowed with identities involving operations. In the case of algebras with a binary operation satisfying a formally reducible (to…
We study the existence of automatic presentations for various algebraic structures. An automatic presentation of a structure is a description of the universe of the structure by a regular set of words, and the interpretation of the…
The class of finitely presented algebras over a field $K$ with a set of generators $a_{1},..., a_{n}$ and defined by homogeneous relations of the form $a_{1}a_{2}... a_{n} =a_{\sigma (a)} a_{\sigma (2)} ... a_{\sigma (n)}$, where $\sigma$…
We develop methods to study the scalar sector of multi-Higgs models with large discrete symmetry groups that are softly broken. While in the exact symmetry limit, the model has very few parameters and can be studied analytically,…
Symmetry is an important feature of many constraint programs. We show that any symmetry acting on a set of symmetry breaking constraints can be used to break symmetry. Different symmetries pick out different solutions in each symmetry…
We consider several classes of complete intersection numerical semigroups, aris- ing from many different contexts like algebraic geometry, commutative algebra, coding theory and factorization theory. In particular, we determine all the…