prompt_front: Now, answer the following question based on the text below, only give me the answer and do not output any other words.

Question: When did Margaret Way start self-publishing her books as e-books?

Read the following text and answer briefly.

Context 1: Margaret Way (b  Brisbane d  Cleveland, Queensland, Australia ) was an Australian writer of romance novels and women's fiction  A prolific author, Way wrote more than 120 novels since 1970, many through Mills & Boon, a romance imprint of British publisher Harlequin UK Ltd , owned by Harlequin Enterprises 

Biography
Before her marriage, she was a well-known pianist, teacher, vocal coach and accompanist  She began writing when her son, Laurence Way, was born, a friend took a pile of Mills & Boon books to her, she read all and decided that she also could write these types of novels  She began to write and promote her country with her stories set in Australia  She sold her first novels in 1970  Margaret Way lives with her family in her native Brisbane  Beginning in 2013, Margaret began to self-publish, releasing her first "e-book" mid-July 

Margaret died on the 10th of August 2022 in Cleveland, Queensland 

Bibliography

Single Novels
King Country (1970)
Blaze of Silk (1970)
The Time of the Jacaranda (1970)
Bauhinia Junction (1971)
Man from Bahl Bahla (1971)
Summer Magic (1971)
Return to Belle Amber (1971)
Ring of Jade (1972)
Copper Moon (1972)
Rainbow Bird (1972)
Man Like Daintree (1972)
Noonfire (1972)
Storm Over Mandargi (1973)
Wind River (1973)
Love Theme (1974)
McCabe's Kingdom (1974)
Sweet Sundown (1974)
Reeds of Honey (1975)
Storm Flower (1975)
Lesson in Loving (1975)
Flight into Yesterday (1976)
Red Cliffs of Malpara (1976)
Man on Half-moon (1976)
Swan's Reach (1976)
Mutiny in Paradise (1977)
One Way Ticket (1977)
Portrait of Jaime (1977)
Black Ingo (1977)
Awakening Flame (1978)
Wild Swan (1978)
Ring of Fire (1978)
Wake the Sleeping Tiger (1978)
Valley of the Moon (1979)
White Magnolia (1979)
Winds of Heaven (1979)
Blue Lotus (1979)
Butterfly and the Baron (1979)
Golden Puma (1980)
Temple of Fire (1980)
Lord of the High Valley (1980)
Flamingo Park (1980)
North of Capricorn (1981)
Season for Change (1981)
Shadow Dance (1981)
McIvor Affair (1981)
Home to Morning Star (1981)
Broken Rhapsody (1982)
The Silver Veil (1982)
Spellbound (1982)
Hunter's Moon (1982)
Girl at Cobalt Creek (1983)
No Alternative (1983)
House of Memories (1983)
Almost a Stranger (1984)
A place called Rambulara (1984)
Fallen Idol (1984)
Hunt the Sun (1985)
Eagle's Ridge (1985)
The Tiger's Cage (1986)
Innocent in Eden (1986)
Diamond Valley (1986)
Morning Glory (1988)
Devil Moon (1988)
Mowana Magic (1988)
Hungry Heart (1988)
Rise of an Eagle (1988)
One Fateful Summer (1993)
The Carradine Brand (1994)
Holding on to Alex (1997)
The Australian Heiress (1997)
Claiming His Child (1999)
The Cattleman's Bride (2000)
The Cattle Baron (2001)
The Husbands of the Outback (2001)
Secrets of the Outback (2002)
With This Ring (2003)
Innocent Mistress (2004)
Cattle Rancher, Convenient Wife (2007)
Outback Marriages (2007)
Promoted: Nanny to Wife (2007)
Cattle Rancher, Secret Son (2007)
Genni's Dilemma (2008)
Bride At Briar Ridge (2009)
Outback Heiress, Surprise Proposal (2009)
Cattle Baron, Nanny Needed (2009)

Legends of the Outback Series
Mail Order Marriage (1999)
The Bridesmaid's Wedding (2000)
The English Bride (2000)
A Wife at Kimbara (2000)

Koomera Crossing Series
Sarah's Baby (2003)
Runaway Wife (2003)
Outback Bridegroom (2003)
Outback Surrender (2003)
Home to Eden (2004)

McIvor Sisters Series
The Outback Engagement (2005)
Marriage at Murraree (2005)

Men Of The Outback Series
The Cattleman (2006)
The Cattle Baron's Bride (2006)
Her Outback Protector (2006)
The Horseman (2006)

Outback Marriages Series
Outback Man Seeks Wife (2007)
Cattle Rancher, Convenient Wife (2007)

Barons of the Outback Series Multi-Author
Wedding At Wangaree Valley (2008)
Bride At Briar's Ridge (2008)

Family Ties Multi-Author
Once Burned (1995)

Hitched! Multi-Author
A Faulkner Possession (1996)

Simply the Best Multi-Author
Georgia and the Tycoon (1997)

The Big Event Multi-Author
Beresford's Bride (1998)

Guardian Angels Multi-Author
Gabriel's Mission (1998)

Australians Series Multi-Author
7  Her Outback Man (1998)
17  Master of Maramba (2001)
19  Outback Fire (2001)
22  Mistaken Mistress (2002)
24  Outback Angel (2002)
33  The Australian Tycoon's Proposal (2004)
35  His Heiress Wife (2004)

Marrying the Boss Series Multi-Author
Boardroom Proposal (1999)

Contract Brides Series Multi-Author
Strategy for Marriage (2002)

Everlasting Love Series Multi-Author
Hidden Legacy (2008)

Diamond Brides Series Multi-Author
The Australian's Society Bride (2008)

Collections
Summer Magic / Ring of Jade / Noonfire (1981)
Wife at Kimbara / Bridesmaid's Wedding (2005)

Omnibus in Collaboration
Pretty Witch / Without Any Amazement / Storm Over Mandargi (1977) (with Lucy Gillen and Margaret Malcolm)
Dear Caliban / Heart of the Eagle / Swans' Reach (1978) (with Jane Donnelly and Elizabeth Graham)
The Bonds of Matrimony / Dragon Island / Reeds of Honey (1979) (with Elizabeth Hunter and Henrietta Reid)
The Man Outside / Castles in Spain / McCabe's Kingdom (1979) (with Jane Donnelly and Rebecca Stratton)
Winds From The Sea / Island of Darkness / Wind River (1979) (with Margaret Pargeter and Rebecca Stratton)
Moorland Magic / Tree of Idleness / Sweet Sundown (1980) (with Elizabeth Ashton and Elizabeth Hunter)
The Shifting Sands / Portrait of Jaime / Touched by Fire (1982) (with Jane Donnelly and Kay Thorpe)
Head of Chancery / Wild Heart / One-Way Ticket (1986) (with Betty Beaty and Doris Smith)
Heart of the Scorpion / The Winds of Heaven / Sweet Compulsion (1987) (with Janice Gray and Victoria Woolf)
One Brief Sweet Hour / Once More With Feeling / Blue Lotus (1990) (with Jane Arbor and Natalie Sparks)
Marry Me Cowboy (1995) (with Janet Dailey, Susan Fox and Anne McAllister)
Husbands on Horseback (1996) (with Diana Palmer)
Wedlocked (1999) (with Day Leclaire and Anne McAllister)
Mistletoe Magic (1999) (with Betty Neels and Rebecca Winters)
The Australians (2000) (with Helen Bianchin and Miranda Lee)
Weddings Down Under (2001) (with Helen Bianchin and Jessica Hart)
Outback Husbands (2002) (with Marion Lennox)
The Mother's Day Collection (2002) (with Helen Dickson and Kate Hoffmann)
Australian Nights (2003) (with Miranda Lee)
Outback Weddings (2003) (with Barbara Hannay)
Australian Playboys (2003) (with Helen Bianchin and Marion Lennox)
Australian Tycoons (2004) (with Emma Darcy and Marion Lennox)
A Mother's Day Gift (2004) (with Anne Ashley and Lucy Monroe)
White Wedding (2004) (with Judy Christenberry and Jessica Steele)
A Christmas Engagement (2004) (with Sara Craven and Jessica Matthews)
A Very Special Mother's Day (2005) (with Anne Herries)
All I Want for Christmas    (2005) (with Betty Neels and Jessica Steele)
The Mills and Boon Collection (2006) (with Caroline Anderson and Penny Jordan)
Outback Desire (2006) (with Emma Darcy and Carol Marinelli)
To Mum, with Love (2006) (with Rebecca Winters)
Australian Heroes (2007) (with Marion Lennox and Fiona McArthur)
Tall, Dark and Sexy (2008) (with Caroline Anderson and Helen Bianchin)
The Boss's Proposal (2008) (with Jessica Steele and Patricia Thayer)
Island Heat / Outback Man Seeks Wife / Prince's Forbidden Virgin / One Night Before Marriage / Their Lost-and-found Family / Single Dad's Marriage Wish (2008) (with Robyn Donald, Marion Lennox, Carol Marinelli, Sarah Mayberry and Anne Oliver)
Australian Billionaires (2009) (with Jennie Adams and Amy Andrews)
Cattle Baron : Nanny Needed / Bachelor Dad on Her Doorstep (2009) (with Michelle Douglas)

External links
Margaret Way at Harlequin Enterprises Ltd

Australian romantic fiction writers
Australian women novelists
Living people
Year of birth missing (living people)
Women romantic fiction writers
Context 2: Paper Info

Title: Conflict Optimization for Binary CSP Applied to Minimum Partition into Plane Subgraphs and Graph Coloring
Publish Date: 25 Mar 2023
Author List: Loïc Crombez (from LIMOS, Université Clermont Auvergne), Guilherme Da Fonseca (from LIS, Aix-Marseille Université), Florian Fontan (from Independent Researcher), Yan Gerard (from LIMOS, Université Clermont Auvergne), Aldo Gonzalez-Lorenzo (from LIS, Aix-Marseille Université), Pascal Lafourcade (from LIMOS, Université Clermont Auvergne), Luc Libralesso (from LIMOS, Université Clermont Auvergne), Benjamin Momège (from Independent Researcher), Jack Spalding-Jamieson (from David R  Cheriton School of Computer Science, University of Waterloo), Brandon Zhang (from Independent Researcher), Da Zheng (from Department of Computer Science, University of Illinois at Urbana-Champaign)

Figure

Figure 1: A partition of the input graph of the CG:SHOP2022 instance vispecn2518 into 57 plane graphs It is the smallest instance of the challenge with 2518 segments On top left, you see all 57 colors together On top right, you see a clique of size 57, hence the solution is optimal Each of the 57 colors is then presented in small figures 
Figure 2: Number of colors over time for the instance vispecn13806 using different values p The algorithm uses σ = 0 15, easy vertices, q max = 59022, but does not use the BDFS nor any clique 
Figure 3: Number of colors over time with different values of q max obtained on the instance vispecn13806 Parameters are σ = 0 15, p = 1 2, no clique knowledge, and no BDFS 
Figure 4: Number of colors over time with and without clique knowledge and BDFS obtained on the instance vispecn13806 Parameters are σ = 0 15, p = 1 2, and q max = 1500000 
Figure 5: Number of colors over time for the instance vispecn13806 for different values of σ In both figures the algorithm uses p = 1 2, easy vertices, q max = 59022, but does not use the BDFS nor any clique For σ ≥ 0 25, no solution better than 248 colors is found 
Figure 6: Number of colors over time (in hours) for the instance vispecn13806 
Several CG:SHOP 2022 results We compare the size of the largest known clique to the smallest coloring found by each team on a selection of 14 CG:SHOP 2022 instances 
[20][21][22][23][24][25] with state-of-the-art graph coloring algorithms The conflict optimizer underperforms except on the geometric graphs r* and dsjr* CE39-0007), SEVERITAS (ANR-20-CE39-0005) and by the French government IDEX-ISITE initiative 16-IDEX-0001 (CAP[20][21][22][23][24][25] The work of Luc Libralesso is supported by the French ANR PRC grant DECRYPT (ANR-18-CE39-0007) 

abstract

CG:SHOP is an annual geometric optimization challenge and the 2022 edition proposed the problem of coloring a certain geometric graph defined by line segments  Surprisingly, the top three teams used the same technique, called conflict optimization  This technique has been introduced in the 2021 edition of the challenge, to solve a coordinated motion planning problem 
In this paper, we present the technique in the more general framework of binary constraint satisfaction problems (binary CSP)  Then, the top three teams describe their different implementations of the same underlying strategy  We evaluate the performance of those implementations to vertex color not only geometric graphs, but also other types of graphs 

Introduction

The CG:SHOP challenge (Computational Geometry: Solving Hard Optimization Problems) is an annual geometric optimization competition, whose first edition took place in 2019  The 2022 edition proposed a problem called minimum partition into plane subgraphs  The input is a graph G embedded in the plane with edges drawn as straight line segments, and the goal is to partition the set of edges into a small number of plane graphs (Fig  )  
This goal can be formulated as a vertex coloring problem on a graph G defined as follows  The vertices of G are the segments defining the edges of G, and the edges of G correspond to pairs of crossing segments (segments that intersect only at a common endpoint are not considered crossing)  The three top-ranking teams (Lasa, Gitastrophe, and Shadoks) on the CG:SHOP 2022 challenge all used a common approach called conflict optimization while the fourth team used a SAT-Boosted Tabu Search  
Conflict optimization is a technique used by Shadoks to obtain the first place in the CG:SHOP 2021 challenge for low-makespan coordinated motion planning , and the main ideas of the technique lent themselves well to the 2022 challenge  Next, we describe the conflict optimizer as a metaheuristic to solve constraint satisfaction problems (CSP)  
We start by describing a CSP  A CSP is a triple of • variables X = (x 1 ,       , x n ), Each of the 57 colors is then presented in small figures  • domains D = (D 1 ,       , D n ), and • constraints R  Each variable x i must be assigned a value in the corresponding domain D i such that all constraints are satisfied 
In general, the constraints may forbid arbitrary subsets of values  We restrict our attention to a particular type of constraints (binary CSP ), which only involve pairs of assignments  A partial evaluation is an assignment of a subset of the variables, called evaluated, with the remaining variables called non-evaluated 
All constraints involving a non-evaluated variable are satisfied by default  We only consider assignments and partial assignments that satisfy all constraints  The conflict optimizer iteratively modifies a partial evaluation with the goal of emptying the set S of non-evaluated variables, at which point it stops 
At each step, a variable x i is removed from S  If there exists a value x ∈ D i that satisfies all constraints, then we assign the value x to the variable x i   Otherwise, we proceed as follows  For each possible value x ∈ D i , we consider the set K(i, x) of variables (other than x i ) that are part of constraints violated by the assignment x i = x 
We assign to x i the value x that minimizes where w(j) is a weight function to be described later  The variables x j ∈ K(i, x) become non-evaluated and added to S  The weight function should be such that w(j) increases each time x j is added to S, in order to avoid loops that keep moving the same variables back and forth from S  Let q(j) be the number of times x j became non-evaluated 
A possible weight function is w(j) = q(j)  More generally, we can have w(j) = q(j) p for some exponent p (typically between 1 and 2)  Of course, several details of the conflict optimizer are left open  For example, which element to choose from S, whether some random noise should be added to w, and the decision to restart the procedure from scratch after a certain time 
The CSP as is, does not apply to optimization problems  However, we can, impose a maximum value k of the objective function in order to obtain a CSP  The conflict optimizer was introduced in a low makespan coordinated motion planning setting  In that setting, the variables are the robots, the domains are their paths (of length at most k) and the constraints forbid collisions between two paths 
In the graph coloring setting, the domains are the k colors of the vertices and the constraints forbid adjacent vertices from having the same color  The conflict optimizer can be adapted to non-binary CSP, but in that case multiple variables may be unassigned for a single violated constraint  The strategy has some resemblance to the similarly named min-conflicts algorithm , but notable differences are that a partial evaluation is kept instead of an invalid evaluation and the weight function that changes over time 
While the conflict optimization strategy is simple, there are different ways to apply it to the graph coloring problem  The goal of the paper is to present how the top three teams applied it or complemented it with additional strategies  We compare the relative benefits of each variant on the instances given in the CG:SHOP 2022 challenge 
We also compare them to baselines on some instances issued from graph coloring benchmarks  The paper is organized as follows  Section 2 presents the details of the conflict optimization strategy applied to graph coloring  In the three sections that follow, the three teams Lasa, Gitastrophe, and Shadoks present the different parameters and modified strategies that they used to make the algorithm more efficient for the CG:SHOP 2022 challenge 
The last section is devoted to the experimental results 

Literature Review

The study of graph coloring goes back to the 4-color problem (1852) and it has been intensively studied since the 1970s (see for surveys)  Many heuristics have been proposed , as well as exact algorithms   We briefly present two classes of algorithms: greedy algorithms and exact algorithms  Greedy algorithms 
These algorithms are used to find good quality initial solutions in a short amount of time  The classic greedy heuristic considers the vertices in arbitrary order and colors each vertex with the smallest non-conflicting color  The two most famous modern greedy heuristics are DSATUR and Recursive Largest First (RLF )  
At each step (until all vertices are colored), DSATUR selects the vertex v that has the largest number of different colors in its neighbourhood  Ties are broken by selecting a vertex with maximum degree  The vertex v is colored with the smallest non-conflicting color  RLF searches for a large independent set I, assigns the vertices I the same color, removes I from G , and repeats until all vertices are colored 
Exact algorithms  Some exact methods use a branch-and-bound strategy, for example extending the DSATUR heuristic by allowing it to backtrack   Another type of exact method (branch-and-cut-and-price) decomposes the vertex coloring problem into an iterative resolution of two sub-problems   The "master problem" maintains a small set of valid colors using a set-covering formulation 
The "pricing problem" finds a new valid coloring that is promising by solving a maximum weight independent set problem  Exact algorithms are usually able to find the optimal coloring for graphs with a few hundred vertices  However, even the smallest CG:SHOP 2022 competition instances involve at least a few thousands vertices 

Conflict Optimization for Graph Coloring

Henceforth, we will only refer to the intersection conflict graph G induced by the instance  Vertices will refer to the vertices V (G ), and edges will refer to the edges E(G )  Our goal is to partition the vertices using a minimum set of k color classes C = {C 1 ,       , C k }, where no two vertices in the same color class C i are incident to a common edge 

Conflict Optimization

TABUCOL inspired neighbourhood One classical approach for the vertex coloring involves allowing solutions with conflicting vertices (two adjacent vertices with the same color)  It was introduced in 1987 and called TABUCOL  It starts with an initial solution, removes a color (usually the one with the least number of vertices), and assigns uncolored vertices with a new color among the remaining ones 
This is likely to lead to some conflicts (i e  two adjacent vertices sharing a same color)  The local search scheme selects a conflicting vertex, and tries to swap its color, choosing the new coloring that minimises the number of conflicts  If it reaches a state with no conflict, it provides a solution with one color less than the initial solution 
The process is repeated until the stopping criterion is met



ground_truth: Margaret Way started self-publishing her books as e-books in 2013.

prompt_front: Now, answer the following question based on the text below, only give me the answer and do not output any other words.

Question: What are the three teams that used conflict optimization in the challenge?

Read the following text and answer briefly.

Context 2:  While the original TABUCOL algorithm includes a "tabu-list" mechanism to avoid cycling, it is not always sufficient, and requires some hyper-parameter tuning in order to obtain a good performance on a large variety of instances  To overcome this issue, we use a neighbourhood, but replace the "tabu-list" by the conflict optimizer scheme presented above 
PARTIALCOL inspired neighbourhood PARTIALCOL another local search algorithm solving the vertex coloring problem was introduced in 2008  This algorithm proposes a new local search scheme that allows partial coloring (thus allowing uncolored vertices)  The goal is to minimize the number of uncolored vertices 
Similarly to TABUCOL, PARTIALCOL starts with an initial solution, removes one color (unassigning its vertices), and performs local search iterations until no vertex is left uncolored  When coloring a vertex, the adjacent conflicting vertices are uncolored  Then, the algorithm repeats the process until all vertices are colored, or the stopping criterion is met 
This neighbourhood was also introduced alongside a tabu-search procedure  The tabu-search scheme is also replaced by a conflict-optimization scheme  Note that this neighbourhood was predominantly used by the other teams 

Finding Initial Solutions

Lasa team used two approaches to find initial solutions: 1  DSATUR is the classical graph coloring algorithm presented in Section 1  2  Orientation greedy is almost the only algorithm where the geometry of the segments is used  If segments are almost parallel, it is likely that they do not intersect (thus forming an independent set) 
This greedy algorithm first sorts the segments by orientation, ranging from − π 2 to π 2   For each segment in this order, the algorithm tries to color it using the first available color  If no color has been found, a new color is created for coloring the considered segment  This algorithm is efficient, produces interesting initial solutions and takes into account the specificities of the competition 

Solution Initialization

The gitastrophe team uses the traditional greedy algorithm of Welsh and Powell to obtain initial solutions: order the vertices in decreasing order of degree, and assign each vertex the minimum-label color not used by its neighbors  During the challenge Gitastrophe attempted to use different orderings for the greedy algorithm, such as sorting by the slope of the line segment associated with each vertex (as the orientation greedy initialization presented in Section 3), and also tried numerous other strategies 
Ultimately, after running the solution optimizer for approximately the same amount of time, all initializations resulted in an equal number of colors 

Modifications to the Conflict Optimizer

Taking inspiration from memetic algorithms, which alternate between an intensification and a diversification stage, the algorithm continually switched between a phase using the above conflict score, and one minimizing only the number of conflicts  Thus during the conflict-minimization phase, the random variables f (C j ) and w(u) are both fixed equal to 1 leading to a conflict score
Each phase lasted for 10 5 iterations  Adding the conflict-minimization phase gave minor improvements to some of the challenge instances 

Shadoks

In this section, we describe the choices used by the Shadoks team for the options described in Section 2 1  The Shadoks generally chose to eliminate the color with the smallest number of elements  However, if the multistart option is toggled on, then a random color is used each time  The conflict set S is stored in a queue 
The Shadoks tried other strategies, but found that the queue gives the best results  The weight function used is w(u) = 1 + q(u) p , mostly with p = 1 2  The effect of the parameter p is shown in Fig    Notice that in all figures, the number of colors shown is the average of ten executions of the code using different random seeds 
The algorithm uses σ = 0 15, easy vertices, q max = 59022, but does not use the BDFS nor any clique  If q(u) is larger than a threshold q max , the Shadoks set w(u) = ∞ so that the vertex u never reenters S  If at some point an uncolored vertex v is adjacent to some vertex u of infinite weight in every color class, then the conflict optimizer is restarted 
When restarting, the initial coloring is shuffled by moving some vertices from their initial color class to a new one  Looking at Fig  , the value of q max does not seem to have much influence as long as it is not too small  Throughout the challenge the Shadoks almost exclusively used q max = 2000 • (75000/m) 2 , where m is the number of vertices 
This value roughly ensures a restart every few hours  q max =0 5k q max =5k q max =50k q max =100k q max =250k The Shadoks use the function f as a Gaussian random variable of mean 1 and variance σ  A good default value is σ = 0 15  The effect of the variance is shown in Fig    Notice that setting σ = 0 gives much worse results 
Option (e) The goal of BDFS is to further optimize very good solutions that the conflict optimizer is not able to improve otherwise  Fig  shows the influence of BDFS  While on this figure, the advantages of BDFS cannot be noticed, its use near the end of the challenge improved about 30 solutions  The bounded depth-first search (BDFS) algorithm tries to improve the dequeuing process 
The goal is to prevent a vertex in conflict with some adjacent colored vertices from entering in the conflict set  At the first level, the algorithm searches for a recoloring of some adjacent vertices which allows us to directly recolor the conflict vertex  If no solution is found, the algorithm  In both figures the algorithm uses p = 1 2, easy vertices, q max = 59022, but does not use the BDFS nor any clique 
For σ ≥ 0 25, no solution better than 248 colors is found  could recolor some vertices at larger distances from the conflict vertex  To do so, a local search is performed by trying to recolor vertices at a bounded distance from the conflict vertex in the current partial solution  The BDFS algorithm has two parameters: adjacency bound a max and depth d 
In order to recolor a vertex v, BDFS gets the set C of color classes with at most a max neighbors of v  If a class in C has no neighbor of v, v is assigned to C  Otherwise, for each class C ∈ C, BDFS tries to recolor the vertices in C which are adjacent to v by recursively calling itself with depth d − 1 
At depth d = 0 the algorithm stops trying to color the vertices  During the challenge the Shadoks used BDFS with parameters a max = 3 and d = 3  The depth was increased to 5 (resp  7) when the number of vertices in the queue was 2 (resp  1)  Degeneracy order Given a target number of colors k, we call easy vertices a set of vertices Y such that, if the remainder of the vertices of G are colored using k colors, then we are guaranteed to be able to color all vertices of G with k colors 
This is obtained using the degeneracy order Y   To obtain Y we iteratively remove from the graph a vertex v that has at most k − 1 neighbors, appending v to the end of Y   We repeat until no other vertex can be added to Y   Notice that, once we color the remainder of the graph with at least k colors, we can use a greedy coloring for Y in order from last to first without increasing the number of colors used 
Removing the easy vertices reduces the total number of vertices, making the conflict optimizer more effective  The Shadoks always toggle this option on (the challenge instances contain from 0 to 23% easy vertices) 

Results

We provide the results of the experiments performed with the code from the three teams on two classes of instances  First, we present the results on some selected CG:SHOP 2022 instances  These instances are intersection graphs of line segments  Second, we execute the code on graphs that are not intersection graphs, namely the classic DIMACS graphs , comparing the results of our conflict optimizer implementations to previous solutions 
The source code for the three teams is available at: • Lasa: https://github com/librallu/dogs-color • Gitastrophe: https://github com/jacketsj/cgshop2022-gitastrophe • Shadoks: https://github com/gfonsecabr/shadoks-CGSHOP2022

CG:SHOP 2022 Instances

We selected 14 instances (out of 225) covering the different types of instances given in the CG:SHOP 2022 challenge  The results are presented in Table   For comparison, we executed the HEAD code on some instances using the default parameters  The table shows the smallest number of colors for which HEAD found a solution 
We ran HEAD for 1 hour of repetitions for each target number of colors on a single CPU core (the HEAD solver takes the target number of colors as a parameter and we increased this parameter one by one)  At the end of the challenge, 8 colorings computed by Lasa, 11 colorings computed by Gitastrophe, and 23 colorings computed by Shadoks over 225 instances have been proved optimal (their number of colors is equal to the size of a clique) 
In order to compare the efficiency of the algorithms, we executed the different implementations on the CG:SHOP instance vispecn13806  The edge density of this graph is 19%, the largest clique that we found has 177 vertices and the best coloring found during the challenge uses 218 colors  Notice that vispecn13806 is the same instance used in other Shadoks experiments in Section 5  Notice also that HEAD algorithm provides 283 colors after one hour compared to less than 240 colors for the conflict optimizers 
We ran the three implementations on three different servers and compared the results shown in Figure   For each implementation, the x coordinate is the running time in hours, while the y coordinate is the smallest number of colors found at that time 

Results on DIMACS Graphs

We tested the implementation of each team on the DIMACS instances to gauge the performance of the conflict optimizer on other classes of graphs  We compared our results to the best known bounds and to the state of the art coloring algorithms HEAD and QACOL   The time limit for Lasa's algorithms is 1 hour 
CWLS is Lasa's conflict optimizer with the neighbourhood presented in TABUCOL , while PWLS is the optimizer with the neighbourhood presented in PARTIALCOL   Gitastrophe algorithm ran 10 minutes after which the number of colors no longer decreases  Shadoks algorithm ran for 1 hour without the BDFS option (results with BDFS are worse) 
Results are presented in Table   We only kept the difficult DIMACS instances  For the other instances, all the results match the best known bounds  The DIMACS instances had comparatively few edges (on the order of thousands or millions); the largest intersection graphs considered in the CG:SHOP challenge had over 1 5 billion edges 
We notice that the conflict optimizer works extremely poorly on random graphs, but it is fast and appears to perform well on geometric graphs (r250 5, r1000 1c, r1000 5, dsjr500 1c and dsjr500 5), matching the best-known results   Interestingly, these geometric graphs are not intersection graphs as in the CG:SHOP challenge, but are generated based on a distance threshold 
On the DIMACS graphs, Lasa implementation shows better performance than the other implementations 
Context 3: \section{Introduction and main results}


In this note we are interested in the existence versus non-existence of stable sub- and super-solutions of equations of the form
\begin{equation} \label{eq1}
-div( \omega_1(x) \nabla u ) = \omega_2(x) f(u) \qquad \mbox{in $ {\mathbb{R}}^N$,}
\end{equation} where $f(u)$ is one of the following non-linearities: $e^u$,  $ u^p$ where $ p>1$ and $ -u^{-p}$ where $ p>0$   We assume that $ \omega_1(x)$ and $ \omega_2(x)$, which we call \emph{weights},  are smooth positive functions (we allow $ \omega_2$ to be zero at say a point) and which satisfy various growth conditions at $ \infty$     Recall that we say that a solution $ u $ of $ -\Delta u = f(u)$ in $ {\mathbb{R}}^N$ is stable provided
\[ \int f'(u) \psi^2 \le \int | \nabla \psi|^2, \qquad \forall \psi \in C_c^2,\] where $ C_c^2$ is the set of $ C^2$ functions defined on $ {\mathbb{R}}^N$ with compact support   Note that the stability of $u$ is just saying that the second variation at $u$ of the energy associated with the equation is non-negative      In our setting this becomes:  We say a $C^2$ sub/super-solution $u$ of (\ref{eq1}) is \emph{stable} provided
\begin{equation} \label{stable}
\int \omega_2 f'(u) \psi^2 \le \int \omega_1 | \nabla \psi|^2 \qquad \forall \psi \in C_c^2 
\end{equation}
One should note that (\ref{eq1}) can be re-written as
\begin{equation*}
- \Delta u  + \nabla \gamma(x) \cdot \nabla u ={ \omega_2}/{\omega_1}\ f(u) \qquad \text{ in $ \mathbb{R}^N$},
\end{equation*}
where
$\gamma = - \log( \omega_1)$ and on occasion we shall take this point of view 


\begin{remark} \label{triv} Note that  if $ \omega_1$ has enough integrability then it is immediate that if $u$ is a stable solution  of (\ref{eq1}) we have $ \int \omega_2 f'(u) =0 $  (provided $f$ is increasing)    To see this let $ 0 \le \psi \le 1$ be supported in a ball of radius $2R$ centered at the origin ($B_{2R}$) with $ \psi =1$ on $ B_R$ and such that $  | \nabla \psi | \le \frac{C}{R}$ where $ C>0$ is independent of $ R$    Putting this $ \psi$ into $ (\ref{stable})$ one obtains
\[ \int_{B_R} \omega_2 f'(u) \le \frac{C}{R^2} \int_{R < |x| <2R} \omega_1,\] and so if the right hand side goes to zero as $ R \rightarrow \infty$ we have the desired result 

\end{remark}





The existence versus non-existence of stable solutions of  $ -\Delta u =  f(u)$ in $ {\mathbb{R}}^N$ or $ -\Delta u = g(x) f(u)$ in $ {\mathbb{R}}^N$ is now quite well understood, see  \cite{dancer1, farina1, egg, zz, f2, f3, wei, ces, e1, e2}   We remark that some of these results are examining the case where $ \Delta $ is replaced with $ \Delta_p$ (the $p$-Laplacian) and also in many cases the authors are interested in finite Morse index solutions or solutions which are stable outside a compact set 
  Much of the interest in these Liouville type theorems  stems from the fact that the non-existence of a stable solution is related to the existence of a priori estimates for stable solutions of a related equation on a bounded domain 




       In \cite{Ni}  equations similar to  $ -\Delta u = |x|^\alpha u^p$  where examined on the unit ball in $ {\mathbb{R}}^N$ with zero Dirichlet boundary conditions   There it was shown that for $ \alpha >0$ that  one can obtain positive solutions for $ p $ supercritical with respect to Sobolev embedding and so one can view that the term $ |x|^\alpha$ is restoring some compactness       A similar feature happens for equations of the form
\[ -\Delta u = |x|^\alpha f(u) \qquad \mbox{in $ {\mathbb{R}}^N$};\]    the value of $ \alpha$ can vastly alter the existence versus non-existence of a stable solution,  see \cite{e1, ces, e2, zz, egg} 

We now come to our main results and for this we need to define a few quantities:

\begin{eqnarray*}
I_G&:=& R^{-4t-2} \int_{ R < |x|<2R} \frac{ \omega_1^{2t+1}}{\omega_2^{2t}}dx , \\
 J_G&:=& R^{-2t-1} \int_{R < |x| <2R} \frac{| \nabla \omega_1|^{2t+1} }{\omega_2^{2t}} dx  ,\\I_L&:=& R^\frac{-2(2t+p-1)}{p-1}  \int_{R<|x|<2R }{ \left(   \frac{w_1^{p+2t-1}}{w_2^{2t}}    \right)^{\frac{1}{p-1} }  }  dx,\\ J_L&:= &R^{-\frac{p+2t-1}{p-1} }  \int_{R<|x|<2R }{ \left(   \frac{|\nabla w_1|^{p+2t-1}}{w_2^{2t}}     \right)^{\frac{1}{p-1} }  }  dx,\\
I_M  &:=&   R^{-2\frac{p+2t+1}{p+1} }  \int_{R<|x|<2R }{ \left(   \frac{w_1^{p+2t+1}}{w_2^{2t}}    \right)^{\frac{1}{p+1} }  } \ dx, \\
J_M  &:= &  R^{-\frac{p+2t+1}{p+1} }  \int_{R<|x|<2R }{ \left(   \frac{|\nabla w_1|^{p+2t+1}}{w_2^{2t}}     \right)^{\frac{1}{p+1} }  }  dx 
\end{eqnarray*}


The three equations we examine are
\[ -div( \omega_1 \nabla u ) = \omega_2 e^u \qquad \mbox{ in $ {\mathbb{R}}^N$ } \quad  (G), \]
\[  -div( \omega_1 \nabla u ) = \omega_2 u^p \qquad \mbox{ in $ {\mathbb{R}}^N$ } \quad  (L), \]
\[ -div( \omega_1 \nabla u ) = - \omega_2 u^{-p} \qquad \mbox{ in $ {\mathbb{R}}^N$ } \quad  (M),\]  and where we restrict $(L)$ to the case $ p>1$ and $(M)$ to $ p>0$     By solution we always mean a $C^2$ solution    We now come to our main results in terms of abstract $ \omega_1 $ and $ \omega_2$     We remark that our approach to non-existence of stable solutions is the approach due to Farina, see \cite{f2,f3,farina1} 

\begin{thm} \label{main_non_exist} \begin{enumerate}


\item   There is no  stable sub-solution of $(G)$ if $ I_G, J_G \rightarrow 0$ as $ R \rightarrow \infty$   for some   $0<t<2$ 
 \item    There is no positive   stable sub-solution (super-solution) of $(L)$  if  $ I_L,J_L \rightarrow 0$ as $ R \rightarrow \infty$   for some   $p- \sqrt{p(p-1)}   < t<p+\sqrt{p(p-1)} $  ($0<t<\frac{1}{2}$) 
\item   There is no positive   stable super-solution of (M) if  $ I_M,J_M \rightarrow 0$ as $ R \rightarrow \infty$  for some $0<t<p+\sqrt{p(p+1)}$ 

\end{enumerate}

\end{thm}     If we assume that $ \omega_1$ has some monotonicity we can do  better    We will assume that the monotonicity conditions is satisfied for big $x$  but really all ones needs is for it to be satisfied on a suitable sequence of annuli 

\begin{thm} \label{mono}  \begin{enumerate} \item There is no  stable sub-solution of $(G)$ with $  \nabla \omega_1(x) \cdot  x \le 0$ for big $x$ if  $ I_G \rightarrow 0$ as $ R \rightarrow \infty$   for some   $0<t<2$ 

\item There is no positive  stable sub-solution of  $(L)$ provided  $  I_L \rightarrow 0$ as $ R \rightarrow \infty$ for either:
\begin{itemize}
\item  some $  1 \le t < p + \sqrt{p(p-1)}$ and $  \nabla \omega_1(x) \cdot x \le 0$ for big $x$,  or  \\

\item some $ p - \sqrt{p(p-1)} < t \le 1$ and $ \nabla \omega_1(x) \cdot x \ge 0$ for big $ x$ 
\end{itemize}
 There is no positive super-solution of $(L)$ provided $ I_L \rightarrow 0$ as $ R \rightarrow \infty$ for some $ 0 < t < \frac{1}{2}$ and $ \nabla \omega_1(x) \cdot x \le 0$ for big $x$ 



\item  There is no positive stable super-solution of $(M)$ provided  $ I_M \rightarrow 0$ as $ R \rightarrow \infty$  for some  $0<t<p+\sqrt{p(p+1)}$ 

\end{enumerate}

\end{thm}


\begin{cor}  \label{thing}  Suppose $ \omega_1 \le C  \omega_2$  for big $ x$, $ \omega_2 \in L^\infty$,  $ \nabla \omega_1(x) \cdot  x \le 0$ for big $ x$ 
\begin{enumerate} \item There is no stable sub-solution of $(G)$ if $ N \le 9$ 

\item  There is no positive stable sub-solution of $(L)$ if  $$N<2+\frac{4}{p-1} \left( p+\sqrt{p(p-1)}  \right) $$

\item  There is no positive stable super-solution of $(M)$ if $$N<2+\frac{4}{p+1} \left( p+\sqrt{p(p+1)}  \right) $$

\end{enumerate}

\end{cor}


If one takes $ \omega_1=\omega_2=1$ in the above corollary, the results obtained for $(G)$ and  $(L)$,  and for some values of $p$ in $(M)$, are optimal, see \cite{f2,f3,zz} 





We now drop all monotonicity conditions on $ \omega_1$ 

\begin{cor} \label{po} Suppose  $ \omega_1 \le C \omega_2$ for big $x$, $ \omega_2 \in L^\infty$, $ | \nabla \omega_1| \le C \omega_2$ for big $x$ 
\begin{enumerate} \item  There is no stable sub-solution of $(G)$ if $ N \le 4$ 

\item  There is no positive stable sub-solution of $(L)$ if $$N<1+\frac{2}{p-1} \left( p+\sqrt{p(p-1)}  \right) $$

\item There is no positive super-solution of $(M)$ if $$N<1+\frac{2}{p+1} \left( p+\sqrt{p(p+1)}  \right) $$

\end{enumerate}

\end{cor}

Some of the conditions on $ \omega_i$ in Corollary \ref{po} seem somewhat artificial   If we shift over to the advection equation (and we take $ \omega_1=\omega_2$  for simplicity)
\[ -\Delta u + \nabla \gamma \cdot \nabla u = f(u), \] the conditions on $ \gamma$ become: $ \gamma$ is bounded from below and has a bounded gradient 



In what follows we examine the case where $ \omega_1(x) = (|x|^2 +1)^\frac{\alpha}{2}$ and $ \omega_2(x)= g(x) (|x|^2 +1)^\frac{\beta}{2}$,  where $ g(x) $ is positive except at say a point, smooth and where $ \lim_{|x| \rightarrow \infty} g(x) = C \in (0,\infty)$      For this class of weights we can essentially obtain optimal results 


\begin{thm} \label{alpha_beta}   Take $ \omega_1 $ and $ \omega_2$ as above 
\begin{enumerate}

\item If $ N+ \alpha - 2 <0$ then there is no stable sub-solution for $(G)$, $(L)$ (here we require it to be positive) and in the case of $(M)$ there is no positive  stable  super-solution  This case is the trivial case, see Remark \ref{triv}   \\



\textbf{Assumption:} For the remaining cases we assume that $ N + \alpha -2 > 0$ 

  \item If  $N+\alpha-2<4(\beta-\alpha+2)$ then there is no  stable sub-solution for $ (G)$ 

\item If $N+\alpha-2<\frac{ 2(\beta-\alpha+2)   }{p-1} \left( p+\sqrt{p(p-1)}  \right)$ then there is  no positive stable sub-solution of $(L)$ 

\item If $N+\alpha-2<\frac{2(\beta-\alpha+2)   }{p+1} \left( p+\sqrt{p(p+1)}  \right)$ then there is no positive stable super-solution of $(M)$ 

\item Further more 2,3,4 are optimal in the sense if $ N + \alpha -2 > 0$ and the remaining inequality is not satisfied (and in addition we assume we don't have equality in the inequality) then we can find a suitable function $ g(x)$ which satisfies the above properties and a stable sub/super-solution $u$ for the appropriate equation 

\end{enumerate}

\end{thm}

\begin{remark}  Many of the above results can be extended to the case of equality in either the $ N + \alpha - 2 \ge 0$ and also the other inequality which depends on the equation we are  examining   We omit the details because one cannot prove the results in a unified way 

\end{remark}






















In showing that an explicit solution is stable we will need the   weighted Hardy inequality given in \cite{craig} 
\begin{lemma} \label{Har}
Suppose $ E>0$ is a smooth function   Then one has
\[ (\tau-\frac{1}{2})^2 \int E^{2\tau-2} | \nabla E|^2 \phi^2 + (\frac{1}{2}-\tau) \int (-\Delta E) E^{2\tau-1} \phi^2 \le \int E^{2\tau} | \nabla \phi|^2,\] for all $ \phi \in C_c^\infty({\mathbb{R}}^N)$ and $ \tau \in {\mathbb{R}}$ 
\end{lemma}  By picking an appropriate function $E$ this gives,

\begin{cor} \label{Hardy}
For all $ \phi \in C_c^\infty$ and $ t , \alpha \in {\mathbb{R}}$  We have
  \begin{eqnarray*}
\int (1+|x|^2)^\frac{\alpha}{2} |\nabla\phi|^2 &\ge& (t+\frac{\alpha}{2})^2 \int |x|^2 (1+|x|^2)^{-2+\frac{\alpha}{2}}\phi^2\\
&&+(t+\frac{\alpha}{2})\int  (N-2(t+1)   \frac{|x|^2}{1+|x|^2}) (1+|x|^2)^{-1+\frac{\alpha} {2}} \phi^2 
\end{eqnarray*}
 \end{cor}























\section{Proof of main results}

\textbf{ Proof of Theorem \ref{main_non_exist} }   (1)  Suppose $ u$ is a stable sub-solution of $(G)$ with $ I_G,J_G \rightarrow 0$ as $ R \rightarrow \infty$ and  let $ 0 \le \phi \le 1$ denote a smooth compactly supported function   Put $ \psi:= e^{tu} \phi$ into (\ref{stable}), where $ 0 <t<2$, to arrive at
\begin{eqnarray*}
\int \omega_2 e^{(2t+1)u} \phi^2 &\le & t^2 \int \omega_1 e^{2tu} | \nabla u|^2 \phi^2 \\
&& +\int \omega_1 e^{2tu}|\nabla \phi|^2 + 2 t \int \omega_1 e^{2tu} \phi \nabla u \cdot \nabla \phi 
\end{eqnarray*}  Now multiply $(G)$ by $ e^{2tu} \phi^2$ and integrate by parts to arrive at
\[ 2t \int \omega_1 e^{2tu} | \nabla u|^2 \phi^2 \le \int \omega_2 e^{(2t+1) u} \phi^2 - 2 \int \omega_1 e^{2tu} \phi \nabla u \cdot \nabla \phi,\]
and now if one equates like terms they arrive at
\begin{eqnarray} \label{start}
\frac{(2-t)}{2} \int \omega_2 e^{(2t+1) u} \phi^2  & \le & \int \omega_1 e^{2tu} \left( | \nabla \phi |^2 - \frac{ \Delta \phi}{2} \right) dx \nonumber \\
&& - \frac{1}{2} \int e^{2tu} \phi \nabla \omega_1 \cdot \nabla \phi 
\end{eqnarray}   Now substitute $ \phi^m$ into this inequality for $ \phi$ where $ m $ is a big integer to obtain
\begin{eqnarray} \label{start_1}
\frac{(2-t)}{2} \int \omega_2 e^{(2t+1) u} \phi^{2m}  & \le & C_m \int \omega_1 e^{2tu} \phi^{2m-2}  \left( | \nabla \phi |^2 + \phi |\Delta \phi|  \right) dx \nonumber \\
&& - D_m \int e^{2tu} \phi^{2m-1} \nabla \omega_1 \cdot \nabla \phi
\end{eqnarray} where $ C_m$ and $ D_m$ are positive constants just depending on $m$    We now estimate the  terms on the right but we mention that when ones assume the appropriate monotonicity on $ \omega_1$ it is the last integral on the right which one is able to drop 

\begin{eqnarray*}
\int \omega_1 e^{2tu} \phi^{2m-2} | \nabla \phi|^2 & = & \int \omega_2^\frac{2t}{2t+1} e^{2tu} \phi^{2m-2}  \frac{ \omega_1 }{\omega_2^\frac{2t}{2t+1}} | \nabla \phi|^2  \\
& \le &  \left( \int \omega_2 e^{(2t+1) u} \phi^{(2m-2) \frac{(2t+1)}{2t}} dx \right)^\frac{2t}{2t+1}\\ &&\left( \int \frac{ \omega_1 ^{2t+1}}{\omega_2^{2t}} | \nabla \phi |^{2(2t+1)} \right)^\frac{1}{2t+1} 
\end{eqnarray*}
Now, for fixed $ 0 <t<2$ we can take $ m $ big enough so $ (2m-2) \frac{(2t+1)}{2t} \ge 2m $ and since $ 0 \le \phi \le 1$ this allows us to replace the power on $ \phi$ in the first term on the right with $2m$   and hence we obtain
 \begin{equation} \label{three}
 \int \omega_1 e^{2tu} \phi^{2m-2} | \nabla \phi|^2  \le \left( \int \omega_2 e^{(2t+1) u} \phi^{2m} dx \right)^\frac{2t}{2t+1} \left( \int \frac{ \omega_1 ^{2t+1}}{\omega_2^{2t}} | \nabla \phi |^{2(2t+1)} \right)^\frac{1}{2t+1} 
 \end{equation}    We now take the test functions $ \phi$ to be such that $ 0 \le  \phi \le 1$ with $ \phi $ supported in the ball $ B_{2R}$ with $ \phi = 1 $ on $ B_R$ and $ | \nabla \phi | \le \frac{C}{R}$ where $ C>0$ is independent of $ R$    Putting this choice of $ \phi$ we obtain
 \begin{equation} \label{four}
 \int \omega_1 e^{2tu} \phi^{2m-2} | \nabla \phi |^2 \le \left( \int \omega_2 e^{(2t+1)u} \phi^{2m} \right)^\frac{2t}{2t+1} I_G^\frac{1}{2t+1} 
 \end{equation}  One similarly shows that
 \[ \int \omega_1 e^{2tu} \phi^{2m-1} | \Delta \phi| \le \left( \int \omega_2 e^{(2t+1)u} \phi^{2m} \right)^\frac{2t}{2t+1} I_G^\frac{1}{2t+1} \]
 So, combining the results we obtain

 \begin{eqnarray} \label{last} \nonumber \frac{(2-t)}{2} \int \omega_2 e^{(2t+1) u} \phi^{2m} &\le& C_m \left( \int \omega_2 e^{(2t+1) u} \phi^{2m} dx \right)^\frac{2t}{2t+1} I_G^\frac{1}{2t+1}\\
 &&- D_m \int e^{2tu} \phi^{2m-1}  \nabla \omega_1 \cdot \nabla \phi 
 \end{eqnarray}
 We now estimate this last term   A similar argument using H\"{o}lder's inequality shows that
 \[ \int e^{2tu} \phi^{2m-1} | \nabla \omega_1| | \nabla \phi| \le \left(  \int \omega_2 \phi^{2m} e^{(2t+1) u} dx \right)^\frac{2t}{2t+1} J_G^\frac{1}{2t+1}  \] Combining the results gives that
\begin{equation} \label{last}
(2-t) \left( \int \omega_2 e^{(2t+1) u} \phi^{2m} dx \right)^\frac{1}{2t+1} \le I_G^\frac{1}{2t+1} + J_G^\frac{1}{2t+1},
\end{equation} and now we send $ R \rightarrow \infty$ and use the fact that $ I_G, J_G \rightarrow 0$ as $ R \rightarrow \infty$ to see that
\[ \int \omega_2 e^{(2t+1) u} =0, \] which is clearly a contradiction    Hence there is no stable sub-solution of $(G)$ 

(2)    Suppose that $u >0$ is a stable sub-solution (super-solution) of $(L)$   Then a similar calculation as in (1) shows that for  $ p - \sqrt{p(p-1)} <t < p + \sqrt{p(p-1)}$,  $( 0 <t<\frac{1}{2})$ one has

\begin{eqnarray}   \label{shit}
(p  -\frac{t^2}{2t-1}   )\int \omega_2 u^{2t+p-1} \phi^{2m} & \le & D_m \int \omega_1 u^{2t} \phi^{2(m-1)} (|\nabla\phi|^2  +\phi |\Delta \phi |) \nonumber \\
&& +C_m \frac{(1-t)}{2(2t-1)} \int u^{2t} \phi^{2m-1}\nabla \omega_1 \cdot  \nabla \phi 
 \end{eqnarray}    One now applies H\"{o}lder's argument as in (1) but the terms $ I_L$ and $J_L$ will appear on the right hand side of the resulting
 equation       This shift from a sub-solution to a super-solution depending on whether $ t >\frac{1}{2}$ or $ t < \frac{1}{2}$ is a result from the sign change of $ 2t-1$ at $ t = \frac{1}{2}$    We leave the details for the reader 


(3)   This case is also similar to (1) and (2) 


\hfill $ \Box$

 \textbf{Proof of Theorem \ref{mono} }   (1)   Again we suppose there is a stable sub-solution $u$ of $(G)$   Our starting point  is (\ref{start_1}) and we wish to be able to drop the term
 \[ - D_m \int e^{2tu} \phi^{2m-1} \nabla \omega_1 \cdot \nabla \phi, \] from (\ref{start_1})     We can choose $ \phi$ as in the proof of Theorem \ref{main_non_exist} but also such that $ \nabla \phi(x) = - C(x) x$ where $ C(x) \ge 0$      So if we assume that $ \nabla \omega_1 \cdot x \le 0$ for big $x$ then we see that this last term is non-positive and hence we can drop the term   The the proof is as before but now we only require that $ \lim_{R \rightarrow \infty} I_G=0$ 

 (2)      Suppose that $ u >0$ is a stable sub-solution of $(L)$  and so (\ref{shit}) holds for all $  p - \sqrt{p(p-1)} <t< p + \sqrt{p(p-1)}$    Now we wish to use monotonicity to drop the term from (\ref{shit}) involving the term $ \nabla \omega_1 \cdot \nabla \phi$       $ \phi$ is chosen the same as in (1)  but here one notes that the co-efficient for this term changes sign at $ t=1$ and hence by restriction $t$ to the appropriate side of 1 (along with the above condition on $t$ and $\omega_1$) we can drop the last term depending on which monotonicity we have and hence to obtain a contraction we only require that $ \lim_{R \rightarrow \infty} I_L =0$    The result for the non-existence of a stable super-solution is similar be here one restricts $ 0 < t < \frac{1}{2}$ 


(3)   The proof here is similar to (1) and (2) and we omit the details 




 \hfill $\Box$













\textbf{Proof of Corollary \ref{thing} }   We suppose  that $ \omega_1 \le C  \omega_2$  for big $ x$, $ \omega_2 \in L^\infty$,  $ \nabla \omega_1(x) \cdot  x \le 0$ for big $ x$      \\
(1)     Since $ \nabla \omega_1 \cdot x \le 0$ for big $x$ we can apply Theorem \ref{mono} to show the non-existence of a stable solution to $(G)$    Note that  with the above assumptions on $ \omega_i$ we have that
\[ I_G \le \frac{C R^N}{R^{4t+2}} \]  For $ N \le 9$  we can take $ 0 <t<2$  but close enough to $2$ so the right hand side goes to zero as $ R \rightarrow \infty$ 

Both (2) and (3) also follow directly from applying Theorem \ref{mono}    Note that one can say more about (2) by taking the multiple cases as listed in Theorem \ref{mono} but we have choice to leave this to the reader 


\hfill $ \Box$


\textbf{Proof of Corollary \ref{po} }   Since we have no monotonicity conditions now we will need both $I$ and $J$ to go to zero to show the non-existence of a stable solution    Again the results are obtained immediately by applying Theorem \ref{main_non_exist}  and we prefer to omit the details 


\hfill $\Box$
















\textbf{Proof of Theorem \ref{alpha_beta} }  (1)   If $ N + \alpha -2 <0$ then using Remark \ref{triv}  one easily sees there is no stable sub-solution of $(G)$ and $(L)$ (positive for $(L)$) or a positive stable super-solution of $(M)$    So we now assume that $ N + \alpha -2 > 0$      Note that the monotonicity of $ \omega_1$ changes when $ \alpha $ changes sign and hence one would think that we need to consider separate cases if we hope to utilize the monotonicity results    But a computation shows that in fact $ I$ and $J$ are just multiples of each other in all three cases so it suffices to show, say, that $ \lim_{R \rightarrow \infty} I =0$  \\
(2)    Note that for $ R >1$ one has
\begin{eqnarray*}
I_G & \le  & \frac{C}{R^{4t+2}} \int_{R <|x| < 2R} |x|^{ \alpha (2t+1) - 2t \beta} \\
& \le  &  \frac{C}{R^{4t+2}}  R^{N + \alpha (2t+1) - 2t \beta},
\end{eqnarray*} and so to show the non-existence we want to find some $ 0 <t<2$ such that
$  4t+2 > N  + \alpha(2t+1) - 2 t \beta$,   which is equivalent to  $ 2t ( \beta - \alpha +2) > (N + \alpha -2)$     Now recall that we are assuming that $ 0 < N + \alpha -2 < 4 ( \beta - \alpha +2) $ and hence we have the desired result by taking $  t <2$ but sufficiently close 
The proof of the non-existence results for
(3) and (4) are similar and we omit the details    \\
(5)   We now assume that $N+\alpha-2>0$   In showing the existence of stable sub/super-solutions we need to consider  $ \beta - \alpha + 2 <0$ and $ \beta - \alpha +2 >0$ separately 

\begin{itemize} \item $(\beta - \alpha + 2 <0)$  Here we take $ u(x)=0$ in the case of $(G)$ and $ u=1$ in the case of $(L)$ and $(M)$  In addition we take $ g(x)=\E$   It is clear that in all cases $u$ is the appropriate sub or super-solution   The only thing one needs to check is the stability     In all cases this reduces to trying to show that we have
\[ \sigma \int       (1+|x|^2)^{\frac{\alpha}{2}  -1}    \phi^2 \le \int      (1+|x|^2)^{\frac{\alpha}{2}}   | \nabla\phi  |^2,\]  for all $ \phi \in C_c^\infty$ where  $ \sigma $ is some small positive constant; its either $ \E$ or $ p \E$ depending on which equation were are examining 
To show this we use the result from Corollary \ref{Hardy} and we drop a few positive terms to arrive at
\begin{equation*}
\int (1+|x|^2)^\frac{\alpha}{2} |\nabla\phi|^2\ge (t+\frac{\alpha}{2})\int \left (N-2(t+1)   \frac{|x|^2}{1+|x|^2}\right) (1+|x|^2)^{-1+\frac{\alpha} {2}}
\end{equation*} which holds for all $ \phi \in C_c^\infty$ and $ t,\alpha \in {\mathbb{R}}$ 
  Now, since $N+\alpha-2>0$, we can choose $t$ such that $-\frac{\alpha}{2}<t<\frac{n-2}{2}$   So, the integrand function in the right hand side is positive and since for small enough $\sigma$ we have
  \begin{equation*}
\sigma \le  (t+\frac{\alpha}{2})(N-2(t+1)   \frac{|x|^2}{1+|x|^2})  \ \ \ \text {for all} \ \ x\in \mathbb{R}^N
\end{equation*}
 we get stability 



\item ($\beta-\alpha+2>0$) In the case of $(G)$ we take   $u(x)=-\frac{\beta-\alpha+2}{2} \ln(1+|x|^2)$ and $g(x):= (\beta-\alpha+2)(N+(\alpha-2)\frac{|x|^2}{1+|x|^2})$  By a computation one sees that $u$ is a sub-solution of $(G)$ and hence we need now to only show the stability, which amounts to showing that
\begin{equation*}
\int \frac{g(x)\psi^2}{(1+|x|^{2   })^{-\frac{\alpha}{2}+1}}\le \int\frac{|\nabla\psi|^2}{    (1+|x|^2)^{-\frac{\alpha}{2}}     },
\end{equation*} for all $ \psi \in C_c^\infty$   To show this we use  Corollary \ref{Hardy}   So  we  need to choose an appropriate $t$ in   $-\frac{\alpha}{2}\le t\le\frac{N-2}{2}$  such that for all $x\in {\mathbb{R}}^N$ we have
 \begin{eqnarray*}
 (\beta-\alpha+2)\left(    N+  (\alpha-2)\frac{|x|^2}{1+|x|^2}\right)         &\le& (t+\frac{\alpha}{2})^2 \frac{ |x|^2 }{(1+|x|^2}\\
&&+(t+\frac{\alpha}{2}) \left(N-2(t+1)   \frac{|x|^2}{1+|x|^2}\right) 
\end{eqnarray*}
With a  simple calculation one sees we need just to have
   \begin{eqnarray*}
 (\beta-\alpha+2)&\le& (t+\frac{\alpha}{2}) \\
  (\beta-\alpha+2)     \left(    N+  \alpha-2\right)      &   \le&  (t+\frac{\alpha}{2}) \left(N-t-2+\frac{\alpha}{2}) \right) 
 \end{eqnarray*}     If one takes $ t= \frac{N-2}{2}$ in the case where $ N \neq 2$ and $ t $ close to zero in the case for $ N=2$ one easily sees the above inequalities both hold, after considering all the constraints on $ \alpha,\beta$ and $N$ 

 We now consider the case of $(L)$   Here one takes $g(x):=\frac {\beta-\alpha+2}{p-1}(    N+  (\alpha-2-\frac{\beta-\alpha+2}{p-1})
\frac{|x|^2}{1+|x|^2})$ and $ u(x)=(1+|x|^2)^{ -\frac  {\beta-\alpha+2}{2(p-1)} }$    Using essentially the same approach as in $(G)$ one shows that $u$ is a stable sub-solution of $(L)$ with this choice of $g$    \\
For the case of $(M)$ we take   $u(x)=(1+|x|^2)^{ \frac  {\beta-\alpha+2}{2(p+1)}   }$ and $g(x):=\frac {\beta-\alpha+2}{p+1}(    N+  (\alpha-2+\frac{\beta-\alpha+2}{p+1})
\frac{|x|^2}{1+|x|^2})$ 



\end{itemize}


\hfill  $  \Box$












ground_truth: Lasa, Gitastrophe, and Shadoks.

prompt_front: Now, answer the following question based on the text below, only give me the answer and do not output any other words.

Question: What are the stability conditions for a solution of $-\Delta u = f(u)$?

Read the following text and answer briefly.

Context 4:  The main purpose is to compare our Monte Carlo results to these analytic predictions 

Exact enumeration

To establish that our Monte Carlo simulations indeed sample the partition functions Eq  ( ) and Eq  ( ), we have obtained analytic results on a 2 4 volume at strong coupling, and at finite beta in two dimensions on a 4 × 4 volume, comparing O (β) and O β 2 truncations  Our strategy to obtain an exact enumeration of the partition function Z is to enumerate plaquette configurations first, then fixing the fermion fluxes which together with the gauge fluxes that are induced by the plaquettes form a singlet, a triplet or anti-triplet, i e  on a given bond b, g b + f b ∈ {−3, 0, 3}, and last we perform the monomerdimer enumeration on the available sites not saturated by fermions yet by a depth-first algorithm  
At strong coupling, with no plaquettes, g b = 0 and f b are baryonic fluxes  All observables that can be written in terms of derivatives of log(z), such as the baryon density, the chiral condensate, the energy density, and also the average sign, are shown in Fig 

Expectations from mean field theory

Another analytical method to study strong coupling lattice QCD is the mean field approach, where the partition function is expanded in 1 d (d is the spatial dimension) and then a Hubbard-Stratonovich transformation performed   After this procedure, the free energy is a function of temperature T , the chiral condensate σ and chemical potential µ B :
here E[m] is one-dimensional quark excitation energy which is a function of the quark mass m = am q   For N c = 3 and d = 3 we determined the minimum of the free energy with respect to the chiral condensate  This gives us the equilibrium chiral condensate as a function of (T, m, µ B )  The chiral condensate and the baryon density as a function of the baryon chemical potential in lattice units aµ B and for various temperatures at quark mass m = 1 5 is shown in Fig    We have determined the critical temperature to be aT c = 0 23 , which is characterized by an infinite slope of the chiral condensate 
For lower temperatures, there is a clear discontinuity of the chiral con-densate, separating the low density phase from the high density phase  For temperatures above and in the vicinity of aT c the chiral condensate and baryon density has no discontinuity but rapidly changes, corresponding to a crossover transition 
With this method, the phase diagram is plotted for different quark masses in Fig    The second order phase transition in the chiral limit is plotted in solid blue line, the dotted lines show the first order phase transition for different quark masses and the solid red line indicates the critical end point for the different quark masses 
Mean field theory also gives an expression for the pion mass am π and the baryon mass am B : The mean field baryon mass for N c = 3, d = 3 is also plotted in red in Fig    Whereas the baryon mass is around N c in the chiral limit (am B 3 12 for N c = 3), it approximately doubles at m = 3 5 (am B 6 28) which corresponds to the pion mass am π = 4 45, i e  m π /m B = 0 708 
Hence, at around bare mass m = 3 5, the valence quark mass of the baryon corresponds roughly to 1/3 of the chiral limit value of the baryon mass  The first Monte Carlo simulations that could extend in the µ B − T plane was the MDP algorithm , but it required the introduction of the worm algorithm to make substantial progress 
First studies of the worm algorithm applied to the strong coupling limit QCD (with gauge group U(3)) are , and for gauge group SU   Monte Carlo simulations to extend the worm to incorporate leading order corrections were first proposed in   We will shortly review the setup of or Monte Carlo strategy for the nuclear transition, with an emphasis on the challenges to address large quark masses 

Strong Coupling

Without any further resummation, there is a mild sign problem in the dual formulation of lattice QCD in the strong coupling limit  When the average sign σ is not too small (close to zero), it implies that most of the configurations have a positive weight thus allowing us to perform sign reweighting strategies 
In Fig  , ∆f is plotted as a function of the baryon chemical potential and the quark masses  It is seen that ∆f is close to zero for most cases except near the critical chemical potential and for small quark masses, but never exceeds 5 × 10 −4   Hence sign reweighting can be performed in the full parameter space 
The result that the sign problem becomes even milder when increasing the mass is related to the fact that larger critical chemical potentials result in a larger fraction of static baryons (spatial baryon hoppings become rare)  FIG    ∆F at strong coupling as a function of chemical potential and quark mass on a 6 3 × 8 
The sign problem becomes milder as the quark mass increases 

Finite β

All runs at finite β have been obtained for N τ = 4, which corresponds to a moderately low temperature aT = 0 25 compared to the value of the chiral transition aT 1 54  Those simulations were too expensive to attempt N τ = 8 runs, in particular as a higher statistics was required  The spatial volumes are 4 3 , 6 3 and 8 3  
For β values are from 0 0 to 1 0 with step size 0 1, and for am q values from 0 00 to 1 00 with step size 0 01  The values of aµ were chosen close to the nuclear transition, the scanning range is shifted to large values as am q increases  At small quark masses the scanning range is from aµ = 0 4 to 1 0 and for the large quark masses, it is from 0 6 to 1 2 with step size 0 01 
The statistics used for are 15 × 10 4 measurements and between measurement, 40 × N 3 s worm updates 

Residual sign problem

Although it is possible to resum the sign problem at strong coupling with a resummation of baryon and pion world lines, this is not possible when including gauge corrections  In order to compare both sign problems, we kept the original dual formulation to monitor the severity of the sign problem  This is done via the relation
between the average sign σ and the difference of the free energy density ∆f between the full ensemble f and of the sign-quenched ensemble f ||  

Nuclear interactions

We have found that aµ 1st B is very different from the baryon mass  This must be due to strong attractive interactions of nucleons  In contrast to continuum physics, in the strong coupling limit there is no pion exchange due to the Grassmann constraint  Instead, nucleons are point like and hard core repulsive 
However, the pion bath, which is modified by the presence of static baryons, results in an attractive interaction  In , this has been analyzed in the chiral limit using the snake algorithm, and it has been found that the attractive force is of entropic origin  Here, we do not quantify the nuclear interaction via the nuclear potential, but via the difference between critical baryon chemical potential and baryon mass, in units baryon mass, as shown in Fig  , given the am B as measured in Section III C 
This compares better to the 3dim  effective theory  The nuclear interaction is maximal and more than 40% in the chiral limit, which is related to pions being massless: the modification of the pion bath is maximal  We clearly find that the nuclear interaction decreases drastically and almost linearly until it almost approaches zero at about am q = 2 0, corresponding to a pion mass am π = 3 36, see Section II B  The large error bars for larger quark masses, that are due to the subtraction of almost same magnitudes, makes it difficult to extract a non-zero nuclear interaction at the largest quark masses 
In this work, we have determined the baryon mass and the nuclear transition via Monte Carlo: the worm algorithm based on the dual formulation, at finite β equipped with additional updates  All those numerical results and various analytic expressions are summarized in Fig    We find that as the quark mass becomes large, spatial mesons hoppings (i e 
spatial dimers) become rare, which makes this 3+1-dimensional system closer to 1dim  QCD   Also, both the baryon mass and the baryon chemical potential obtained in our dual representation, i e  for staggered fermions, approaches the baryon mass of the 3-dim  effective theory which is based on Wilson fermions 
Another comparison that summarizes the validity of the mean field approach discussed in Section II B is shown in Fig    It is evident that mean field theory has strong deviations for small quark masses, but this discrepancy becomes smaller for larger quark masses  The extension of the study of the nuclear transition to finite inverse gauge coupling β is summarized in Fig  , which shows the β-dependence of aµ c B for various quark masses 
For all quark masses ranging from am q = 0 to am q = 1 0, there is only a very weak β-dependence, confirming the expectation from mean field theory   This works was restricted to isotropic lattices ξ = a/a t = 1, i e  we performed simulations at fixed temperature  Non-isotropic lattices are necessary to vary the temperature at fixed values of β 
This requires to include two bare anisotropies, γ for the fermionic action and γ G for the gauge action  Finite β has only been studied by us in the chiral limit   Clearly, it is interesting to study the location of the nuclear critical point also including higher order gauge corrections and at finite quark mass 
Simulations including O(β 2 ) are under preparation 



ground_truth: $\int f'(u) \psi^2 \le \int | \nabla \psi|^2, \forall \psi \in C_c^2$.