Related papers: Germ order for one-dimensional packings
This paper studies three natural pre-orders of increasing generality on the set of all completely non-unitary partial isometries with equal defect indices. We show that the problem of determining when one partial isometry is less than…
Group testing is a useful method that has broad applications in medicine, engineering, and even in airport security control. Consider a finite population of $N$ items, where item $i$ has a probability $p_i$ to be defective. The goal is to…
For an algebraic number $\alpha$ we consider the orders of the reductions of $\alpha$ in finite fields. In the case where $\alpha$ is an integer, it is known by the work on Artin's primitive root conjecture that the order is "almost always…
The Brasselet number of a function $f$ with nonisolated singularities describes numerically the topological information of its generalized Milnor fibre. In this work, using the Brasselet number, we present several formulas for germs $f:(X,…
This paper deals with the maximum value of the difference between the determining number and the metric dimension of a graph as a function of its order. Our technique requires to use locating-dominating sets, and perform an independent…
The lattice of partitions of a set and its d-divisible generalization have been much studied for their combinatorial, topological, and representation-theoretic properties. An ordered set partition is a set partition where the subsets are…
We give necessary and sufficient conditions of infinite determinacy for smooth function germs whose critical locus contains a given set. This set is assumed to be the zero variety X of some analytic map germ having maximal rank on a dense…
It is well known that the Bell numbers represent the total number of partitions of an n-set. Similarly, the Stirling numbers of the second kind, represent the number of k-partitions of an n-set. In this paper we introduce a certain…
It is well known that the mathematically accurate description of ordering and related symmetry breaking in statistical systems requires to consider the thermodynamic limit. But the order does not appear from nowhere, and yet before the…
We arrange the orders in an algebraic number field in a tree. This tree can be used to enumerate all orders of bounded index in the maximal order as well as the orders over some given order.
Given an ordered structure, we study a natural way to extend the order to preorders on type spaces. For definably complete, linearly ordered structures, we give a characterisation of the preorder on the space of 1-types. We apply these…
A symmetric subset of the reals is one that remains invariant under some reflection z --> c-z. We consider, for any 0 < x <= 1, the largest real number D(x) such that every subset of $[0,1]$ with measure greater than x contains a symmetric…
In this paper we consider the enumeration of ordered set partitions avoiding a permutation pattern of length 2 or 3. We provide an exact enumeration for avoiding the permutation 12. We also give exact enumeration for ordered partitions with…
We introduce stacks classifying \'etale germs of pointed n-dimensional varieties. We show that quasi-coherent sheaves on these stacks are universal D- and O-modules. We state and prove a relative version of Artin's approximation theorem,…
We study the problem of generating, ranking and unranking of unlabeled ordered trees whose nodes have maximum degree of $\Delta$. This class of trees represents a generalization of chemical trees. A chemical tree is an unlabeled tree in…
In this paper we study the enumeration and the construction, according to the number of ones, of particular binary words avoiding a fixed pattern. The growth of such words can be described by particular jumping and marked succession rules.…
The Bin Packing Problem involves efficiently packing items into a limited number of bins without exceeding their capacity. In this paper, we try to answer a specific question in this field. Mathematically the combinatorial optimization…
Predicting the densest random disc packing fraction is an unsolved paradigm problem relevant to a number of disciplines and technologies. One difficulty is that it is ill-defined without setting a criterion for the disorder. Another is that…
Let $G$ be a graph. A dominating set $D\subseteq V(G)$ is a super dominating set if for every vertex $x\in V(G) \setminus D$ there exists $y\in D$ such that $N_G(y)\cap (V(G)\setminus D)) = \{x\}$. The cardinality of a smallest super…
The notion of (3+1)-avoidance has shown up in many places in enumerative combinatorics. The natural goal of enumeration of all (3+1)-avoiding posets remains open. In this paper, we enumerate graded (3+1)-avoiding posets for both reasonable…