English
Related papers

Related papers: Asymmetric Unification and Disunification

200 papers

We extend to larger unification groups an earlier study exploring the possibility of unification of gauge symmetries in theories with dynamical symmetry breaking. Based on our results, we comment on the outlook for models that seek to…

High Energy Physics - Phenomenology · Physics 2008-11-26 Ning Chen , Robert Shrock

We analyze the computational complexity of several new variants of edge-matching puzzles. First we analyze inequality (instead of equality) constraints between adjacent tiles, proving the problem NP-complete for strict inequalities but…

For a nonautonomous linear system with nonuniform contraction, we construct a topological equivalence between this system and an unbounded nonlinear perturbation. This topological equivalence is constructed as a composition of…

Classical Analysis and ODEs · Mathematics 2020-01-13 I. Huerta

The following chapter deals with systems of differential equations with discontinuous right-hand sides. The key question is how to define the solutions of such systems. The most adequate approach is to treat discontinuous systems as systems…

Dynamical Systems · Mathematics 2018-03-14 Maria Kiseleva , Nikolay Kuznetsov , Gennady Leonov

The issue of asymmetric uncertainties resulting from fits, nonlinear propagation and systematic effects is reviewed. It is shown that, in all cases, whenever a published result is given with asymmetric uncertainties, the value of the…

Data Analysis, Statistics and Probability · Physics 2007-05-23 G. D'Agostini

A renormalization group method with the Lie symmetry is presented for the singular perturbation problems. Asymptotic solutions are obtained as group-invariant solutions under approximate Lie group admitted by perturbed differential…

Other Condensed Matter · Physics 2009-11-11 Masatomo Iwasa , Kazuhiro Nozaki

When a computer algebra system fails to solve an Ordinary Differential Equation, is this a limitation of its implementation, or a genuine computational barrier? Three traditions bear on the question. Modern computer algebra algorithms can…

Symbolic Computation · Computer Science 2026-05-11 Olivier Bournez , Alonso Núñez

A binary word is symmetric if it is a palindrome or an antipalindrome. We define a new measure of asymmetry of a binary word equal to the minimal number of letters of the word whose deleting from the word yields a symmetric word and obtain…

Combinatorics · Mathematics 2010-04-09 Alex Ravsky

We investigate bicomplex Hamiltonian systems in the framework of an analogous version of the Schrodinger equation. Since in such a setting three different types of conjugates of bicomplex numbers appear, each is found to define in a natural…

Mathematical Physics · Physics 2015-11-23 Bijan Bagchi , Abhijit Banerjee

We prove that there exist rational but not uniformly rational smooth algebraic varieties. The proof is based on computing a certain numerical obstruction developed in the case of compactifications of affine spaces. We show that for some…

Algebraic Geometry · Mathematics 2019-11-07 Ilya Karzhemanov

A physical theory of the world is presented under the unifying principle that all of nature is laid out before us and experienced through the passage of time. The one-dimensional progression in time is opened out into a multi-dimensional…

General Physics · Physics 2016-07-01 David J. Jackson

Linear differential equations of arbitrary order with polynomial coefficients are considered. Specifically, necessary and sufficient conditions for the existence of polynomial solutions of a given degree are obtained for these equations. An…

Mathematical Physics · Physics 2011-09-27 H. Azad , A. Laradji , M. T. Mustafa

We study two-stage adjustable robust linear programming in which the right-hand sides are uncertain and belong to a convex, compact uncertainty set. This problem is NP-hard, and the affine policy is a popular, tractable approximation. We…

Optimization and Control · Mathematics 2017-05-23 Guanglin Xu , Samuel Burer

Various forms of sorting problems have been studied over the years. Recently, two kinds of sorting puzzle apps are popularized. In these puzzles, we are given a set of bins filled with colored units, balls or water, and some empty bins.…

In this paper we establish asymptotic (biasymptotic) equivalence between spaces of solutions of a given linear homogeneous system and a perturbed system. The perturbations are of either linear or weakly linear characters. Existence of a…

Dynamical Systems · Mathematics 2007-05-23 M. U. Akhmet , M. A. Tleubergenova , A. Zafer

We provide symmetrization results in the form of mass concentration comparisons for fractional singular elliptic equations in bounded domains, coupled with homogeneous external Dirichlet conditions. Two types of comparison results are…

Analysis of PDEs · Mathematics 2022-11-16 Barbara Brandolini , Ida de Bonis , Vincenzo Ferone , Bruno Volzone

Interest in anti-unification, the dual problem of unification, is on the rise due to applications within the field of software analysis and related areas. For example, anti-unification-based techniques have found uses within clone detection…

Logic in Computer Science · Computer Science 2025-06-23 Mauricio Ayala-Rincon , David M. Cerna , Andres Felipe Gonzalez Barragan , Temur Kutsia

The role of dimensional regularization is discussed and compared with that of cut-off regularization in some quantum mechanical problems with ultraviolet divergence in two and three dimensions with special emphasis on the nucleon-nucleon…

Nuclear Theory · Physics 2009-10-31 Angsula Ghosh , Sadhan K. Adhikari , B. Talukdar

In this work, we extend the concept of Robinson spaces to asymmetric dissimilarities, enhancing their applicability in representing and analyzing complex data. Within this generalized framework, we introduce two different problems that…

Discrete Mathematics · Computer Science 2024-12-06 Francois Brucker , Pascal Préa , Christopher Thraves Caro

In this paper, we investigate problems which are dual to the unification problem, namely the Fixed Point (FP) problem, Common Term (CT) problem and the Common Equation (CE) problem for string rewriting systems. Our main motivation is…

Logic in Computer Science · Computer Science 2024-01-03 Zümrüt Akçam , Kimberly A. Cornell , Daniel S. Hono , Paliath Narendran , Andrew Pulver
‹ Prev 1 3 4 5 6 7 10 Next ›