## Transition multiple independent WP sites to one WP multisite on the server with minimal downtime

I currently have three independent WordPress blogs hosted on a single shared server.

The main domain (we’ll call domain-A is sitting in the public_html folder. domain-B and domain-C are separate WP installs residing as subfolders within public_html. Each of the installs is mapped to its own, unique URL.

Here’s the structure of the server:

/public_html     ..core WP files, etc     /domain-B         ...WP install core files     /domain-C         ...WP core... 

I am attempting to set up a WP multisite, incorporating all 3 blogs under domain-A as my main parent site.

My plan is to create the multisite in another subfolder in public_html and once the site is configured, I want to seamlessly – with minimal downtime – swap out the independent sites for the one multisite.

How would I do that?

Here’s what the new server config might look like:

/public_html     ..core WP files, etc     /domain-B         ...WP install core files     /domain-C         ...WP core...     /new_multisite 

Ideally, it would be great if I just had one wp multisite install in the root folder and could remove the other independent installs, e.g:

/public_html     ... wp multisite core files, etc.. 

I read some stuff about configuring my local hosts file on my system to be able to re-route the IP address to a domain URL (still a little fuzzy on some of the details of that) but I don’t see how that helps with a live site and/or a remote server.

Also, is it safe to create a "sandbox" site in a subfolder on the shared server? How can I keep this folder undiscovered or inaccessible? I am considering doing the setup on my local computer using WAMP as a dry run but I’ll still have to contend with uploading it to the live server, testing it, then making the switch from 3 independent blogs to one multisite.

Edit: I’m learning now that .htaccess can be used to control redirects to a subdomain, so theoretically, all requests to the original domain(s) can be redirected to sites/domains within the multisite. Obviously, the specifics of this starts to get a little hairy.

## Independent sets into which all the vertices of the graph can be split

How to prove that if $$G$$ is an acyclic transitive digraph, then the least independent sets into which all vertices of G can be divided is equal to the size of the longest paths to $$G$$?

## Making Race Traits independent of race

I’m preparing my new campaign for my group of players and I was wondering if a ruling would unbalance the table.

What will be the effects, balancing-wise, if I let players choose a race for the traits, and another race for the cosmetic appareance of their PCs ?

For example, they could have a PC that is human, but has all the traits of a gnome, in order to make a good wizard. I feel it would enhance RP, since they will be much more confortable with their character. Most of them are experienced players, while others are kinda new, so I unsured if it will unbalance them too much (since the experienced players like to min/max their characters).

## Factor independent term from a summation?

Can I factor $$t^2$$ from $$\frac{1}{t}\sum_{n=1}^{n1}t^2Exp[-a n^2+bn]$$ to get

$$t\sum_{n=1}^{n1}Exp[-a n^2+bn]$$ using some command?

1/t Sum[t^2 Exp[-a n^2 + b n], {n, 1, n1}] 

## Space complexity of using a pairwise independent hash family

I’m trying to analyze the space complexity of using the coloring function $$f$$ which appears in "Colorful Triangle Counting and a MapReduce Implementation", Pagh and Tsourakakis, 2011, https://arxiv.org/abs/1103.6073.

As far as I understand, $$f:[n] \rightarrow [N]$$ is a hash function, that should be picked uniformly at random out of a pairwise independent hash functions family $$H$$. I have a few general questions:

1. Does the space complexity required by $$f$$ is affected by the fact that $$H$$ is $$k$$-wise independent? Why? (if it does, then also- how?)
2. What do we know about $$|H|$$? What if $$H$$ is $$k$$-wise independent?
3. Is there a more space-efficient way to store $$f$$ than storing an $$N \times m$$ matrix that maps each vertex to its color, using O($$N m$$) storage words?
4. Does the total space complexity which is required in order to use $$f$$ as described in the paper is $$|H| \cdot O(\text{space complexity of } f)$$?

Best regards

## Independent C library or function (on Linux) to programmatically generate a self-signed certificate [closed]

Is there a simple C library or function to programmatically generate a self-signed certificate in C on Ubuntu? Of course, one can execute a simple system("....") call to execute a CLI. I am looking for a native, small, stand-alone library just for this purpose with possibly added functionality but not with the full-weight of TLS implementations such as openssl, boringssl, mbedTls, etc.

## Max independent set in planar graphs PTAS proof

I’ve been searching a few hours for a proof to Max independent set in planar graphs beeing in PTAS but I couldn’t find anything, I’m searching for one without any reductions and I wonder if anyone here can help me find one.

## Independent set poly reducible to Strongly independent set?

In the newly created Graph G prime, why does adding a middle node prevent us from choosing that node? Basically, how does the reduction step help us? Solution Notes: http://www.cse.iitd.ernet.in/~amitk/SemI-2015/tut11.pdf

## Is there any hash library with 3 wise independent hash functions in python

So I was looking for a hash family with 3 wise independent hash functions and I know the theory behind it and coding it is not super difficult but I actually need very good accuracy. So it would be actually nice if I could use a library which is already defined in python. Is there any such library with 3 wise independent hash functions? I googled it but didn’t get any proper answer.

## Why is the independent constant of the differential equation not equal to the order of the differential equation?

I remember a conclusion: the number of independent constants in differential equations is equal to the order of the differential equation.

However, 23 independent constants are generated after the following fourth-order differential equation is solved.

DSolve[{D[2 D[ω[x, t], {x, 2}], {x, 2}] + D[ω[x, t], {t, 2}] == 0}, ω[x, t], {x, t}] Out:= {{ω[x, t] ->     1/1680 (1680 C[23] t^2 x^4 - 1411200 C[8] t^2 x^3 -        470400 C[17] t^3 x^3 - 604800 C[7] t^2 x^2 -        201600 C[16] t^3 x^2 - 201600 C[6] t^2 x - 67200 C[15] t^3 x -        40320 C[5] t^2 - 13440 C[14] t^3 - 6720 C[23] t^4 +        1680 C[17] t x^7 + 1680 C[16] t x^6 + 1680 C[15] t x^5 +        1680 C[14] t x^4 + 1680 C[13] t x^3 + 1680 C[12] t x^2 +        1680 C[11] t x + 1680 C[10] t - C[23] x^8 + 1680 C[8] x^7 +        1680 C[7] x^6 + 1680 C[6] x^5 + 1680 C[5] x^4 + 1680 C[4] x^3 +        1680 C[3] x^2 + 1680 C[2] x + 1680 C[1])}} 

We can see that the number of independent constants in the solution of this differential equation is far greater than the order of this differential equation. I want to know the relationship between the number of independent constants in the solution of a differential equation and the order of the differential equation.