Related papers: On the minimal teaching sets of two-dimensional th…

A graph is chordal if it does not contain an induced cycle of length greater than three. We determine the minimum size of a chordal graph with given order and minimum degree. In doing so, we have discovered interesting properties of chordal…

The repetition threshold of a class of sequences is the smallest number $r$ such that a sequence from the class contains no repetition with exponent $> r$. We focus on the class $\mathcal{C}_d$ of $d$-ary sequences rich in palindromes. In…

Motivated by classical work of Alon and F\"uredi, we introduce and address the following problem: determine the minimum number of affine hyperplanes in $\mathbb{R}^d$ needed to cover every point of the triangular grid $T_d(n) :=…

This paper discusses the frequency function of multiple-valued Dirichlet minimizing functions in the special case when the domain and range are both two dimensional. It shows that the frequency function must be of value k/2 for some…

The study of substructures in random objects has a long history, beginning with Erd\H{o}s and R\'enyi's work on subgraphs of random graphs. We study the existence of certain substructures in random subsets of vector spaces over finite…

A class is studied of complex valued functions defined on the unit disk (with a possible exception of a discrete set) with the property that all their Pick matrices have not more than a prescribed number of negative eigenvalues. Functions…

We study point-separating function sets that are minimal with respect to the property of being separating. We first show that for a compact space $X$ having a minimal separating function set in $C_p(X)$ is equivalent to having a minimal…

The limit of families of two-dimensional conformal field theories has recently attracted attention in the context of AdS/CFT dualities. In our work we analyse the limit of N=(2,2) superconformal minimal models when the central charge…

Given positive integers $m_1, m_2, ..., m_n$, and $n$ general points $p_i$ of ${\bf CP}^2$, bounds are given for the least degree $t$ among plane curves passing through each point $p_i$ with multiplicity at least $m_i$, and for the least…

For a positive integer $d$, a $d$-transversal set of a graph $G$ is an edge subset $T\subseteq E(G)$ such that $|T\cap M|\geq d$ for every maximum matching $M$ of $G$. The $d$-transversal number of $G$, denoted by $\tau_d(G)$, is the…

In this short note, we give a lower bound on the number of congruence classes of triangles in a small set of points in $\mathbb{F}_p^2$. More precisely, for $\mathcal{A}\subset \mathbb{F}_p^2$ with $|\mathcal{A}|\le p^{2/3}$, we prove that…

We show that if a divisor centered over a point on a smooth surface computes a minimal log discrepancy, then the divisor also computes a log canonical threshold. To prove the result, we study the asymptotic log canonical threshold of the…

A point set $M$ in Euclidean plane is called an integral point set in semi-general position if all the distances between the elements of $M$ are integers, and $M$ does not contain collinear triples. We improve the lower bound for diameter…

Fixed points of scalar field theories with quartic interactions in $d=4-\varepsilon$ dimensions are considered in full generality. For such theories it is known that there exists a scalar function $A$ of the couplings through which the…

In 1998, Khodkar showed that the minimal critical set in the Latin square corresponding to the elementary abelian 2-group of order 16 is of size at most 124. Since the paper was published, improved methods for solving integer programming…

Polynomial threshold gates are basic processing units of an artificial neural network. When the input vectors are binary vectors, these gates correspond to Boolean functions and can be analyzed via their polynomial representations. In…

In this short paper, we consider the functional density on sets of uniformly bounded triangulations with fixed sets of vertices. We prove that if a functional attains its minimum on the Delaunay triangulation, for every finite set in the…

Rigid frameworks in some Euclidian space are embedded graphs having a unique local realization (up to Euclidian motions) for the given edge lengths, although globally they may have several. We study the number of distinct planar embeddings…

We study the minimum distance of codes defined on bipartite graphs. Weight spectrum and the minimum distance of a random ensemble of such codes are computed. It is shown that if the vertex codes have minimum distance $\ge 3$, the overall…

We show that the graph of a bent function is a Salem set in an appropriate sense. We also establish a simple result that quantifies redundancies in the difference operators of a function, which applies to bent functions over fields of odd…