English
Related papers

Related papers: The interplay between additive and symmetric large…

200 papers

We study several variants of decomposing a symmetric matrix into a sum of a low-rank positive semidefinite matrix and a diagonal matrix. Such decompositions have applications in factor analysis and they have been studied for many decades.…

Optimization and Control · Mathematics 2023-10-02 Levent Tunçel , Stephen A. Vavasis , Jingye Xu

Close connections between various notions of entropy and the apparatus of category theory have been observed already in the 1980s and more vigorously developed in the past ten years. The starting point of the paper is the recent categorical…

Combinatorics · Mathematics 2022-04-25 Dragan Mašulović

In this paper, we study partitions of positive integers into distinct quasifibonacci numbers. A digraph and poset structure is constructed on the set of such partitions. Furthermore, we discuss the symmetric and recursive relations between…

Combinatorics · Mathematics 2008-02-12 Hansheng Diao

We state the Ramsey property of classes of ordered structures with closures and given local properties. This generalises many old and new results: the Ne\v{s}et\v{r}il-R\"{o}dl Theorem, the author's Ramsey lift of bowtie-free graphs as well…

Combinatorics · Mathematics 2017-06-07 Jan Hubička , Jaroslav Nešetřil

Many aspects of the asymptotics of Plancherel distributed partitions have been studied in the past fifty years, in particular the limit shape, the distribution of the longest rows, connections with random matrix theory and characters of the…

Combinatorics · Mathematics 2017-01-20 Dario De Stavola

Size-Ramsey numbers are a central notion in combinatorics and have been widely studied since their introduction by Erd\H{o}s, Faudree, Rousseau and Schelp in 1978. Research has mainly focused on the size-Ramsey numbers of $n$-vertex graphs…

Combinatorics · Mathematics 2023-09-06 Nemanja Draganić , Marc Kaufmann , David Munhá Correia , Kalina Petrova , Raphael Steiner

Orbit-finite models of computation generalise the standard models of computation, to allow computation over infinite objects that are finite up to symmetries on atoms, denoted by $\mathbb{A}$. Set theory with atoms is used to reason about…

Logic · Mathematics 2025-12-03 Jake Masters

Representation theory of finite groups portrays a marvelous crossroad of group theory, algebraic combinatorics, and probability. In particular the Plancherel measure is a probability that arises naturally from representation theory, and in…

Combinatorics · Mathematics 2018-05-11 Dario De Stavola

We study quantum dichotomies and the resource theory of asymmetric distinguishability using a generalization of Strassen's theorem on preordered semirings. We find that an asymptotic variant of relative submajorization, defined on…

Quantum Physics · Physics 2020-04-23 Christopher Perry , Péter Vrana , Albert H. Werner

Symmetry is one of the most central concepts in physics, and it is no surprise that it has also been widely adopted as an inductive bias for machine-learning models applied to the physical sciences. This is especially true for models…

Chemical Physics · Physics 2024-12-23 Marcel F. Langer , Sergey N. Pozdnyakov , Michele Ceriotti

We study the Ramsey properties of equations $a_1P(x_1) + \cdots + a_sP(x_s) = b$, where $a_1,\ldots,a_s,b$ are integers, and $P$ is an integer polynomial of degree $d$. Provided there are at least $(1+o(1))d^2$ variables, we show that…

Number Theory · Mathematics 2022-10-11 Jonathan Chapman , Sam Chow

Given $X\subseteq \mathbb{Z}_N$, $X$ is called a \emph{cyclic basis} if $(X+X)\cup X=\mathbb{Z}_N$, \emph{symmetric} if $x\in X$ implies $-x \in X$, and \emph{sum-free} if $(X+X)\cap X=\varnothing$. We ask, for which $m$, $N\in\mathbb{Z}^+$…

Combinatorics · Mathematics 2014-12-25 Jeremy F. Alm , Jacob Manske

In [9], [15] it has been introduced a technique, based on nonstandard analysis, to study some problems in combinatorial number theory. In this paper we present three applications of this technique: the first one is a new proof of a known…

Logic · Mathematics 2014-01-22 Lorenzo Luperi Baglini

In this article, we define and study a geometry and an order on the set of partitions of an even number of objects. One of the definitions involves the partition algebra, a structure of algebra on the set of such partitions depending on an…

Combinatorics · Mathematics 2016-11-01 Franck Gabriel

We show that several sets of interest arising from the study of partition regularity and density Ramsey theory of polynomial equations over integral domains are undecidable. In particular, we show that the set of homogeneous polynomials $p…

Logic · Mathematics 2025-05-13 Sohail Farhangi , Steve Jackson , Bill Mance

We introduce a remarkable new family of norms on the space of $n \times n$ complex matrices. These norms arise from the combinatorial properties of symmetric functions, and their construction and validation involve probability theory,…

Combinatorics · Mathematics 2022-03-23 Konrad Aguilar , Ángel Chávez , Stephan Ramon Garcia , Jurij Volčič

We study combinatorial configurations with the associated point and line graphs being strongly regular. Examples not belonging to known classes such as partial geometries and their generalizations or elliptic semiplanes are constructed.…

Combinatorics · Mathematics 2025-09-30 Marién Abreu , Martin Funk , Vedran Krčadinac , Domenico Labbate

A class of associative (super) algebras is presented, which naturally generalize both the symmetric algebra $Sym(V)$ and the wedge algebra $\wedge (V)$, where $V$ is a vector-space. These algebras are in a bijection with those subsets of…

Combinatorics · Mathematics 2007-05-23 A. Regev

We prove a structure theorem for multiplicative functions on the Gaussian integers, showing that every bounded multiplicative function on the Gaussian integers can be decomposed into a term which is approximately periodic and another which…

Number Theory · Mathematics 2014-12-04 Wenbo Sun

We prove a Ramsey theorem for finite sets equipped with a partial order and a fixed number of linear orders extending the partial order. This is a common generalization of two recent Ramsey theorems due to Soki\'c. As a bonus, our proof…

Combinatorics · Mathematics 2015-02-17 Slawomir Solecki , Min Zhao