English
Related papers

Related papers: Weighted File Placements on Singleton Boards

200 papers

In the \emph {barrier resilience} problem (introduced by Kumar {\em et al.}, Wireless Networks 2007), we are given a collection of regions of the plane, acting as obstacles, and we would like to remove the minimum number of regions so that…

Computational Complexity · Computer Science 2017-06-07 Matias Korman , Maarten Löffler , Rodrigo I. Silveira , Darren Strash

\textit{Parastichies} are spiral patterns observed in plants and numerical patterns generated using golden angle method. We generalize this method by using Markoff theory and the theory of product of linear forms, to obtain a theory for…

Number Theory · Mathematics 2024-09-27 S. E. Graiff Zurita , B. Kane , R. Oishi-Tomiyasu

The ratio between the probability that two distributions $R$ and $P$ give to points $x$ are known as importance weights or propensity scores and play a fundamental role in many different fields, most notably, statistics and machine…

Machine Learning · Computer Science 2021-03-11 Parikshit Gopalan , Omer Reingold , Vatsal Sharan , Udi Wieder

For every $m\in\mathbb{N}$, we establish the convergence of the averaged distributions of the zeros of the $m$-th order derivatives $(f^n)^{(m)}$ of the iterated polynomials $f^n$ of a polynomial $f\in\mathbb{C}[z]$ of degree $>1$ towards…

Dynamical Systems · Mathematics 2024-01-10 Yûsuke Okuyama

We give a precise description of how the class group of a number field measures the failure of unique factorization in its ring of integers. Specifically, following ideas of Kummer, we determine the structure of all irreducible…

Number Theory · Mathematics 2014-12-30 Kimball Martin

For graphs F and G an F-matching in G is a subgraph of G consisting of pairwise vertex disjoint copies of F. The number of F-matchings in G is denoted by s(F,G). We show that for every fixed positive integer m and every fixed tree F, the…

Combinatorics · Mathematics 2010-06-29 Noga Alon , Simi Haber , Michael Krivelevich

In this paper, we introduce and formalize a rank-one partitioning learning paradigm that unifies partitioning methods that proceed by summarizing a data set using a single vector that is further used to derive the final clustering…

Machine Learning · Computer Science 2020-09-02 Charlotte Laclau , Franck Iutzeler , Ievgen Redko

Motivated by the landmark resolution of the 1-2-3 Conjecture, we initiate the study of the parameterized complexity of the Vertex-Coloring {0,1}-Edge-Weighting problem and its generalization, Vertex-Coloring Pre-edge-Weighting, under…

Data Structures and Algorithms · Computer Science 2026-04-15 Shubhada Aute , Fahad Panolan , Geevarghese Philip

In the recent work \cite{shi18}, a combinatorial problem concerning linear codes over a finite field $\F_q$ was introduced. In that work the authors studied the weight set of an $[n,k]_q$ linear code, that is the set of non-zero distinct…

Information Theory · Computer Science 2022-07-18 Tim L. Alderson , Alessandro Neri

The main result of this article is a fantastic generalization of a classical result in graded ring theory. In fact, our result states that if $S$ is a multiplicative set of homogeneous elements of an $M$-graded commutative ring…

Commutative Algebra · Mathematics 2026-04-17 Abolfazl Tarizadeh

In this paper, based on the theory of defining sets, two classes of five-weight or six-weight linear codes over Fp are constructed. The weight distributions of the linear codes are determined by means of Weil sums and a new type of…

Information Theory · Computer Science 2021-04-09 Xina Zhang

In 1998 Hoholdt, van Lint and Pellikaan introduced the concept of a ``weight function'' defined on a F_q-algebra and used it to construct linear codes, obtaining among them the algebraic-geometric (AG) codes supported on one point. Later it…

Information Theory · Computer Science 2008-07-22 Cicero Carvalho , Ercilio Silva

From a detailed analysis of cone-jet cross sections in effective field theory, we obtain novel factorization theorems which separate the physics associated with different energy scales present in such processes. The relevant low-energy…

High Energy Physics - Phenomenology · Physics 2017-05-08 Thomas Becher , Matthias Neubert , Lorena Rothen , Ding Yu Shao

Graph pebbling is a combinatorial game played on an undirected graph with an initial configuration of pebbles. A pebbling move consists of removing two pebbles from one vertex and placing one pebble on an adjacent vertex. The pebbling…

Combinatorics · Mathematics 2023-12-21 Dominic Flocco , Jonad Pulaj , Carl Yerger

A Riemann-Roch theorem on graph was initiated by M. Baker and S. Norine. In their article [2], a Riemann-Roch theorem on a finite graph with uniform vertex-weight and uniform edge-weight was established and it was suggested a Riemann-Roch…

Combinatorics · Mathematics 2022-01-20 Atsushi Atsuji , Hiroshi Kaneko

We study random typical minimal factorizations of the $n$-cycle into transpositions, which are factorizations of $(1, \ldots,n)$ as a product of $n-1$ transpositions. By viewing transpositions as chords of the unit disk and by reading them…

Probability · Mathematics 2018-12-04 Valentin Féray , Igor Kortchemski

Mayer's theory of cluster integrals allows one to write the partition function of a gas model as a generating function of weighted graphs. Recently, Labelle, Leroux and Ducharme have studied the graph weights arising from the…

Combinatorics · Mathematics 2009-06-18 Olivier Bernardi

Study of the matrix-level affine algebra $U_{m,K}$ is motivated by conformal field theory and the fractional quantum Hall effect. Gannon completed the classification of $U_{m,K}$ modular-invariant partition functions. Here we connect the…

High Energy Physics - Theory · Physics 2014-01-29 Ali Nassar , Mark A. Walton

The Norros-Reittu model is a random graph with $n$ vertices and i.i.d. weights assigned to them. The number of edges between any two vertices follows an independent Poisson distribution whose parameter is increasing in the weights of the…

Probability · Mathematics 2023-11-30 Matthias Lienau , Matthias Schulte

We use localization to describe the restriction map from equivariant Chow cohomology to ordinary Chow cohomology for complete toric varieties in terms of piecewise polynomial functions and Minkowski weights. We compute examples showing that…

Algebraic Geometry · Mathematics 2008-12-07 Eric Katz , Sam Payne