Related papers: Static Symmetry Breaking in Many-Sorted Finite Mod…

In this paper, we study the MapReduce framework from an algorithmic standpoint and demonstrate the usefulness of our approach by designing and analyzing efficient MapReduce algorithms for fundamental sorting, searching, and simulation…

We propose a novel logic, called Frame Logic (FL), that extends first-order logic (with recursive definitions) using a construct Sp(.) that captures the implicit supports of formulas -- the precise subset of the universe upon which their…

Symmetry in mathematical optimisation is of broad and current interest. In problem classes such as mixed-integer linear programming (MILP), equivalent solutions created by symmetric variables and constraints may combinatorially increase the…

We consider the ground state of a one-dimensional critical quantum system carrying a global symmetry in the bulk, which is explicitly broken by its boundary conditions. We probe the system via a string-order parameter, showing how it…

We propose a methodology to analyze synchronization in an ensemble of diffusively coupled multistable systems. First, we study how two bidirectionally coupled multistable oscillators synchronize and demonstrate the high complexity of the…

We consider the question of determining whether or not a given system of fractional-order differential equations is (asymptotically) stable. In particular, we admit systems where each constituent equation may have its own order, independent…

In this paper, we study a class of stochastic and finite-sum convex optimization problems with deterministic constraints. Existing methods typically aim to find an $\epsilon$-$expectedly\ feasible\ stochastic\ optimal$ solution, in which…

The first order condition of the constrained minimization problem leads to a saddle point problem. A multigrid method using a multiplicative Schwarz smoother for saddle point problems can thus be interpreted as a successive subspace…

Multiphase ranking functions ($\mathit{M{\Phi}RFs}$) were proposed as a means to prove the termination of a loop in which the computation progresses through a number of "phases", and the progress of each phase is described by a different…

We introduce a new class of "filtered" schemes for some first order non-linear Hamilton-Jacobi-Bellman equations. The work follows recent ideas of Froese and Oberman (SIAM J. Numer. Anal., Vol 51, pp.423-444, 2013). The proposed schemes are…

This work deals with defect structures in models described by scalar fields. The investigations focus on generalized models, with the kinetic term modified to allow for a diversity of possibilities. We develop a new framework, in which we…

In this paper, we investigate the possibility of improvement of the widely-used filtering algorithm for the linear constraints in constraint satisfaction problems in the presence of the alldifferent constraints. In many cases, the fact that…

We present parametric breadth-first search (PBFS), a new algorithm for solving the parametric minimum cut problem in a network with source-sink-monotone capacities. The objective is to find the set of breakpoints, i.e., the points at which…

First-order methods (FOMs) have recently been applied and analyzed for solving problems with complicated functional constraints. Existing works show that FOMs for functional constrained problems have lower-order convergence rates than those…

Symmetry in combinatorial problems is an extensively studied topic. We continue this research in the context of model expansion problems, with the aim of automating the workflow of detecting and breaking symmetry. We focus on local domain…

The convex feasibility problem (CFP) is to find a feasible point in the intersection of finitely many convex and closed sets. If the intersection is empty then the CFP is inconsistent and a feasible point does not exist. However,…

Investigation of well-motivated parameter space in the theories of Beyond the Standard Model (BSM) plays an important role in new physics discoveries. However, a large-scale exploration of models with multi-parameter or equivalent solutions…

In this paper we use a splitting technique to develop new multiscale basis functions for the multiscale finite element method (MsFEM). The multiscale basis functions are iteratively generated using a Green's kernel. The Green's kernel is…

Quantitative properties of stochastic systems are usually specified in logics that allow one to compare the measure of executions satisfying certain temporal properties with thresholds. The model checking problem for stochastic systems with…

This paper introduces a SAT-based technique that calculates a compact and complete symmetry-break for finite model finding, with the focus on structures with a single binary operation (magmas). Classes of algebraic structures are typically…