相关论文: Bounding and dominating number of families of func…

Bounding volumes are an established concept in computer graphics and vision tasks but have seen little change since their early inception. In this work, we study the use of neural networks as bounding volumes. Our key observation is that…

Given a union-closed family $\mathcal{F}$ of subsets of the universe $[n]$, with $\mathcal{F}$ not equal to the power set of $[n]$, a new subset $A$ can be added to it such that the resulting family remains union-closed. We construct a new…

We call a family of sets intersecting, if any two sets in the family intersect. In this paper we investigate intersecting families $\mathcal{F}$ of $k$-element subsets of $[n]:=\{1,\ldots, n\},$ such that every element of $[n]$ lies in the…

This work is devoted to the study of the relationships between graph theory and the qualitative analysis of ordinary differential equations, with a special focus on two-dimensional systems. In particular, we reinterpret classical results…

In this paper we study the integrals of fractional parts of given functions, and develop some new tools to understand the behaviour of prime differences. We demonstrate how simply some seemingly difficult conjectures related to prime…

The nonlinear concepts of mixed summable families and maps for the spaces that only non-void sets are developed. Several characterizations of the corresponding concepts are achieved and the proof for a general Pietsch Domination-type…

Let $G$ be a connected undirected graph on $n$ vertices with no loops but possibly multiedges. Given an arithmetical structure $(\textbf{r}, \textbf{d})$ on $G$, we describe a construction which associates to it a graph $G'$ on $n-1$…

We introduce order conserving embeddings as a more general form of order preserving embeddings between finite dimensional nest algebras. The structure of these embeddings is determined, in terms of order indecomposable decompositions, and…

Fix $A$, a family of subsets of natural numbers, and let $G_A(n)$ be the maximum cardinality of a subset of $\{1,2,..., n\}$ that does not have any subset in $A$. We consider the general problem of giving upper bounds on $G_A(n)$ and give…

Fix a natural $\alpha$. Let $n\ge \alpha$ be an integer. Consider the symmetric group $S_{\alpha+n}$ and its subgroup $S_n$. We consider the group algebra of $S_{\alpha+n}$ and its subalgebra $\mathbb{O}[\alpha;n]$ consisting of…

In this paper we give an alternative exposition of a recent paper regarding the classification of growth rates of real functions. We take a different point of view, focussing on understanding possible growth rates between polynomial and…

We consider the problem of counting the number of possible sets of rankings (called ranking patterns) generated by unfolding models of codimension one. We express the ranking patterns as slices of the braid arrangement and show that all…

We characterize a family of number triangles whose production matrices are closely related to the original number triangle. We study a number of such triangles that are of combinatorial significance. For a specific subfamily, these…

A wide variety of problems in combinatorics and discrete optimization depend on counting the set $S$ of integer points in a polytope, or in some more general object constructed via discrete geometry and first-order logic. We take a tour…

For a transcendental entire function, a partial affirmative answer to Baker's question on the boundedness of its Fatou components is given. In addition, we have addressed Wang's question on Fej\'er gaps. Certain results about functions with…

In this paper, we give some counting results on integer polynomials of fixed degree and bounded height whose distinct non-zero roots are multiplicatively dependent. These include sharp lower bounds, upper bounds and asymptotic formulas for…

We study the arity gap of functions of several variables defined on an arbitrary set A and valued in another set B. The arity gap of such a function is the minimum decrease in the number of essential variables when variables are identified.…

We study bipartite maps on the plane with one infinite face and one face of perimeter 2. At first we consider the problem of their enumeration an then study the connection between the combinatorial structure of a map and the degree of its…

We study the properties of different type of transforms by means of operational methods and discuss the relevant interplay with many families of special functions. We consider in particular the binomial transform and its generalizations. A…

We study the distribution of arithmetic invariants associated to Alexander polynomials for certain infinite families of links. The families of links we consider arise from braids on a fixed number of strings. We explore analogies with…