Related papers: Cooperativity, Absolute Interaction, and Algebraic…
We formulate the problem of learning to imitate multiple, non-deterministic teachers with minimal interaction cost. Rather than learning a specific policy as in standard imitation learning, the goal in this problem is to learn a…
Consider the polynomial optimization problem whose objective and constraints are all described by multivariate polynomials. Under some genericity assumptions, %% on these polynomials, we prove that the optimality conditions always hold on…
We consider the problem of directly optimizing a non-linear function of an outcome, where this outcome itself is the sum of many small contributions. The non-linearity of the function means that the problem is not equivalent to the…
A newly proposed chemical-reaction-inspired metaheurisic, Chemical Reaction Optimization (CRO), has been applied to many optimization problems in both discrete and continuous domains. To alleviate the effort in tuning parameters, this paper…
Dynamic properties of chemical reactions and appropriate relationships for open chemical equilibrium are discussed in approach of the chemical dynamics. New way to calculate composition of chemical systems in open equilibrium, based on the…
We introduce partial group algebras with relations in a purely algebraic framework. Given a group and a set of relations, we define an algebraic partial action and prove that the resulting partial skew group ring is isomorphic to the…
Mutual localization is essential for coordination and cooperation in multi-robot systems. Previous works have tackled this problem by assuming available correspondences between measurements and received odometry estimations, which are…
In this paper, we characterize suitable partial (co)actions of Taft and Nichols Hopf algebras on algebras, and moreover we get that such partial (co)actions are symmetric. For certain algebras, these partial (co)actions obtained are,…
A coaction d of a locally compact group G on a C*-algebra A is maximal if a certain natural map from A times_d G times_{d hat} G onto A otimes K(L^2(G)) is an isomorphism. All dual coactions on full crossed products by group actions are…
With the growing size of data sets, feature selection becomes increasingly important. Taking interactions of original features into consideration will lead to extremely high dimension, especially when the features are categorical and…
The determination of the effective Coulomb interactions to be used in low-energy Hamiltonians for materials with strong electronic correlations remains one of the bottlenecks for parameter-free electronic structure calculations. We propose…
This manuscript is inspired by the paper [2]. In the paper, they investigate a method to detect existence of an object with arbitrarily small interaction. Below, we sketch their protocol to motivate the present manuscript. The object of…
We use a coproduct on the time-ordered algebra of field operators to derive simple relations between complete, connected and 1-particle irreducible n-point functions. Compared to traditional functional methods our approach is much more…
The calculations of the elementary atom (the Coulomb bound state of elementary particles) interaction with the atom of matter, which are performed in the Born approximation, are reviewed. We first discuss the nonrelativistic approach and…
We present a new algorithm for reconstructing an exact algebraic number from its approximate value using an improved parameterized integer relation construction method. Our result is consistent with the existence of error controlling on…
Understanding the quantum dynamics of spin defects and their coherence properties requires accurate modeling of spin-spin interaction in solids and molecules, for example by using spin Hamiltonians with parameters obtained from…
This paper aims to maximize algebraic connectivity of networks via topology design under the presence of constraints and an adversary. We are concerned with three problems. First, we formulate the concave maximization topology design…
Inspired by so many possible applications of this class of problems, we seek solution for non-cooperative elliptic systems of two Schrodinger equations. General conditions are assumed under the potentials, which produces convenient…
Chemical reaction network theory provides powerful tools for rigorously understanding chemical reactions and the dynamical systems and differential equations that represent them. A frequent issue with mathematical analyses of these networks…
We prove a Pumping Lemma for the noncooperative abstract Tile Assembly Model, a model central to the theory of algorithmic self-assembly since the beginning of the field. This theory suggests, and our result proves, that small differences…