222 hasil
Menampilkan 1–20 · 0,16 detik · RSS
Discrete Analysis (2026)
Scopus
ISSN 2397-3129 · Alliance of Diamond Open Access Journals · 222 artikel di indeks
-
Artikel Jurnal
Possible Sizes of Sumsets
Let $A$ be a set of $n$ integers. If we write the elements of $A$ in increasing order as $a_1,a_2,\dots,a_n$, then the sequence $a_1+a_1,a_1+a_2,\dots,a_1+a_n,a_2+a_n,\dots,a_n+a_n$ is strictly increasing, and therefore the sumset $A+A$ has size at least $2n-1$. It is an easy exercise to prove that…
-
Artikel Jurnal
Efficiently stable presentations from error-correcting codes
This paper brings together a wide variety of interesting concepts, in order to rederive a result that formed a key step in the proof of the famous result that MIP${\mathstrut}^*$=RE by Zhengfeng Ji, Anand Natarajan, Thomas Vidick, John Wright, and Henry Yuen. A description of that result can be…
-
Artikel Jurnal
Composite Ramsey theorems via trees
Composite Ramsey theorems via trees, Discrete Analysis 2026:4, 17 pp. A famous unsolved problem in Ramsey theory, asked by Neil Hindman, is the question of whether if the natural numbers are finitely coloured, one can find $x$ and $y$ such that $x, y, x+y$ and $xy$ all have the same colour. The…
-
Artikel Jurnal
Convex geometry and the Erdős-Ginzburg-Ziv problem
The Erdős-Ginzburg-Ziv theorem states that if $x_1,\dots,x_{2n-1}$ is a sequence of elements of the group $\mathbb Z/n\mathbb Z$, then there is a subsequence of length $n$ that sums to 0. Equivalently, given $2n-1$ (not necessarily distinct) integers, it is possible to choose $n$ of them such that…
-
Artikel Jurnal
Slice rank and analytic rank for trilinear forms
Slice rank and analytic rank for trilinear forms, Discrete Analysis 2025:25, 6 pp. For a number of years, notions of rank for tensors have been studied in areas such as additive combinatorics and theoretical computer science, owing to the discovery of several applications, many of them quite…
-
Artikel Jurnal
A polynomial Freiman-Ruzsa inverse theorem for function fields
A polynomial Freiman-Ruzsa inverse theorem for function fields, Discrete Analysis 2025:24, 11 pp. A recent result of Gowers, Green, Manners and Tao gave a proof of Freiman's theorem in $\mathbb F_q^n$ with a polynomial dependence, thereby establishing a conjecture of Marton, also known as the…
-
Artikel Jurnal
SDPs and Robust Satisfiability of Promise CSP
SDPs and Robust Satisfiability of Promise CSP, Discrete Analysis 2025:14, 80 pp. A _constraint satisfaction problem_, or CSP, is a problem where one has a set of variables $x_1,\dots,x_n$ that live in some set, together with a collection of constraints, and the task is to determine whether the…
-
Artikel Jurnal
Strong bounds for skew-corner-free sets
Strong bounds for skew-corner-free sets, Discrete Analysis 2025:20, 27 pp. Roth's theorem on arithmetic progressions, proved in 1953, is a central result that has driven many developments in additive combinatorics. It states that for every $\delta>0$ there exists a positive integer $N$ such that…
-
Artikel Jurnal
Bohr sets in sumsets I: Compact abelian groups
Bohr sets in sumsets I: Compact abelian groups, Discrete Analysis 2025:11, 37 pp. Since Bogolyubov’s 1939 result concerning Bohr structure inside sets of the form $A+A−A−A$, much has been written about how “smooth” sumsets are, where smoothness is generally measured in terms of additive structure…
-
Artikel Jurnal
Uniform finite presentation for groups of polynomial growth
Uniform finite presentation for groups of polynomial growth, Discrete Analysis 2025:1, 29 pp. Let $G$ be a finitely generated infinite group with generators $a_1,\dots,a_k$. The _ball of radius_ $r$ in $G$ is defined to be the set of all elements of $G$ that can be written as words of length at…
-
Artikel Jurnal
A note on the power sums of the number of Fibonacci partitions
A note on the power sums of the number of Fibonacci partitions, Discrete Analysis 2025:2, 13 pp. This article concerns the number of ways of writing a positive integer $n$ as a sum of strictly increasing Fibonacci numbers. Denote this number by $r_F(n)$. The function $r_F$ is sometimes called the…
-
Artikel Jurnal
Square packings and rectifiable doubling measures
Square packings and rectifiable doubling measures, Discrete Analysis 2025:3, 40 pp. A measure $\mu$ on a metric space is $m$-rectifiable if it assigns full measure to a countable collection of Lipschitz images of bounded subsets of $\mathbb{R}^m$. Measures that are 1-rectifiable are a major object…
-
Artikel Jurnal
Power saving for the Brown-Erdős-Sós problem
Power saving for the Brown-Erdős-Sós problem, Discrete Analysis 2025:5, 16 pp. It has long been known that there are important connections between extremal questions concerning hypergraphs and extremal questions in additive combinatorics. This realization dates back at least as far as the famous…
-
Artikel Jurnal
Exceptional set estimate in prime fields: dimension two implies higher dimensions
Exceptional set estimate in prime fields: dimension two implies higher dimensions, Discrete Analysis 2025:19, 55 pp. Let $\mathcal{L}$ be a family of lines in $\mathbb R^2$. We say that $\mathcal{L}$ is $t$-_dimensional_ if $t$ is the Hausdorff dimension of the set of pairs $(a,b)\in\mathbb R^2$…
-
Artikel Jurnal
Irreducibility and periodicity in $\mathbb Z^2$ symbolic systems
Irreducibility and periodicity in $\mathbb{Z}^{2}$ symbolic systems, Discrete Analysis 2025:17, 37 pp. One of the central aims of symbolic dynamics is to understand how local rules governing configurations lead to global dynamical behaviour. In the one-dimensional case, this picture is fairly well…
-
Artikel Jurnal
Counting integer points on affine surfaces with a side condition
Counting integer points on affine surfaces with a side condition, Discrete Analysis 2025:12, 25 pp. This paper is concerned with special instances of the general problem of bounding the number of solutions to Diophantine equations with the variables constrained to lie in a large box. In 1989…
-
Artikel Jurnal
Color avoidance for monotone paths
Color avoidance for monotone paths, Discrete Analysis 2025:23, 14 pp. The famous Erdős–Szekeres theorem states that every sequence $a_1,\dots,a_{rs+1}$ of $rs+1$ real (and without loss of generality distinct) numbers has an increasing subsequence of length $r+1$ or a decreasing subsequence of…
-
Artikel Jurnal
Functional tilings and the Coven-Meyerowitz tiling conditions
Functional tilings and the Coven-Meyerowitz tiling conditions, Discrete Analysis 2025:18, 20 pp. A finite set $A\subset\mathbb Z$ _tiles_ $\mathbb Z$ _by translations_ if $\mathbb Z$ can be covered by a union of disjoint translates of $A$. In other words, there is an infinite set $T\subset \mathbb…
-
Artikel Jurnal
Quasirandom and quasisimple groups
Quasirandom and quasisimple groups, Discrete Analysis 2025:21, 24 pp. A quasirandom family of groups is a sequence of finite groups $(G_n)$ such that the smallest dimension of a non-trivial irreducible representation of $G_n$ tends to infinity with $n$. The terminology "quasirandom group" was…
-
Artikel Jurnal
Unique continuation on planar graphs
Unique continuation on planar graphs, Discrete Analysis 2025:16, 12 pp. A fundamental result in harmonic analysis is Liouville's theorem for harmonic functions: that a bounded harmonic function on $\mathbb R^n$ is constant. It is of course closely related to Liouville's theorem from complex…