Related papers: Further Results on Pure Summing Registers and Comp…
The de Bruijn torus (or grid) problem looks to find an $n$-by-$m$ binary matrix in which every possible $j$-by-$k$ submatrix appears exactly once. The existence and construction of these binary matrices was determined in the 70's, with…
This paper presents a method to find new De Bruijn cycles based on ones of lesser order. This is done by mapping a De Bruijn cycle to several vertex disjoint cycles in a De Bruijn digraph of higher order and connecting these cycles into one…
In Direct Sum problems [KRW], one tries to show that for a given computational model, the complexity of computing a collection of finite functions on independent inputs is approximately the sum of their individual complexities. In this…
Sum rules are elegant formulas that relate entropy functionals to coefficients associated with orthogonal polynomials [Sim11]. In a series of paper (see for example [GNR16], [GNR17], [BSZ18a], [BSZ18b]), interesting connections have been…
We perform a systematic study of $SU(2)$ flavor amplitude sum rules with particular emphasis on $U$-spin. This study reveals a rich mathematical structure underlying the sum rules that allows us to formulate an algorithm for deriving all…
Let $k$ be a field of positive characteristic $p$, and $X$ be a separated of finite type $k$-scheme of dimension $d$. We construct a cycle map from the additive cycle complex to the residual complex of Serre-Grothendieck coherent duality…
A graph-theoretic parameter, in a form of a function, called the extra-factorial sum is discussed. The main results are presented in ref. [1] (Nastou et al., Optim Lett, 10, 1203-1220, 2016) and the reader is strongly advised to study the…
The CHY construction naturally associates a vector in $\mathbb{R}^{(n-3)!}$ to every 2-regular graph with $n$ vertices. Partial amplitudes in the biadjoint scalar theory are given by the inner product of vectors associated with a pair of…
This note presents a new proof of an important result due to Bourgain and Tzafriri that provides a partial solution to the Kadison--Singer problem. The result shows that every unit-norm matrix whose entries are relatively small in…
We propose an ensemble algorithm, which provides a new approach for evaluating and summing up a set of function samples. The proposed algorithm is not a quantum algorithm, insofar it does not involve quantum entanglement. The query…
Algorithms for resolving majority cycles in preference aggregation have been studied extensively in computational social choice. Several sophisticated cycle-resolving methods, including Tideman's Ranked Pairs, Schulze's Beat Path, and…
We study streaming algorithms for proportionally fair clustering, a notion originally suggested by Chierichetti et. al. (2017), in the sliding window model. We show that although there exist efficient streaming algorithms in the…
Let, for r>=2, (m_r(n)),n>=0, be Moser sequence such that every nonnegative integer is the unique sum of the form s_k+rs_l. In this article we give an explicit decomposition formulas of such form and an unexpectedly simple recursion…
Using determinant representations for partition functions of the corresponding square ice models and the method proposed recently by one of the authors, we investigate refined enumerations of vertically symmetric alternating-sign matrices,…
The first part of the paper is a brief overview of Hindman's finite sums theorem, its prehistory and a few of its further generalizations, and a modern technique used in proving these and similar results, which is based on idempotent…
Tur\'an problems in extremal combinatorics ask to find asymptotic bounds on the edge densities of graphs and hypergraphs that avoid specified subgraphs. The theory of flag algebras proposed by Razborov provides powerful methods based on…
Matrix completion is widely used in machine learning, engineering control, image processing, and recommendation systems. Currently, a popular algorithm for matrix completion is Singular Value Threshold (SVT). In this algorithm, the singular…
We give a survey of several models of irreducible complementary series representations and their limits, special representations, for the groups SU(n,1) and SO(n,1), including new ones. These groups, whose geometrical meaning is well known,…
The nonlinear signal processing has achieved a rapid process in the recent years. A family of nonlinear Fourier bases, as a typical family of mono-component signals, has been constructed and applied to signal processing. In this paper, the…
Popular centroid-based clustering methods are typically optimized for global objectives, and may fail to adequately represent large groups of datapoints. Thus, one needs proportionality notions suited for metric settings. Ideally, such…