Cover Image

A note on the distinct distances problem over finite fields

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Brukhim, Nataly, Bruner, Ariel, Raz, Orit E.
Format:	Preprint
Published:	2025
Subjects:	Combinatorics Discrete Mathematics
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

A note on distance-hereditary graphs whose complement is also distance-hereditary
by: Jacob, Hugo
Published: (2025)

A note on the Alon-Saks-Seymour problem
by: Fox, Jacob
Published: (2026)

Some permutation pentanomials over finite fields of even characteristic
by: Kousar, Farhana, et al.
Published: (2024)

Critical exponent of binary words with few distinct palindromes
by: Dvořáková, L'ubomíra, et al.
Published: (2023)

On multiplicities of interpoint distances
by: Clemen, Felix Christian, et al.
Published: (2025)

Algorithmic methods of finite discrete structures. Hamiltonian cycle of a complete graph and the Traveling salesman problem
by: Kurapov, Sergey, et al.
Published: (2024)

A note on hypergraphs with asymmetric Ramsey properties
by: Sviridenkov, Vladimir
Published: (2026)

Isomorphisms of unit distance graphs of layers
by: Bikeev, Arthur Igorevich
Published: (2025)

A note on embracing exchange sequences in oriented matroids
by: Bérczi, Kristóf, et al.
Published: (2025)

A note on the exact partition polytope of Frieze and Teng
by: Narayanan, Krishna, et al.
Published: (2026)

Elimination distance to bounded degree on planar graphs
by: Lindermayr, Alexander, et al.
Published: (2020)

Upper bounds on the average edit distance between two random strings
by: Rosenfeld, Matthieu
Published: (2024)

Some short notes on oriented line graphs and related matrices
by: Antony, Jacob, et al.
Published: (2025)

2-distance 4-coloring of planar subcubic graphs with girth at least 21
by: La, Hoang, et al.
Published: (2021)

Boundary rigidity of finite CAT(0) cube complexes
by: Chalopin, Jérémie, et al.
Published: (2023)

The Hajnal--Rothschild problem
by: Frankl, Peter, et al.
Published: (2025)

Algorithmic methods of finite discrete structures. Graph clique problem
by: Kurapov, Sergey, et al.
Published: (2024)

Algorithmic methods of finite discrete structures. Isomorphism of Nonseparable Graphs
by: Kurapov, Sergey, et al.
Published: (2024)

Three aspects of the MSTCI problem
by: Dubinsky, Manuel, et al.
Published: (2023)

The red-blue-yellow matching problem
by: Aprile, Manuel, et al.
Published: (2026)

Algorithmic methods of finite discrete structures. Topological graph drawing (part IV)
by: Kurapov, Sergey, et al.
Published: (2025)

Algorithmic methods of finite discrete structures. Topological graph drawing (part I)
by: Kurapov, Sergey, et al.
Published: (2024)

Algorithmic methods of finite discrete structures. Topological graph drawing (part II)
by: Kurapov, Sergey, et al.
Published: (2024)

The classification of Boolean degree $1$ functions in high-dimensional finite vector spaces
by: Ihringer, Ferdinand
Published: (2023)

A complete solution of the Erdős-Kleitman matching problem for $n\le 3s$
by: Kupavskii, Andrey, et al.
Published: (2025)

A bound for the cops and robber problem in terms of 2-component order connectivity
by: Jain, Suryaansh, et al.
Published: (2024)

On rigid regular graphs and a problem of Babai and Pultr
by: Knauer, Kolja, et al.
Published: (2025)

On three domination-based identification problems in block graphs
by: Chakraborty, Dipayan, et al.
Published: (2018)

On the finiteness of $k$-vertex-critical $2P_2$-free graphs with forbidden induced squids or bulls
by: Adekanye, Melvin, et al.
Published: (2024)

Note about the complexity of the acyclic orientation with parity constraint problem
by: Gravier, Sylvain, et al.
Published: (2025)

Filling some gaps on the edge coloring problem of split graphs
by: Couto, Fernanda, et al.
Published: (2024)

Some polynomial classes for the acyclic orientation with parity constraint problem
by: Gravier, Sylvain, et al.
Published: (2026)

New small regular graphs of given girth: the cage problem and beyond
by: Exoo, Geoffrey, et al.
Published: (2025)

More on the Erd\H os--Kleitman problem on matchings in set families
by: Kupavskii, Andrey, et al.
Published: (2026)

The sandwich problem for odd-hole-free and even-hole-free graphs
by: Cameron, Kathie, et al.
Published: (2024)

Families of tractable problems with respect to vertex-interval-membership width and its generalisations
by: Enright, Jessica, et al.
Published: (2025)

Distance-based (and path-based) covering problems for graphs of given cyclomatic number
by: Chakraborty, Dibyayan, et al.
Published: (2025)

Partial vertex covers and the complexity of some problems concerning static and dynamic monopolies
by: Soltani, Hossein, et al.
Published: (2018)

Rainbow variations on a theme by Mantel: extremal problems for Gallai colouring templates
by: Falgas-Ravry, Victor, et al.
Published: (2022)

Odd-Cycle-Packing-treewidth: On the Maximum Independent Set problem in odd-minor-free graph classes
by: Choi, Mujin, et al.
Published: (2025)