English
Related papers

Related papers: Application of canonical augmentation to the atomi…

200 papers

Configuring consists in simulating the realization of a complex product from a catalog of component parts, using known relations between types, and picking values for object attributes. This highly combinatorial problem in the field of…

Artificial Intelligence · Computer Science 2007-05-23 Stephane Grandcolas , Laurent Henocque , Nicolas Prcovic

A careful study of the classical/quantum connection with the aid of coherent states offers new insights into various technical problems. This analysis includes both canonical as well as closely related affine quantization procedures. The…

High Energy Physics - Theory · Physics 2015-06-12 John R. Klauder

In this paper, we study the construction of structural models for the description of substitutional defects in crystalline materials. Predicting and designing the atomic structures in such systems is highly challenging due to the…

Computational Physics · Physics 2025-07-04 Xiaoxu Li , Ge Xu , Huajie Chen , Xingyu Gao , Haifeng Song

The rules of canonical quantization normally offer good results, but sometimes they fail, e.g., leading to quantum triviality ($=$ free) for certain examples that are classically nontrivial ($\ne$ free). A new procedure, called Enhanced…

Quantum Physics · Physics 2018-11-26 John R. Klauder

Generating irreducible site-occupancy configurations by taking advantage of crystal symmetry is a ubiquitous method for accelerating of disordered structure prediction, which plays an important role in condensed matter physics and material…

Computational Physics · Physics 2020-10-28 Ji-Chun Lian , Hong-Yu Wu , Wei-Qing Huang , Wangyu Hu , Gui-Fang Huang

Modeling potential alloys requires the exploration of all possible configurations of atoms. Additionally, modeling the thermal properties of materials requires knowledge of the possible ways of displacing the atoms. One solution to finding…

Materials Science · Physics 2017-01-11 Wiley S. Morgan , Gus L. W. Hart , Rodney W. Forcade

Classical atomistic simulations based on interatomic potentials resolve lattice instabilities, defect nucleation, and microstructure evolution with high fidelity, but their accessible system sizes remain far below those required for…

Numerical Analysis · Mathematics 2026-05-26 Aagashram Neelakandan , Karsten Albe , Bernhard Eidel

The nonlinear supersymmetry of one-dimensional systems is investigated in the context of the quantum anomaly problem. Any classical supersymmetric system characterized by the nonlinear in the Hamiltonian superalgebra is symplectomorphic to…

High Energy Physics - Theory · Physics 2009-10-31 Sergey Klishevich , Mikhail Plyushchay

A theoretical scheme for the treatment of an open molecular system with electrons and nuclei is proposed. The idea is based on the Grand Canonical description of a quantum region embedded in a classical reservoir of molecules. Electronic…

Statistical Mechanics · Physics 2018-01-17 Luigi Delle Site

This paper presents a canonical duality approach for solving a general topology optimization problem of nonlinear elastic structures. By using finite element method, this most challenging problem can be formulated as a mixed integer…

Discrete Mathematics · Computer Science 2017-06-29 David Yang Gao

Assembly Theory, as developed by Cronin and co-workers, assigns to an object an assembly index: the minimal number of binary join operations required to build at least one copy of the object from a specified set of basic building blocks,…

Formal Languages and Automata Theory · Computer Science 2026-02-06 Piotr Masierak

By introducing a quadratic perturbation to the canonical dual of the maxcut problem, we transform the integer programming problem into a concave maximization problem over a convex positive domain under some circumstances, which can be…

Optimization and Control · Mathematics 2012-10-16 Xiaojun Zhou

Let $\C$ be a sequence of multisets of subspaces of a vector space $\F_q^k$. We describe a practical algorithm which computes a canonical form and the stabilizer of $\C$ under the group action of the general semilinear group. It allows us…

Information Theory · Computer Science 2013-05-07 Thomas Feulner

This paper discusses and evaluates ideas of data balancing and data augmentation in the context of mathematical objects: an important topic for both the symbolic computation and satisfiability checking communities, when they are making use…

Symbolic Computation · Computer Science 2023-08-21 Tereso del Rio , Matthew England

Atomistic-to-Continuum (AtC) coupling methods are a novel means of computing the properties of a discrete crystal structure, such as those containing defects, that combine the accuracy of an atomistic (fully discrete) model with the…

Numerical Analysis · Mathematics 2013-09-25 Derek Olson , Pavel Bochev , Mitchell Luskin , Alexander V. Shapeev

The canonical duality theory has provided with a unified analytic solution to a range of discrete and continuous problems in global optimization, which can transform a nonconvex primal problem to a concave maximization dual problem over a…

Optimization and Control · Mathematics 2012-10-04 Xiaojun Zhou

We propose an algorithm for classification of linear codes over different finite fields based on canonical augmentation. We apply this algorithm to obtain classification results over fields with 2, 3 and 4 elements.

Discrete Mathematics · Computer Science 2019-07-25 Iliya Bouyukliev , Stefka Bouyuklieva

The development of tailored materials for specific applications is an active field of research in chemistry, material science and drug discovery. The number of possible molecules that can be obtained from a set of atomic species grow…

We consider set covering problems where the underlying set system satisfies a particular replacement property w.r.t. a given partial order on the elements: Whenever a set is in the set system then a set stemming from it via the replacement…

Discrete Mathematics · Computer Science 2015-03-17 Friedrich Eisenbrand , Naonori Kakimura , Thomas Rothvoß , Laura Sanità

The well-founded semantics is one of the most widely studied and used semantics of logic programs with negation. In the case of finite propositional programs, it can be computed in polynomial time, more specifically, in O(|At(P)|size(P))…

Logic in Computer Science · Computer Science 2007-05-23 Zbigniew Lonc , Miroslaw Truszczynski
‹ Prev 1 2 3 10 Next ›