Related papers: Multi-wise and constrained fully weighted Davenpor…

We present new deterministic algorithms for computing distributed weighted minimum weight cycle (MWC) in undirected and directed graphs and distributed weighted all nodes shortest cycle (ANSC) in directed graphs. Our algorithms for these…

In these talks we review some of the recent results on open strings and noncommutative gauge theories, starting from the early calculations of open strings in a constant electromagnetic background. We discuss both the neutral string and the…

The weight distribution of error correction codes is a critical determinant of their error-correcting performance, making enumeration of utmost importance. In the case of polar codes, the minimum weight $\wm$ (which is equal to minimum…

Let $M$ be a smooth manifold equipped with a conformal structure, $E[w]$ the space of densities with the the conformal weight $w$ and $D_{w,w+\de}$ the space of differential operators from $E[w]$ to $E[w+\delta]$. Conformal quantization $Q$…

We explore negative dependence and stochastic orderings, showing that if an integer-valued random variable $W$ satisfies a certain negative dependence assumption, then $W$ is smaller (in the convex sense) than a Poisson variable of equal…

I define multiple Watson values (MWVs) as iterated integrals, on the interval $x\in[0,1]$, of the 6 differential forms $A=d\log(x)$, $B=-d\log(1-x)$, $T=-d\log(1-z_1x)$, $U=-d\log(1-z_2x)$, $V=-d\log(1-z_3x)$ and $W=-d\log(1-z_4x)$, where…

Let $G$ be a finite group. By a sequence over $G$, we mean a finite unordered sequence of terms from $G$, where repetition is allowed, and we say that it is a product-one sequence if its terms can be ordered such that their product equals…

A pair of non-empty subsets $(W,W')$ in an abelian group $G$ is an additive complement pair if $W+W'=G$. $W'$ is said to be minimal to $W$ if $W+(W'\setminus \{w'\}) \neq G, \forall \,w'\in W'$. In general, given an arbitrary subset in a…

A weighted $d-$complex is a simplicial complex of dimension $d$ in which each face is assigned a real-valued weight. We derive three key results here concerning persistence diagrams and minimal spanning acycles (MSAs) of such complexes.…

We study six-dimensional N=(1,0) supergravity theories with abelian, as well as non-abelian, gauge group factors. We show that for theories with fewer than nine tensor multiplets, the number of possible combinations of gauge groups -…

Let G be a finite abelian group. For g in G and i an integer we define N(i,g) to be the number of subsets of G of size i which sum up to g. We will give a short proof, using character theory, of a formula for these N(i,g) due to Li and Wan.…

Given $A\subseteq\mathbb Z_n$, the constant $C_A(n)$ is defined to be the smallest natural number $k$ such that any sequence of $k$ elements in $\mathbb Z_n$ has an $A$-weighted zero-sum subsequence having consecutive terms. The value of…

Let $G$ be a finite group. A sequence over $G$ is a finite multiset of elements of $G$, and it is called product-one if its terms can be ordered so that their product is the identity of $G$. The large Davenport constant $\D(G)$ is the…

The weight of a coset of a code is the smallest Hamming weight of any vector in the coset. For a linear code of length $n$, we call integral weight spectrum the overall numbers of weight $w$ vectors, $0\le w\le n$, in all the cosets of a…

Let $n \ge 8$ be even, and let $G = \langle x, y \mid x^2 = y^{n/2}, y^n = 1, yx = xy^s \rangle$, where $s^2 \equiv 1 \pmod n$ and $s \not\equiv \pm1 \pmod n$. In this paper, we provide the precise values of some zero-sum constants over…

We propose a unified theory of generalized weights for linear codes endowed with an arbitrary distance. Instead of relying on supports or anticodes, the weights of a code are defined via the intersections of the code with a chosen family of…

Let $G$ be a dp-minimal group; we prove some consequences of several different hypotheses on $G$. First, if $G$ is torsion-free, then it is abelian. Second, if $G$ admits a distal f-generic type, then it is virtually nilpotent; we prove…

Van der Waerden's theorem states that for any positive integers $k$ and $r$, there exists a smallest value $n = w(k,r)$, called the van der Waerden number, such that every $r$-coloring of $\{1,\dots,n\}$ contains a monochromatic $k$-term…

The edge isoperimetric inequality in the discrete cube specifies, for each pair of integers $m$ and $n$, the minimum size $g_n(m)$ of the edge boundary of an $m$-element subset of $\{0,1\}^{n}$; the extremal families (up to automorphisms of…

An $n$-vertex graph $G$ is weakly $F$-saturated if $G$ contains no copy of $F$ and there exists an ordering of all edges in $E(K_n) \setminus E(G)$ such that, when added one at a time, each edge creates a new copy of $F$. The minimum size…