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

In this note we prove that the factorization theorem for dominated polynomials previously proved by the authors is equivalent to an alternative factorization scheme that uses classical linear techniques and a linearization process. However,…

A set $A$ is said to split a finite set $B$ if exactly half the elements of $B$ (up to rounding) are contained in $A$. We study the dual notions: (1) splitting family, which is a collection of sets such that any subset of $\{1,\ldots,k\}$…

We first show that increasing trees are in bijection with set compositions, extending simultaneously a recent result on trees due to Tonks and a classical result on increasing binary trees. We then consider algebraic structures on the…

We study branched covers of curves with specified ramification points, under a notion of equivalence derived from linear series. In characteristic 0, no non-constant families of covers with fixed ramification points exist. In positive…

We study the eternal dominating number and the m-eternal dominating number on digraphs. We generalize known results on graphs to digraphs. We also consider the problem "oriented (m-)eternal domination", consisting in finding an orientation…

The classical derangement numbers count fixed point-free permutations. In this paper we study the enumeration problem of generalized derangements, when some of the elements are restricted to be in distinct cycles in the cycle decomposition.…

We present a refinement of Ramsey numbers by considering graphs with a partial ordering on their vertices. This is a natural extension of the ordered Ramsey numbers. We formalize situations in which we can use arbitrary families of…

We use numerical continuation and bifurcation techniques in a boundary value setting to follow Lyapunov families of periodic orbits. These arise from the polygonal system of $n$ bodies in a rotating frame of reference. When the frequency of…

The origin of this study is based on not only explicit formulas of finite sums involving higher powers of binomial coefficients, but also explicit evaluations of generating functions for this sums. It should be emphasized that this study…

A family of random matrices is said to converge strongly to a limiting family of operators if the operator norm of every noncommutative polynomial of the matrices converges to that of the limiting operators. Recent developments surrounding…

We investigate the special class of formulas made up of arbitrary but finite com- binations of addition, multiplication, and exponentiation gates. The inputs to these formulas are restricted to the integral unit 1. In connection with such…

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…

It is a well-known empirical phenomenon that natural axiomatic theories are pre-well-ordered by consistency strength. Without a precise mathematical definition of "natural," it is unclear how to study this phenomenon mathematically. We will…

Let $S$ be a family of sequences of positive numbers that decrease to 0, let $X$ be a metric space and $A \subset X$. $A$ is said to be $S$-dominated if, for every $s\in S$, a countable cover $\{E_n\}$ of $E$ can be found such that $diam…

A family $\mathcal{A}$ of sets is said to be \emph{$t$-intersecting} if any two sets in $\mathcal{A}$ have at least $t$ common elements. A central problem in extremal set theory is to determine the size or structure of a largest…

Polynomial functions have plenty of useful analytical properties, but they are rarely used as learning models because their function class is considered to be restricted. This work shows that when trained properly polynomial functions can…

We discuss how the presence of a suitable symmetry can guarantee the perturbative linearizability of a dynamical system - or a parameter dependent family - via the Poincar\'e Normal Form approach. We discuss this at first formally, and…

For a group G we consider the set of natural numbers n for which the nth cohomology functor of G commutes with filtered colimit systems of coefficient modules. We find that for the large class of hierarchically decomposable groups there is…

In this work we present a class of functions, motivated by gap functions, which we call G-coupling functions. We will show that these functions can generate a duality scheme for minimization problems by means of the general conjugation…

We introduce a new framework of counting problems called #GDS that encompasses #$(\sigma, \rho)$-Set, a class of domination-type problems that includes counting dominating sets and counting total dominating sets. We explore the intricate…