Search results for "Data type"
showing 10 items of 1183 documents
X-ray Tomography of One-forms with Partial Data
2021
If the integrals of a one-form over all lines meeting a small open set vanish and the form is closed in this set, then the one-form is exact in the whole Euclidean space. We obtain a unique continuation result for the normal operator of the X-ray transform of one-forms, and this leads to one of our two proofs of the partial data result. Our proofs apply to compactly supported covector-valued distributions.
Counting and equidistribution in quaternionic Heisenberg groups
2020
AbstractWe develop the relationship between quaternionic hyperbolic geometry and arithmetic counting or equidistribution applications, that arises from the action of arithmetic groups on quaternionic hyperbolic spaces, especially in dimension 2. We prove a Mertens counting formula for the rational points over a definite quaternion algebra A over ${\mathbb{Q}}$ in the light cone of quaternionic Hermitian forms, as well as a Neville equidistribution theorem of the set of rational points over A in quaternionic Heisenberg groups.
Exhaustive generation for permutations avoiding (colored) regular sets of patterns
2019
Abstract Despite the fact that the field of pattern avoiding permutations has been skyrocketing over the last two decades, there are very few exhaustive generating algorithms for such classes of permutations. In this paper we introduce the notions of regular and colored regular set of forbidden patterns, which are particular cases of right-justified sets of forbidden patterns. We show the (colored) regularity of several sets of forbidden patterns (some of them involving variable length patterns) and we derive a general framework for the efficient generation of permutations avoiding them. The obtained generating algorithms are based on succession functions, a notion which is a byproduct of t…
Combinatorial Gray codes for classes of pattern avoiding permutations
2007
The past decade has seen a flurry of research into pattern avoiding permutations but little of it is concerned with their exhaustive generation. Many applications call for exhaustive generation of permutations subject to various constraints or imposing a particular generating order. In this paper we present generating algorithms and combinatorial Gray codes for several families of pattern avoiding permutations. Among the families under consideration are those counted by Catalan, Schr\"oder, Pell, even index Fibonacci numbers and the central binomial coefficients. Consequently, this provides Gray codes for $\s_n(\tau)$ for all $\tau\in \s_3$ and the obtained Gray codes have distances 4 and 5.
Catalan and Schröder permutations sortable by two restricted stacks
2020
Abstract Pattern avoiding machines were introduced recently by Claesson, Cerbai and Ferrari as a particular case of the two-stacks in series sorting device. They consist of two restricted stacks in series, ruled by a right-greedy procedure and the stacks avoid some specified patterns. Some of the obtained results have been further generalized to Cayley permutations by Cerbai, specialized to particular patterns by Defant and Zheng, or considered in the context of functions over the symmetric group by Berlow. In this work we study pattern avoiding machines where the first stack avoids a pair of patterns of length 3 and investigate those pairs for which sortable permutations are counted by the…
On the size of the set of unbounded multilinear operators between Banach spaces
2020
Among other results we investigate $\left( \alpha,\beta\right) $-lineability of the set of non-continuous $m$-linear operators defined between normed spaces as a subset of the space of all $m$-linear operators. We also give a partial answer to an open problem on the lineability of the set of non absolutely summing operators.
M-bornologies on L-valued Sets
2017
We develop an approach to the concept of bornology in the framework of many-valued mathematical structures. It is based on the introduced concept of an M-bornology on an L-valued set (X, E), or an LM-bornology for short; here L is an iccl-monoid, M is a completely distributive lattice and \(E: X\times X \rightarrow L\) is an L-valued equality on the set X. We develop the basics of the theory of LM-bornological spaces and initiate the study of the category of LM-bornological spaces and appropriately defined bounded “mappings” of such spaces.
A matheuristic for the Team Orienteering Arc Routing Problem
2015
In the Team OrienteeringArc Routing Problem (TOARP) the potential customers are located on the arcs of a directed graph and are to be chosen on the basis of an associated profit. A limited fleet of vehicles is available to serve the chosen customers. Each vehicle has to satisfy a maximum route duration constraint. The goal is to maximize the profit of the served customers. We propose a matheuristic for the TOARP and test it on a set of benchmark instances for which the optimal solution or an upper bound is known. The matheuristic finds the optimal solutions on all, except one, instances of one of the four classes of tested instances (with up to 27 vertices and 296 arcs). The average error o…
Systematic procedure for the preparation of sets of calibration standards for x-ray fluorescence analysis of ceramic materials
1998
A systematic procedure for the preparation of optimized sets of calibration solid standards for the x-ray fluorescence analysis of ceramic materials is described. The matrix of the contents of the N analytes in the n standards (n ≥ N) is calculated from an n x N experimental design matrix, and from the upper and lower limits of the calibration range for each of the N analytes. Two procedures, which are useful for taking into account analyte interactions, are proposed for constructing the experimental design matrix, i.e. the scroll procedure and the procedure of the centers. A program developed to help the analyst in designing and preparing the set of standards following the proposed procedu…
A three-factor optimisation strategy for micellar liquid chromatography
2000
An interpretive optimisation methodology for micellar liquid chromatography (MLC) is shown, taking into account pH, surfactant (sodium dodecyl sulphate) and organic modifier (propanol) concentration. Two objectives are considered: to develop a highly practical straightforward three-factor optimisation for practical MLC, and, in order to avoid unecessary experiments, to link two and three-factor optimisations through a step-wise construction of the experimental design at different pH levels. The whole pH range for an ODS column (from 3 to 7) is covered. The proposed strategy was thoroughly evaluated using the chromatographic data from 81 experimental mobile phases, applied to the separation …