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

We introduce and study the minimum distance function of a graded ideal in a polynomial ring with coefficients in a field, and show that it generalizes the minimum distance of projective Reed-Muller-type codes over finite fields. This gives…

It is known that a positive Boolean function f depending on n variables has at least n + 1 extremal points, i.e. minimal ones and maximal zeros. We show that f has exactly n + 1 extremal points if and only if it is linear read-once. The…

We prove that a minimal $t$-fold blocking set in a finite projective plane of order $n$ has cardinality at most \[\frac{1}{2} n\sqrt{4tn - (3t + 1)(t - 1)} + \frac{1}{2} (t - 1)n + t.\] This is the first general upper bound on the size of…

We show that directed minimal cones in (n+1)-dimensional Euclidean space which have at most one singularity are - besides the trivial cases: empty set, whole space - half spaces. Using blow-up techniques, this result can be used to get…

The characterization of local regularity is a fundamental issue in signal and image processing, since it contains relevant information about the underlying systems. The 2-microlocal frontier, a monotone concave downward curve in $\mathbb…

In this article we prove the topological minimality of unions of several almost orthogonal planes of arbitrary dimensions. A particular case was proved in arXiv:1103.1468, where we proved the Almgren minimality (which is a weaker property…

In this short note it is shown that every graph of diameter 2 and minimum degree at least 3 contains a cycle of length 4 or 8. This result contributes to the study of the Erd\H{o}s-Gy\'arf\'as Conjecture by confirming it for the class of…

We study densities of functionals over uniformly bounded triangulations of a Delaunay set of vertices, and prove that the minimum is attained for the Delaunay triangulation if this is the case for finite sets.

We look at the average sum of the Euler's phi function $\phi{(n)}$ and it's relation with the visibility of a point from the origin.We show that $\forall{\hspace{0.05in}{k} \ge{1}},k\in\mathbb{N},\exists$ a $k$$\times$$k$ grid in the 2D…

In this paper, we shall establish a rather general asymptotic formula in short intervals for a classe of arithmetic functions and announce two applications about the distribution of divisors of square-full numbers and integers representable…

In a previous article the authors determined the best-known upper bound for the cardinality of the image set for several classes of functions, including planar functions. Here, we show that the upper bound cannot be tight for planar…

We present a procedure for computing the log-canonical threshold of an arbitrary ideal generated by binomials and monomials. The computation of the log canonical threshold is reduced to the problem of computing the minimum of a function,…

We construct Lipschitz $Q$-valued functions which approximate carefully integral currents when their cylindrical excess is small and they are almost minimizing in a suitable sense. This result is used in two subsequent works to prove the…

In threshold-linear networks (TLNs), a fixed point is called minimal if no proper subset of its support is also a fixed point. Curto et al (Advances in Applied Mathematics, 2024) conjectured that every stable fixed point of any TLN must be…

Several machine learning models are defined for inputs of any size, such as graphs with different numbers of nodes and point clouds containing varying numbers of points. The universality properties of such any-dimensional models remain…

The radius of convexity of two normalized Bessel functions of the first kind are determined in the case when the order is between $-2$ and $-1.$ Our methods include the minimum principle for harmonic functions, the Hadamard factorization of…

A configuration of 7 points in RP2 is called typical if it has no collinear triples and no coconic sextuples of points. We show that there exist 14 deformation classes of such configurations. This yields classification of real Aronhold…

For a class of functions (called minimal Rad\'o functions) that arise naturally in minimal surface theory, we bound the number of interior critical points (counting multiplicity) in terms of the boundary data and the Euler characteristic of…

A simple way to generate a Boolean function is to take the sign of a real polynomial in $n$ variables. Such Boolean functions are called polynomial threshold functions. How many low-degree polynomial threshold functions are there? The…

The scramble number of a graph provides a lower bound for gonality and an upper bound for treewidth, making it a graph invariant of interest. In this paper we study graphs of scramble number at most two, and give a classification of all…