Related papers: Weighted File Placements on Singleton Boards
We construct a pairing, which we call factorization homology, between framed manifolds and higher categories. The essential geometric notion is that of a vari-framing of a stratified manifold, which is a framing on each stratum together…
A natural generalization of a regular (or equitable) partition of a graph, which makes sense also for non-regular graphs, is the so-called weight-regular partition, which gives to each vertex $u\in V$ a weight that equals the corresponding…
We investigate random connected graphs from a block-stable class whose distribution is weighted based on the number of $2$-connected components, or blocks. This includes the class of planar graphs. For this, we develop a notion of a…
Group lifting structures are introduced to provide an algebraic framework for studying lifting factorizations of two-channel perfect reconstruction finite-impulse-response (FIR) filter banks. The lifting factorizations generated by a group…
We extend the recently much-studied Hardy factorization theorems to the weight case. The key point of this paper is to establish the factorization theorems without individual condition on the weight functions. As a direct application, we…
In the early 1990s the works of Larson, Wogen and Argyros, Lambrou, Longstaff disclosed an example of a strong $M$-basis that did not admit a linear summation method. We study a class of $M$-bases $\mathfrak{F}=\{f_n\}_{n=1}^\infty$ in the…
Verifying graph algorithms has long been considered challenging in separation logic, mainly due to structural sharing between graph subcomponents. We show that these challenges can be effectively addressed by representing graphs as a…
In this paper, we consider a general discrete-time spectral factorization problem for rational matrix-valued functions. We build on a recent result establishing existence of a spectral factor whose zeroes and poles lie in any pair of…
We generalize the non-negative matrix factorization algorithm of Lee and Seung to accept a weighted norm, and to support ridge and Lasso regularization. We recast the Lee and Seung multiplicative update as an additive update which does not…
We deal with unweighted and weighted enumerations of lozenge tilings of a hexagon with side lengths $a,b+m,c,a+m,b,c+m$, where an equilateral triangle of side length $m$ has been removed from the center. We give closed formulas for the…
Meinardus proved a general theorem about the asymptotics of the number of weighted partitions, when the Dirichlet generating function for weights has a single pole on the positive real axis. Continuing \cite{GSE}, we derive asymptotics for…
Packing graphs is a combinatorial problem where several given graphs are being mapped into a common host graph such that every edge is used at most once. In the planar tree packing problem we are given two trees T1 and T2 on n vertices and…
This paper proves a conditional structural uniqueness theorem for induced weight on robust record sectors within an admissible Hilbert record layer. Its theorem target and additive carrier differ from those of the standard Born-rule routes:…
The zero sets of the Bergman space $A^p_\omega$ induced by either a radial weight $\omega$ admitting a certain doubling property or a non-radial Bekoll\'e-Bonami type weight are characterized in the spirit of Luecking's results from 1996.…
The purpose of this paper is to find an explicit formula and asymptotic estimate for the total number of sum of weighted records over set partitions of $[n]$ in terms of Bell numbers. For that we study the generating function for the number…
In the context of confirmatory factor analysis, the independent clusters model has been found to be overly restrictive in several research contexts. Therefore, a less restrictive criterion for parsimony of non-salient loadings in…
We introduce the combinatorial notion of a $q$-fatorization graph intended as a tool to study and express results related to the classification of prime simple modules for quantum affine algebras. These are directed graphs equipped with…
Let R be any subring of the reals. We present a generalization of linear systems on graphs where divisors are R-valued functions on the set of vertices and graph edges are permitted to have nonegative weights in R. Using this…
In this paper we present a combinatorial generalization of the fact that the number of plane partitions that fit in a $2a\times b\times b$ box is equal to the number of such plane partitions that are symmetric, times the number of such…
Fiber bundle models (FBM's) have been used to model the failure of fibrous composites as load-sharing systems since the 1960's when Rosen (1964 and 1965) conducted some remarkable experiments on unidirectional fibrous composites. These…