In this work, we introduce a fast implementation of the minimum-weight perfect matching (MWPM) decoder, the most widely used decoder for several important families of quantum error correcting codes, including surface codes. Our algorithm, which we ca...
In this paper we compute the sharp lower bounds for the crossing number of $n$-string $k$-loop essential tangles. For essential tangles with only string components, we characterise the ones with the minimum crossing number for a given number of compo...
We explore the minimum distance from a host star where an exoplanet could potentially be habitable in order not to discard close-in rocky exoplanets for follow-up observations. We find that the inner edge of the Habitable Zone for hot desert worlds c...
We give a review of results on the minimum convex cover and maximum hidden set problems. In addition, we give some new results. First we show that it is NP-hard to determine whether a polygon has the same convex cover number as its hidden set number....
Tags: algorithm, data-structures, graph | Score: 1
Internal migration is an essential aspect to study labor mobility. I exploit the German statutory minimum wage introduction in 2015 to estimate its push and pull effects on internal migration using a 2% sample of administrative data. In a conditional...
We consider a general power market with price-sensitive consumer bids and non-convexities originating from supply (start-up and no-load costs, nonzero minimum output limits of generating units, etc.) and demand. The convex hull (minimum-uplift) prici...
Self-dual codes over F5 exist for all even lengths. The smallest length for which the largest minimum weight among self-dual codes has not been determined is 24, and the largest minimum weight is either 9 or 10. In this note, we show that there exi...
We prove that any $3$-uniform hypergraph whose minimum vertex degree is at least $\left(\frac{5}{9} + o(1) \right)\binom{n}{2}$ admits an almost-spanning tight cycle, that is, a tight cycle leaving $o(n)$ vertices uncovered. The bound on the vertex d...
For each $r\ge 4$, we show that any graph $G$ with minimum degree at least $(1-1/100r)|G|$ has a fractional $K_r$-decomposition. This improves the best previous bounds on the minimum degree required to guarantee a fractional $K_r$-decomposition given...
Lowest True Shooting % minimum 500 FGA 1. Scoot Henderson—48.4% 2. Jordan Poole—51.1% 3. Jeremy Sochan—51.9% 4. Josh Giddey—52.0% 5. Russell Westbrook—52.2% 6. Jordan Clarkson—52.5% 7. Car...
We present formalisations of the correctness of executable algorithms to solve minimum-cost flow problems in Isabelle/HOL. Two of the algorithms are based on the technique of scaling, most notably Orlin's algorithm, which has the fastest known runnin...
Below are the minimum age requirements to manage your own Google Account. Note: For younger children, parents can help create and manage a Google Account with Family Link. When a child reaches their
Below are the minimum age requirements to manage your own Google Account. Note: For younger children, parents can help create and manage a Google Account with Family Link. When a child reaches their
Below are the minimum age requirements to manage your own Google Account. Note: For younger children, parents can help create and manage a Google Account with Family Link. When a child reaches their
For a mining strategy we define the notion of "profit lag" as the minimum time it takes to be profitable after that moment. We compute closed forms for the profit lag and the revenue ratio for the strategies "selfish mining" and "intermittent selfish...
...
This paper investigates optimal withdrawal strategies and behavior of policyholders in a variable annuity (VA) contract with a guaranteed minimum withdrawal benefit (GMWB) rider incorporating taxation and a ratchet mechanism for enhancing the benefit...