相关论文: Breaking Symmetry with Different Orderings

Conventional approaches to supersymmetric model building suffer from several naturalness problems: they do not explain the large hierarchy between the weak scale and the Planck mass, and they require fine tuning to avoid large flavor…

In two dimensions, quenched disorder always rounds transitions involving the breaking of spatial symmetries so, in practice, it can often be difficult to infer what form the symmetry breaking would take in the ``ideal,'' zero disorder…

Given a zero-dimensional ideal I in K[x1,...,xn] of degree D, the transformation of the ordering of its Groebner basis from DRL to LEX is a key step in polynomial system solving and turns out to be the bottleneck of the whole solving…

We investigate the stopping redundancy hierarchy of linear block codes and its connection to permutation decoding techniques. An element in the ordered list of stopping redundancy values represents the smallest number of possibly linearly…

We introduce a rich model for multi-objective clustering with lexicographic ordering over objectives and a slack. The slack denotes the allowed multiplicative deviation from the optimal objective value of the higher priority objective to…

We propose a novel method for multi-objective motion planning problems by leveraging the paradigm of lexicographic optimization and applying it for the first time to graph search over probabilistic roadmaps. The competing resources of…

In this work we construct a low-order nonconforming approximation method for linear elasticity problems supporting general meshes and valid in two and three space dimensions. The method is obtained by hacking the Hybrid High-Order method,…

Rounding linear programs using techniques from discrepancy is a recent approach that has been very successful in certain settings. However this method also has some limitations when compared to approaches such as randomized and iterative…

Lie symmetry analysis is one of the powerful tools to analyze nonlinear ordinary differential equations. We review the effectiveness of this method in terms of various symmetries. We present the method of deriving Lie point symmetries,…

We study the modulus mediation of supersymmetry breaking motivated by superstring theory. We show that the renormalization group running of the soft supersymmetry breaking parameters due to the interactions of massive fields is canceled by…

Discovering a concise schema from given XML documents is an important problem in XML applications. In this paper, we focus on the problem of learning an unordered schema from a given set of XML examples, which is actually a problem of…

In this paper we expand the concept of biological speciation by symmetry breaking of Golubitsky and Stewart to the case of three clades in which N populations following the same dynamical laws can separate. The underlying differential…

Introduced by Reading, the shard intersection order of a finite Coxeter group $W$ is a lattice structure on the elements of $W$ that contains the poset of noncrossing partitions $NC(W)$ as a sublattice. Building on work of Bancroft in the…

Bitmap indexes are frequently used to index multidimensional data. They rely mostly on sequential input/output. Bitmaps can be compressed to reduce input/output costs and minimize CPU usage. The most efficient compression techniques are…

Optimization solvers based on methods from constraint programming (OR-Tools, Chuffed, Gecode), optimization modulo theory (Z3), and mathematical programming (CPLEX) are successfully applied nowadays to solve many non-trivial examples.…

We introduce novel methods for encoding acyclicity and s-t-reachability constraints for propositional formulas with underlying directed graphs. They are based on vertex elimination graphs, which makes them suitable for cases where the…

Transforming an asymmetric system into a symmetric system makes it possible to exploit the simplifying properties of symmetry in control problems. We define and characterize the family of symmetrizable systems, which can be transformed into…

We construct Gray codes over permutations for the rank-modulation scheme, which are also capable of correcting errors under the infinity-metric. These errors model limited-magnitude or spike errors, for which only single-error-detecting…

We examine the reductions of the order of certain third- and second-order nonlinear equations with arbitrary nonlinearity through their symmetries and some appropriate transformations. We use the folding transformation which enables one to…

There are many complex combinatorial problems which involve searching for an undirected graph satisfying given constraints. Such problems are often highly challenging because of the large number of isomorphic representations of their…