English
Related papers

Related papers: Almost $k$-union closed set systems

200 papers

For a field $\mathbb{F}$ and integers $d$ and $k$, a set of vectors of $\mathbb{F}^d$ is called $k$-nearly orthogonal if its members are non-self-orthogonal and every $k+1$ of them include an orthogonal pair. We prove that for every prime…

Computational Geometry · Computer Science 2024-05-21 Dror Chawin , Ishay Haviv

Let $G$ be a connected unimodular group equipped with a (left and hence right) Haar measure $\mu_G$, and suppose $A, B \subseteq G$ are nonempty and compact. An inequality by Kemperman gives us…

Combinatorics · Mathematics 2021-06-18 Yifan Jing , Chieu-Minh Tran

The order and chain polytopes, introduced by Richard P. Stanley, form a pair of Ehrhart equivalent polytopes associated to a given finite poset. A conjecture by Takayuki Hibi and Nan Li states that the $f$-vector of the chain polytope…

Combinatorics · Mathematics 2026-04-14 Ibrahim Ahmad , Ghislain Fourier , Michael Joswig

A new result in convex analysis on the calculation of proximity operators in certain scaled norms is derived. We describe efficient implementations of the proximity calculation for a useful class of functions; the implementations exploit…

Optimization and Control · Mathematics 2013-03-04 Stephen Becker , M. Jalal Fadili

We introduce a kind of "perturbation" for the Li-Keiper coefficients around the Koebe function (the K function) and establish a closed system of Equations for the Li-Keiper coefficients. We then check the correctness of some of the many…

General Mathematics · Mathematics 2019-07-04 Danilo Merlini , Massimo Sala , Nicoletta Sala

The paper deals with a well-known extremum seeking scheme by proving uniformity properties with respect to the amplitudes of the dither signal and of the cost function. Those properties are then used to show that the scheme guarantees the…

Optimization and Control · Mathematics 2022-04-04 Nicola Mimmo , Lorenzo Marconi , Giuseppe Notarstefano

We provide a method of constructing better-quasi-orders by generalising a technique for constructing operator algebras that was developed by Pouzet. We then generalise the notion of $\sigma$-scattered to partial orders, and use our method…

Logic · Mathematics 2014-10-02 Gregory McKay

We lift the Euler characteristic of a nearly perfect complex to a relative algebraic K-group by passing to its l-adic Euler characteristics.

K-Theory and Homology · Mathematics 2007-05-23 David Burns , Bernhard Köck , Victor Snaith

Given a group $G$, we write $g^G$ for the conjugacy class of $G$ containing the element $g$. A theorem of B. H. Neumann states that if $G$ is a group in which all conjugacy classes are finite with bounded size, then the commutator subgroup…

Group Theory · Mathematics 2021-02-24 Pavel Shumyatsky

We review the theory of almost coherent modules that was introduced in "Almost Ring Theory" by Gabber and Ramero. Then we globalize it by developing a new theory of almost coherent sheaves on schemes and on a class of "nice" formal schemes.…

Algebraic Geometry · Mathematics 2026-03-17 Bogdan Zavyalov

By a [$K$-]approximate subring of a ring we mean an additively symmetric subset $X$ such that $X \cdot X \cup (X + X)$ is covered by finitely many [resp.\ $K$] additive translates of $X$. We prove a structure theorem for finite approximate…

Rings and Algebras · Mathematics 2026-04-07 Krzysztof Krupiński , Simon Machado

Motivated by Berg's notion of quasi-disjointness for ergodic systems, we introduce and investigate the concept of quasi-disjointness for minimal systems. Several equivalent characterizations are provided. We prove that quasi-disjointness is…

Dynamical Systems · Mathematics 2026-05-29 Hui Xu , Xiangdong Ye

Hilbert famously showed that polynomials in n variables are not too complicated, in various senses. For example, the Hilbert Syzygy Theorem shows that the process of resolving a module by free modules terminates in finitely many (in fact,…

Commutative Algebra · Mathematics 2019-05-14 Daniel Erman , Steven V Sam , Andrew Snowden

Given an implicational base, a well-known representation for a closure system, an inconsistency binary relation over a finite set, we are interested in the problem of enumerating all maximal consistent closed sets (denoted by MCCEnum for…

Computational Complexity · Computer Science 2021-02-10 Lhouari Nourine , Simon Vilmin

In this paper, we propose a stochastic forward-backward-forward splitting algorithm and prove its almost sure weak convergence in real separable Hilbert spaces. Applications to composite monotone inclusion and minimization problems are…

Optimization and Control · Mathematics 2015-05-20 Bang Cong Vũ

A conjecture of Thomassen from 1982 states that for every k there is an f(k) so that every strongly f(k)-connected tournament contains k edge-disjoint Hamilton cycles. A classical theorem of Camion, that every strongly connected tournament…

Combinatorics · Mathematics 2017-05-17 Daniela Kühn , John Lapinskas , Deryk Osthus , Viresh Patel

The objective of the paper is to establish a computable upper bound for the almost sure convergence rate for a class of ratio consensus algorithms defined via column-stochastic matrices. Our result extends the works of Iutzeler et al.…

Optimization and Control · Mathematics 2022-04-06 Balázs Gerencsér

Let K >= 1 be a parameter. A K-approximate group is a finite set A in a (local) group which contains the identity, is symmetric, and such that A^2 is covered by K left translates of A. The main result of this paper is a qualitative…

Group Theory · Mathematics 2011-10-26 Emmanuel Breuillard , Ben Green , Terence Tao

A basis of quasi-invariant module over invariants is explicitly constructed for the two-dimensional Coxeter systems with arbitrary multiplicities. It is proved that this basis consists of $m$-harmonic polynomials, thus the earlier results…

Mathematical Physics · Physics 2007-05-23 M. Feigin

We obtain the first polynomial-time algorithm for exact tensor completion that improves over the bound implied by reduction to matrix completion. The algorithm recovers an unknown 3-tensor with $r$ incoherent, orthogonal components in…

Machine Learning · Computer Science 2017-06-27 Aaron Potechin , David Steurer