English
Related papers

Related papers: Selectively Balancing Unit Vectors

200 papers

Let $v(n)$ be the minimum number of voters with transitive preferences which are needed to generate any strong preference pattern (ties not allowed) on $n$ candidates. Let $k=\lfloor \log_2 n\rfloor$. We show that $v(n)\le n-k$ if $n$ and…

Combinatorics · Mathematics 2012-06-06 M. A. Fiol

The stability properties of simple element choices for the mixed formulation of the Laplacian are investigated numerically. The element choices studied use vector Lagrange elements, i.e., the space of continuous piecewise polynomial vector…

Numerical Analysis · Mathematics 2018-11-13 Douglas N. Arnold , Marie E. Rognes

In the impartial selection problem, a subset of agents up to a fixed size $k$ among a group of $n$ is to be chosen based on votes cast by the agents themselves. A selection mechanism is impartial if no agent can influence its own chance of…

Computer Science and Game Theory · Computer Science 2024-08-06 Javier Cembrano , Svenja M. Griesbach , Maximilian J. Stahlberg

We study pointwise convergence properties of weakly* converging sequences $\{u_i\}_{i \in {\mathbb N}}$ in $\mathrm{BV}({\mathbb R}^n)$. We show that, after passage to a suitable subsequence (not relabeled), we have pointwise convergence…

Functional Analysis · Mathematics 2021-12-08 Lisa Beck , Panu Lahti

One can recover vectors from $\mathbb{R}^m$ with arbitrary precision, using only $\lceil \log_2(m+1)\rceil +1$ continuous measurements that are chosen adaptively. This surprising result is explained and discussed, and we present…

Numerical Analysis · Mathematics 2024-12-10 David Krieg , Erich Novak , Mario Ullrich

Checking whether a system of linear equations is consistent is a basic computational problem with ubiquitous applications. When dealing with inconsistent systems, one may seek an assignment that minimizes the number of unsatisfied…

Data Structures and Algorithms · Computer Science 2022-08-05 Konrad K. Dabrowski , Peter Jonsson , Sebastian Ordyniak , George Osipov , Magnus Wahlström

Let $(\xi,\eta)$ be a pair of jointly stationary, ergodic random measures of equal finite intensity. A balancing allocation is a translation-invariant (equivariant) map $T:\mathbb{R}^d\to\mathbb{R}^d$ such that the image measure of $\xi$…

Probability · Mathematics 2023-03-02 Martin Huesmann , Bastian Müller

Recent work has shown that models trained to the same objective, and which achieve similar measures of accuracy on consistent test data, may nonetheless behave very differently on individual predictions. This inconsistency is undesirable in…

Machine Learning · Computer Science 2021-11-17 Emily Black , Klas Leino , Matt Fredrikson

In this paper, we treat minimal left-invariant unit vector fields on oscillator group and their relations with the ones that define a harmonic map. Particularly, if all structure constants of the oscillator group are equal to each other,…

Differential Geometry · Mathematics 2025-01-23 Alexander Yampolsky

For any natural number $n\in\mathbb{N}$, $ \frac{1}{2n+\frac1{1-\gamma}-2}\le \sum_{i=1}^n\frac1i-\ln n-\gamma<\frac{1}{2n+\frac13}, $ where $\gamma=0.57721566490153286...m$ denotes Euler's constant. The constants $\frac{1}{1-\gamma}-2$ and…

Classical Analysis and ODEs · Mathematics 2012-08-21 Chao-Ping Chen , Feng Qi

A celebrated theorem due to Bannai-Bannai-Stanton says that if $A$ is a set of points in $\mathbb{R}^{d}$, which determines $s$ distinct distances, then $$|A| \leq {d+s \choose s}.$$ In this note, we give a new simple proof of this result…

Combinatorics · Mathematics 2019-12-18 Fedor Petrov , Cosmin Pohoata

Joint degree vectors give the number of edges between vertices of degree $i$ and degree $j$ for $1\le i\le j\le n-1$ in an $n$-vertex graph. We find lower and upper bounds for the maximum number of nonzero elements in a joint degree vector…

Combinatorics · Mathematics 2017-02-23 Eva Czabarka , Johannes Rauh , Kayvan Sadeghi , Taylor Short , Laszlo A Szekely

We show that the problem of counting the number of $n$-variable unate functions reduces to the problem of counting the number of $n$-variable monotone functions. Using recently obtained results on $n$-variable monotone functions, we obtain…

Combinatorics · Mathematics 2023-10-04 Aniruddha Biswas , Palash Sarkar

Let $n,n'$ be positive integers and let $V$ be an $(n+n')$-dimensional vector space over a finite field $\mathbb{F}$ equipped with a non-degenerate alternating, hermitian or quadratic form. We estimate the proportion of pairs $(U, U')$,…

Group Theory · Mathematics 2022-05-17 S. P. Glasby , Alice C. Niemeyer , Cheryl E. Praeger

A tree with $n$ vertices has at most $95^{n/13}$ minimal dominating sets. The growth constant $\lambda = \sqrt[13]{95} \approx 1.4194908$ is best possible. It is obtained in a semi-automatic way as a kind of "dominant eigenvalue" of a…

Discrete Mathematics · Computer Science 2019-03-13 Günter Rote

In this article, we revisit the century-old question of the minimal set of observables needed to identify a quantum state: here, we replace the natural coincidences in their spectra by effective ones, induced by an imperfect measurement. We…

Quantum Physics · Physics 2016-07-04 Mark Olchanyi , Eugene Moskovets

New uncertainty relations for n observables are established. The relations take the invariant form of inequalities between the characteristic coefficients of order r, r = 1,2,...,n, of the uncertainty matrix and the matrix of mean…

Quantum Physics · Physics 2008-11-26 D. A. Trifonov , S. G. Donev

We investigate the minimum cost of a wide class of combinatorial optimization problems over random bipartite geometric graphs in $\mathbb{R}^d$ where the edge cost between two points is given by a $p$-th power of their Euclidean distance.…

Probability · Mathematics 2023-07-20 Michael Goldman , Dario Trevisan

We show that the biggest possible average set size in the complement $2^{\{1,2,\ldots, n\}} \setminus A$ of a union-closed family $A \subset 2^{\{1,2, \ldots, n\}}$ is $\tfrac{n+1}{2}$. With the same proof we get a sharp upper bound for the…

Combinatorics · Mathematics 2020-05-04 Luca Studer

A weighted U-statistic based on a random sample X_1,...,X_n has the form U_n=\sum_{1\le i,j\le n}w_{i-j}K(X_i,X_j), where K is a fixed symmetric measurable function and the w_i are symmetric weights. A large class of statistics can be…

Probability · Mathematics 2007-05-23 Tailen Hsing , Wei Biao Wu