English
Related papers

Related papers: Partition Parameters for Girth Maximum (m, r) BTUs

200 papers

The Steiner $k$-eccentricity of a vertex $v$ of a graph $G$ is the maximum Steiner distance over all $k$-subsets of $V (G)$ which contain $v$. In this note, we design a linear algorithm for computing the Steiner $3$-eccentricities and the…

Data Structures and Algorithms · Computer Science 2021-02-23 Aleksandar Ilic

We employ signed measures that are positive definite up to certain degrees to establish Levenshtein-type upper bounds on the cardinality of codes with given minimum and maximum distances, and universal lower bounds on the potential energy…

Information Theory · Computer Science 2019-10-17 Peter Boyvalenkov , Peter Dragnev , Douglas Hardin , Edward Saff , Maya Stoyanova

We consider the uplink of a multiuser massive MIMO system wherein a base station (BS) having $M$ antennas communicates coherently with $K$ single antenna user terminals (UTs). We study the energy efficiency of this system while taking the…

Information Theory · Computer Science 2014-04-14 Sudarshan Mukherjee , Saif Khan Mohammed

Maximum distance separable (MDS) are constructed to required specifications. The codes are explicitly given over finite fields with efficient encoding and decoding algorithms. Series of such codes over finite fields with ratio of distance…

Information Theory · Computer Science 2021-10-27 Ted Hurley , Donny Hurley , Barry Hurley

We consider the problem of determining the maximal $\alpha \in (0,1]$ such that every matching $M$ of size $k$ (or at most $k$) in a bipartite graph $G$ contains an induced matching of size at least $\alpha |M|$. This measure was recently…

Data Structures and Algorithms · Computer Science 2018-09-11 Noga Alon , Jonathan D. Cohen , Thomas L. Griffiths , Pasin Manurangsi , Daniel Reichman , Igor Shinkar , Tal Wagner , Alexander Yu

We consider the problem of computing the largest-area bichromatic separating box among a set of $n$ red points and a set of $m$ blue points in three dimensions. Currently, the best-known algorithm to solve this problem takes $O(m^2 (m +…

Computational Geometry · Computer Science 2020-12-24 Bogdan Armaselu

The maximum graph bisection problem is a well known graph partition problem. The problem has been proven to be NP-hard. In the maximum graph bisection problem it is required that the set of vertices is divided into two partition with equal…

Discrete Mathematics · Computer Science 2015-12-03 Zoran Maksimovic

In combinatorial optimization, partial variable assignments are called persistent if they agree with some optimal solution. We propose persistency criteria for the multicut and max-cut problem as well as fast combinatorial routines to…

Optimization and Control · Mathematics 2018-12-05 Jan-Hendrik Lange , Bjoern Andres , Paul Swoboda

Quantitative estimates related to the classical Borsuk problem of splitting set in Euclidean space into subsets of smaller diameter are considered. For a given $k$ there is a minimal diameter of subsets at which there exists a covering with…

Metric Geometry · Mathematics 2022-10-25 Alexander Tolmachev , Dmitry Protasov , Vsevolod Voronov

We study Gibbs measures on the $d$-dimensional torus with $L^2$-(super)critical focusing interaction potentials. We establish a precise divergence rate of the partition function as we remove regularization, where the optimal constant is…

Probability · Mathematics 2025-09-03 Damiano Greco , Guopeng Li , Rui Liang , Tadahiro Oh , Yuzhao Wang

We describe optimal robust algorithms for finding a triangle and the unweighted girth in a unit disk graph, as well as finding a triangle in a transmission graph.In the robust setting, the input is not given as a set of sites in the plane,…

Computational Geometry · Computer Science 2024-05-03 Katharina Klost , Wolfgang Mulzer

We introduce series-triangular graph embeddings and show how to partition point sets with them. This result is then used to improve the upper bound on the number of Steiner points needed to obtain compatible triangulations of point sets.…

Computational Geometry · Computer Science 2007-05-23 Jeff Danciger , Satyan L. Devadoss , Don Sheehy

A mixture density, $f_p,$ is estimable in $R^d, \ d \ge 1,$ but an estimate for the mixing density, $p,$ is usually obtained only when $d$ is unity; $h$ is the mixture's kernel. When $f_p$'s estimate has form $f_{\hat p_n}$ and $p$ is…

Statistics Theory · Mathematics 2025-01-28 Yannis G. Yatracos

A subset $M$ of the edge set of a graph $G$ is an induced matching of $G$ if given any two $e_1,e_2 \in M$, none of the vertices on $e_1$ is adjacent to any of the vertices on $e_2$. Suppose that $MIM_G$, a positive integer, is the largest…

Combinatorics · Mathematics 2016-11-08 Tayo C. Adefokun , Deborah O. A. Ajayi

We characterize finite-time thermodynamic processes of multidimensional quadratic overdamped systems. Analytic expressions are provided for heat, work, and dissipation for any evolution of the system covariance matrix. The Bures-Wasserstein…

Statistical Mechanics · Physics 2022-11-28 Paolo Abiuso , Viktor Holubec , Janet Anders , Zhuolin Ye , Federico Cerisola , Martí Perarnau-Llobet

The acceleration of lithium tube segments with the length one centimeter, diameter sixteen microns wall thickness one nanometer is considered. These segments are electrically charged by proton beams produced by an electron beam source.…

Plasma Physics · Physics 2013-11-22 S. N. Dolya

We analyze the $B$ anomalies associated with the $B\to D^{(*)}\tau\nu$ decays in the unparticle model. The fraction of the branching ratios $R(D^{(*)})$ and other parameters related to the polarization are fitted to the experimental data by…

High Energy Physics - Phenomenology · Physics 2020-12-23 Jong-Phil Lee

In this study, we attempt to characterize the shape of three different types of grains commonly used in the iron and steel-making industry, namely pellet, sinter and iron ore lump. We choose particles over the entire size ranges used in…

In a previous work it was shown that the best measure for the efficiency of a single burst-correcting code is obtained using the Gallager bound as opposed to the Reiger bound. In this paper, an efficient algorithm that searches for the best…

Discrete Mathematics · Computer Science 2011-01-31 Luis Javier García Villalba , José René Fuentes Cortez , Ana Lucila Sandoval Orozco , Mario Blaum

The final state of a binary black hole merger is predicted with high precision by numerical relativity, but could there be a simple thermodynamic principle within general relativity that governs the selection of the remnant? Using…

General Relativity and Quantum Cosmology · Physics 2026-02-02 Monica Rincon-Ramirez , Nathan K. Johnson-McDaniel , Eugenio Bianchi , Ish Gupta , Vaishak Prasad , B. S. Sathyaprakash
‹ Prev 1 8 9 10 Next ›