Related papers: Weak symmetry breaking and abstract simplex paths
Methods of Lie group analysis of differential equations are extended to weak solutions of (linear and nonlinear) PDEs, where the term ``weak solution'' comprises the following settings: (a) Distributional solutions. (b) Solutions in…
We present a novel theoretical framework established by complex network analysis for understanding the phase transition beyond the Landau symmetry breaking paradigm. In this paper we take a two-dimensional metal-insulator transition driven…
Extending the lambda-calculus with a construct for sharing, such as let expressions, enables a special representation of terms: iterated applications are decomposed by introducing sharing points in between any two of them, reducing to the…
It has been recently suggested that a totally asymmetric exclusion process with two species on an open chain could exhibit spontaneous symmetry breaking in some range of the parameters defining its dynamics. The symmetry breaking is…
We consider a UV-complete field-theoretic model in general dimensions, including $d=2+1$, that exhibits spontaneous breaking of continuous symmetry, persisting to arbitrarily large temperatures. Our model consists of two copies of the…
Kim defined a very general combinatorial abstraction of the diameter of polytopes called subset partition graphs to study how certain combinatorial properties of such graphs may be achieved in lower bound constructions. Using Lov\'asz'…
In this paper, we present a simple combinatorial algorithm that solves symmetric diagonally dominant (SDD) linear systems in nearly-linear time. It uses very little of the machinery that previously appeared to be necessary for a such an…
We study the weak solvability of a nonlinearly coupled system of parabolic and pseudo-parabolic equations describing the interplay between mechanics, chemical reactions, diffusion and flow in a mixture theory framework. Our approach relies…
A fertile area of recent research has demonstrated concrete polynomial time lower bounds for solving natural hard problems on restricted computational models. Among these problems are Satisfiability, Vertex Cover, Hamilton Path, Mod6-SAT,…
We illustrate the use of intersection types as a semantic tool for showing properties of the lattice of lambda theories. Relying on the notion of easy intersection type theory we successfully build a filter model in which the interpretation…
In this paper we discuss a disordered $d$-dimensional Euclidean $\lambda\varphi^{4}$ model. The dominant contribution to the average free energy of this system is written as a series of the replica partition functions of the model. In each…
We study distributed composite optimization over networks: agents minimize a sum of smooth (strongly) convex functions, the agents' sum-utility, plus a nonsmooth (extended-valued) convex one. We propose a general unified algorithmic…
In the underlying Planck scale theory we introduce a certain type of discrete symmetry, which potentially brings the stability of the weak-scale hierarchy under control. Under the discrete symmetry the $\mu $-problem and the tadpole problem…
With this work we aim to show how Mathematica can be a useful tool to investigate properties of combinatorial structures. Specifically, we will face enumeration problems on independent subsets of powers of paths and cycles, trying to…
We prove nonuniqueness of weak solutions to multi-dimensional generalisation of the Aw-Rascle model of vehicular traffic. Our generalisation includes the velocity offset in a form of gradient of density function, which results in a…
We establish a framework for the study of the effective theory of weak convergence of measures. We define two effective notions of weak convergence of measures on $\mathbb{R}$: one uniform and one non-uniform. We show that these notions are…
This paper establishes a connection between a problem in Potential Theory and Mathematical Physics, arranging points so as to minimize an energy functional, and a problem in Combinatorics and Number Theory, constructing 'well-distributed'…
We propose an efficient novel path sampling-based framework designed to accelerate the investigation of rare events in complex molecular systems. A key innovation is the shift from sampling restricted path ensemble distributions, as in…
In this paper, a general hybrid fixed point theorem for the contractive mappings in generalized Banach spaces is proved via measure of weak non-compactness and it is further applied to fractional integral equations for proving the existence…
We give an efficient algorithm for finding sparse approximate solutions to linear systems of equations with nonnegative coefficients. Unlike most known results for sparse recovery, we do not require {\em any} assumption on the matrix other…