Searcharxiv⌕ Search

arXiv subjects

Hyunwoo Lee

Publications and source records attributed to Hyunwoo Lee.

At least 19 recordsLinked to original sources

Timing-Aware Satellite Association for Multi-LEO Direct-to-Handset Communications

The rapid deployment of large-scale low Earth orbit (LEO) satellite constellations has positioned direct-to-handset (D2H) communications as a key enabler of future non-terrestrial networks. However, the limited link budget of handheld devices makes broadband service delivery challenging, and multi-satellite cooperative transmission is often required to provide sufficient power gain. In practice, such cooperation is severely hindered by asynchronous reception across satellites. This paper analyzes the received-signal model under the 3rd Generation Partnership Project (3GPP) transmitter structure and shows that satellite-dependent propagation delays prevent simultaneous timing alignment for multiple user terminals (UTs). This timing mismatch induces severe inter-carrier interference (ICI) and inter-symbol interference (ISI), even from the intended signals, which fundamentally constrains the achievable cooperative gain. To address this issue, we propose a timing-aware satellite association strategy that enables cooperation only with satellites expected to satisfy a UT-side timing tolerance, thereby avoiding dominant asynchronous interference by design. Simulation results demonstrate that the proposed strategy improves throughput performance compared to single-satellite transmission and fully connected multi-satellite baselines.

eess.SP↗

Matching statistics in regular hypergraphs and applications

For fixed $k\ge3$, we determine the first sublinear correction to the logarithm of the matching partition function for a class of $n$-vertex $d$-regular $k$-uniform hypergraphs, uniformly for activities in each fixed compact interval of $(0,\infty)$.Our hypotheses include every regular linear hypergraph of polynomial degree and a class of nonlinear hypergraphs described by higher codegrees and intersection patterns, which we introduce here. The weighted counting estimate implies an averaged version of Kahn's conjecture: under the uniform measure, the expected number of uncovered vertices is $(1+o(1))nd^{-1/k}$, with concentration and large deviations on this scale. The proof combines a novel variant of random greedy counting, based on short stages and regular completions, with a new entropy method that uses intersection patterns to control reconstruction after deleting matching edges. We highlight the following applications. (i) Partial transversals in Latin squares. Every Latin square of order $n$ has $(n/e^2)^n\exp((3+o(1))n^{2/3})$ partial transversals. Also, almost all partial transversals have $(1+o(1))n^{2/3}$ missing cells. (ii) Linear $3$-uniform hypergraphs. There are $(n/e^2)^{n^2/6}\exp((1/2+o(1))n^{5/3})$ linear $3$-uniform hypergraphs on $[n]$, and almost all have $n^2/6-(1/6+o(1))n^{5/3}$ edges. (iii) Matroids of fixed rank. For each fixed $r\ge4$, the number $m(n,r)$ of rank-$r$ matroids on $[n]$ satisfies $\log m(n,r)=\frac{n^{r-1}}{r!}(\log n-r+1)+\left(\frac1{(r-1)!}+o(1)\right)n^{r-1-1/r}$, refining the estimates of van der Hofstad, Pendavingh and van der Pol.

math.CO↗

Computational Structure of Pairwise Housing Connectedness Networks

Directed housing-submarket networks combine common market movement with heterogeneous bilateral relations, and different node-level measures need not yield distinct empirical rankings. We construct a positive pairwise net-connectedness network from the generalized forecast error variance decomposition (GFEVD) of a vector autoregression (VAR) and use it to compare complementary node positions. Net directional connectedness (NET), PageRank, and Viral Centrality summarize net directional balance, recursively weighted incoming position, and normalized multistep reach. When bilateral net differences are nonzero, the network is a weighted tournament. A least-squares edge-flow decomposition separates the pairwise-net matrix into a NET-equivalent gradient component and a NET-orthogonal residual, while a monotone-allocation condition establishes exact PageRank-indegree correspondence in a transitive tournament. In Seoul's 25-district network, the gradient component accounts for 70.9% of the squared Frobenius norm, leaving 29.1% in the residual component. PageRank is strongly aligned with indegree (Spearman $ρ=0.987$), and Viral Centrality with outdegree ($ρ=0.935$); the PageRank alignment exceeds the range of independently weighted simulations with comparable tournament consistency and edge-weight variation. Three common-component treatments reduce total connectedness from 81.98% to 50.60-52.00%, a 36.6-38.3% reduction relative to the raw system, and reverse 97-98 of 300 pairwise net directions. Thus, both the magnitude and the apparent direction of connectedness depend materially on the treatment of citywide common movement. Songpa's positive NET position remains prominent across common-component treatments and dynamic specifications and ranks first in both chronological subsamples.

cs.CE↗

Random Cayley sum hypergraphs and $k$-fold sumsets

We denote by $f_k(Γ)$ the largest integer with the property that every subset of a finite abelian group $Γ$ of size at least $|Γ| - f_k(Γ)$ is a $k$-fold sumset. Extending a recent result of Alon and Pham, we prove that $$ f_k(Γ) \leq \widetilde{O} \left(n^{(2k-1)/(4k-3)}\right) $$ holds for all finite abelian groups $Γ$ and integers $k \geq 2$, where $n = |Γ|$. Additionally, we also show that the lower bound $f_k(Γ) \geq \widetildeΩ \left(n^{1/k}\right)$ holds if $Γ$ has no nontrivial element of order dividing $k$. Our upper bound improves a previous result of Balogh, Liu, and Sharifzadeh, and recovers the bound of Alon and Pham in the case $k = 2$. The proof relies on a new upper bound for the independence number of random Cayley sum hypergraphs, which may be of independent interest.

math.CO↗

Hamilton cycles in pseudorandom graphs: resilience and approximate decompositions

Dirac's classical theorem asserts that, for $n\ge 3$, any $n$-vertex graph with minimum degree at least $\frac{n}{2}$ is Hamiltonian. Furthermore, if we additionally assume that such graphs are regular and sufficiently large, then, by the breakthrough work of Csaba, Kühn, Lo, Osthus, and Treglown, they admit a decomposition into Hamilton cycles and at most one perfect matching, solving the well-known Nash-Williams conjecture. In the pseudorandom setting, it has long been conjectured that similar results hold in much sparser graphs. We prove two overarching theorems for graphs that exclude excessively dense subgraphs, which yield asymptotically optimal resilience and Hamilton-decomposition results in sparse pseudorandom graphs. Firstly, our results imply that for every fixed $γ>0$, there exists a constant $C>0$ such that if $G$ is a spanning subgraph of an $(n,d,λ)$-graph satisfying $δ(G)\ge\bigl(\tfrac12+γ\bigr)d$ and $d/λ\ge C$, then $G$ must contain a Hamilton cycle. Secondly, we show that for every $\varepsilon>0$, there is $C>0$ so that any $(n,d,λ)$-graph $G$ with $d/λ\ge C$ contains at least $\bigl(1-\varepsilon\bigr)\tfrac d2$ edge-disjoint Hamilton cycles, and, finally, we prove that the entire edge set of $G$ can be covered by no more than $\bigl(1+\varepsilon\bigr)\tfrac d2$ such cycles. All bounds are asymptotically optimal and significantly improve earlier results on Hamiltonian resilience, packing, and covering in sparse pseudorandom graphs.

math.CO↗

Proof of the Erdős-Szemerédi sunflower conjecture

In the 1970s, Erdős and Szemerédi conjectured that for any $n \ge k-1\ge 2$, any collection of subsets of $[n]$ not containing a $k$-sunflower has size at most $c_k^n$ for some $c_k<2$. In the $k=3$ case, this follows from the work of Croot, Lev, and Pach and Ellenberg and Gijswijt on the cap-set problem, through a reduction due to Alon, Shpilka, and Umans. We prove the conjecture for every $k \ge 3$.

math.CO↗

Counting cographs in locally dense graphs

An $n$-vertex graph $G$ is $(ρ, d)$-dense if for all $U \subseteq V(G)$ of size at least $ρn$, the induced subgraph $G[U]$ contains at least $\frac{d}{2}|U|^2$ edges. In 2010, partly motivated by the theory of quasirandomness, Kohayakawa, Nagle, Rödl, and Schacht conjectured that, for any fixed graph $F$, the number of homomorphic copies of $F$ in a given $n$-vertex $(o(1),d)$-dense graph is at least $(1-o(1))d^{e(F)}n^{v(F)}$. Despite considerable effort, only a few graphs are known to satisfy the conjecture. We find a new broad class of graphs that satisfy the conjecture, including cographs.

math.CO↗

A counting version of Petersen's $2$-factor theorem

A classical result of Petersen states that every regular graph of even degree has a $2$-factor. We prove that every $n$-vertex $2r$-regular simple graph contains at least $\left((1 + o_r(1))\frac{2r}{e}\right)^n$ distinct $2$-factors. This improves the previously known lower bound $\left((1 + o_r(1))\frac{r}{e}\right)^n$ by a factor of $2^{(1 + o(1))n}$ and is asymptotically tight for large $r$. As a direct consequence, we determine asymptotically tight bounds on the number of $2$-factorizations of a given $2r$-regular simple graph for every sufficiently large $r$.

math.CO↗

Computing Equilibria in Integer Programming Games with Shared Constraints

We develop a cutting-plane algorithm for computing pure Nash equilibria in finite integer games with shared constraints, where a deviation may be feasible against one opponent profile and infeasible against another. Conditional equilibrium inequalities capture this dependence through an explicit activation term. We give affine encodings of costs and activation conditions and prove that the resulting inequalities characterize the equilibrium set exactly. Embedded as lazy constraints in branch-and-cut, they yield the Generalized Zero-Regret algorithm for optimizing a linear objective over exact or approximate equilibria; a bisection procedure maintains certified bounds on the smallest achievable approximation factor. We also prove that, when the conditional polytopes have integral vertices, a concave cost is constant on the minimal face containing an equilibrium strategy, so strict concavity forces vertex strategies; for uniform integer-splittable bin packing, a cost-preserving transformation yields vertex equilibria even without strict concavity. We give formulations for bin packing, network formation, and knapsack games with shared capacities and evaluate the algorithm on 3,300 instances, computing a socially optimal equilibrium on all but 43, certifying nonexistence on 16, and certifying approximation factors within a few percent where no exact equilibrium exists.

math.OC↗

Exact and Matheuristic Methods for the Generalized Multiple Strip Packing Problem

We study the Generalized Multiple Strip Packing Problem (GMSPP), in which rectangular items are packed without overlap into open-ended strips of different widths and an item's dimensions may depend on the strip it is assigned to---a recently introduced model bridging cutting and packing and scheduling on heterogeneous platforms. While the single-strip problem possesses a mature exact toolbox, the GMSPP has so far been approached only heuristically. We close this gap with the first exact framework for the problem, covering the total-area and makespan objectives at once, and an extensive comparative study of exact and matheuristic methods. The framework comprises a combinatorial Benders decomposition whose variable-height master requires new $H_i$-aware conditional cuts, which we prove valid; a packing-aware LP dual bound proven to dominate the two previously available LP relaxations, and empirically stronger than the scheduling relaxation of Vasilyev et al. by up to $58\%$ on tall-item families; and a certified matheuristic coupling adaptive large neighborhood search with exact components, so that every run returns a machine-independent optimality certificate. The Benders decomposition proves the first optima reported for the GMSPP and remains the strongest method up to $n=800$; beyond that frontier the matheuristic delivers proven optima at $n=2532$ and $m=8$. All instances and code are released.

math.OC↗

Cooperative Integer Programming Games: Core Stability and Optimal Coalition Structures

We introduce cooperative integer programming games (CIPGs), in which agents pool budget constraints to accomplish indivisible tasks jointly and the characteristic function maps every coalition to the optimal value of a pooled integer program. Our goal is to identify an optimal coalition structure (OCS) and a stable one (OSCS). We derive a stability inequality that keeps each formed coalition in the Core with respect to itself, and present two mixed-integer OCS formulations, aggregated and disaggregated, proving that the disaggregated formulation is integer-equivalent yet yields a tighter LP relaxation. Building on the stability inequality we develop lifted stability cuts, several separation strategies inside a cutting-plane algorithm, an SCS-feasible primal heuristic that constructs warm starts with guaranteed stability, and a payoff-refinement step computing the Shapley value and the nucleolus of every formed coalition. On benchmark cooperative knapsack games, the method certifies optimality with up to 16 players and reaches MIP gaps below 1% at 30 players while evaluating 766 of the roughly $10^9$ coalition values.

math.OC↗

Markovian Shock-Source Tracing and Multidimensional Asset Roles in Exchange Rates, Gold Futures, and Bitcoin

This study examines cross-asset connectedness in an international financial network of major exchange rates, gold futures, and Bitcoin. Moving beyond the conventional net transmitter--receiver classification, we characterize asset roles through three complementary dimensions: direct spillover transmission, stationary source-tracing dynamics, and multistep upstream connectivity. Return spillovers are estimated using VAR generalized forecast-error variance decomposition (VAR-GFEVD). The positive pairwise net-spillover structure is then mapped into a row-stochastic Markov kernel whose transitions trace dominant net-spillover sources in the reverse direction of the original transmission edges. A stationary departure flux describes long-run movement in this source-tracing chain, while Viral Centrality is evaluated by the deterministic probability-propagation algorithm of Fink et al. to approximate multistep upstream reach. Empirically, gold futures emerge as the dominant direct net transmitter and the leading stationary source-tracing node, but do not have the largest Viral Centrality. Several exchange-rate nodes classified as direct net receivers have relatively high Viral Centrality, indicating broad conditional access to upstream source nodes. Bitcoin occupies an intermediate role. An auxiliary specification including the U.S. Dollar Index yields qualitatively similar role differentiation. The results show that direct connectedness, stationary source tracing, and approximate multistep upstream reach cannot be inferred from NET spillovers alone. All diffusion interpretations are descriptive and conditional on the estimated network, row normalization, and restart closure.

cs.CE↗

Kahn--Lovász-type inequalities for graph factors

The Kahn--Lovász theorem gives a sharp upper bound on the number of perfect matchings in a graph in terms of its degree sequence, extending the classical Brégman--Minc inequality for bipartite graphs. In this paper, we establish an asymptotically sharp extension of the Kahn--Lovász theorem to $F$-factors for every Hamiltonian graph $F$. As a consequence, we asymptotically determine the maximum number of $F$-factors in an $n$-vertex $m$-edge graph, yielding an $F$-factor analogue of Kruskal--Katona-type theorems. We also prove a multigraph analogue of the Kahn--Lovász theorem. Combining this with our results for Hamiltonian graphs, we obtain an asymptotically sharp Kruskal--Katona-type bound for a further class of connected graphs $F$, including those containing two vertex-disjoint cycles of equal length whose union spans $V(F)$.

math.CO↗

Product representations of polynomials over finite fields

Erdős, Sárközy, and Sós studied the asymptotics of the maximum size of a subset of $\{1,2,\ldots, N\}$ such that it does not contain $k$ distinct elements whose product is a perfect square. More generally, Verstraëte proposed a conjecture regarding the asymptotic behavior of the same quantity with the set of perfect squares replaced by the value set of a polynomial in $\mathbb{Z}[x]$. In this paper, we study a finite field analogue of Verstraëte's conjecture.

math.CO↗

Lonely runners in real life: Sharp bounds for time-dependent velocities

Motivated by the celebrated Lonely Runner Conjecture, we study a variant in which the runners have time-dependent velocities. Let $n \geq 3$ runners start from the same point on the unit circle, where each runner $i\in[n]$ has a locally integrable velocity function $ν_i\in L^1_{\mathrm{loc}}(\mathbb{R}_{>0})$. Assume that their velocities are strictly ordered almost everywhere and that the relative distance between every pair diverges. We prove that each of the slowest and fastest runners is at a distance strictly larger than $2^{-n+1}$ from every other runner at some time. Moreover, we show that the distance $2^{-n+1}$ is optimal. On the other hand, we construct examples in which every intermediate runner remains arbitrarily close to another runner at all times. As a consequence, we also obtain a sharp nonlinear analogue of a classical theorem of Schoenberg on billiard ball motion in the unit cube.

math.CO↗

Spanning clique subdivisions in pseudorandom graphs

In this paper, we study the appearance of a spanning subdivision of a clique in graphs satisfying certain pseudorandom conditions. Specifically, we show the following three results. Firstly, that there are constants $C>0$ and $c\in (0,1]$ such that, whenever $d/λ\ge C$, every $(n,d,λ)$-graph contains a spanning subdivision of $K_t$ for all $2\le t \le \min\{cd,c\sqrt{\frac{n}{\log n}}\}$. Secondly, that there are constants $C>0$ and $c\in (0,1]$ such that, whenever $d/λ\ge C\log^3n$, every $(n,d,λ)$-graph contains a spanning nearly-balanced subdivision of $K_t$ for all $2\le t \le \min\{cd,c\sqrt{\frac{n}{\log^3n}}\}$. Finally, we show that for every $μ>0$, there are constants $c,\varepsilon\in (0,1]$ and $n_0\in \mathbb N$ such that, whenever $n\ge n_0$, every $n$-vertex graph with minimum degree at least $μn$ and no bipartite holes of size $\varepsilon n$ contains a spanning nearly-balanced subdivision of $K_t$ for all $2\le t \le c\sqrt{n}$.

math.CO↗

Tree-based methods for length-biased survival data

Left-truncated survival data commonly arise in prevalent cohort studies, where only individuals who have experienced disease onset and survived until enrollment in the study. When the onset process follows a stationary Poisson process, the resulting data are length-biased. This sampling mechanism induces a selection bias towards longer survival individuals, and statistical methods for traditional survival data are not directly applicable. While tree-based methods developed for left-truncated data can be applied, they may be inefficient for length-biased data, as they do not account for the distribution of truncation times. To address this, we propose new survival trees and forests for length-biased right-censored data within the conditional inference framework. Our approach uses a score function derived from the full likelihood to construct permutation test statistics for variable splitting. For survival prediction, we consider two estimators of the unbiased survival function, differing in statistical efficiency and computational complexity. These elements enhance efficiency in tree construction and improve accuracy of survival prediction in ensemble settings. Simulation studies demonstrate efficiency gains in both tree recovery and survival prediction, often exceeding the gains from ensembling alone. We further illustrate the utility of the proposed methods using lung cancer data from the Cancer Public Library Database, a nationwide cancer registry in South Korea.

stat.ME↗

Tower heights for color-avoiding Ramsey numbers of monotone paths

Ramsey numbers of monotone paths in ordered hypergraphs form a natural higher-uniformity extension of the classical Erdős--Szekeres theorems, and their tower height was determined by Moshkovitz and Shapira. A color-avoiding variant, initiated by Loh and further developed by Gowers and Long and by Mulrenin, Pohoata, and Zakharov, asks for monotone paths whose edges use only a bounded number of colors rather than a single color. For integers $q>p$, let $A_k(n;q,p)$ be the least integer $N$ such that every $q$-coloring of the ordered complete $k$-uniform hypergraph on $\{1,\ldots,N\}$ contains a monotone path of length $n$ whose edges use at most $p$ colors. We prove that, for every fixed $p$ and all sufficiently large $q$, the exact tower height of $A_k(n;q,p)$ is $\lceil (k-1)/p\rceil$. Thus the number of colors allowed on the path affects the Ramsey number at the level of tower height: allowing $p$ colors lowers the height from $k-1$ in the monochromatic problem to $\lceil (k-1)/p\rceil$. This answers questions of Mulrenin, Pohoata, and Zakharov. The upper bound follows from a simple block-compression argument. The main contribution is the matching lower bound, for which we develop a novel variant of the stepping-up method. A surprising feature of the proof is the appearance of the Morse--Hedlund theorem, a foundational result in symbolic dynamics and combinatorics on words. We establish and use a finite version of this theorem, which may be of independent interest.

math.CO↗