Search results for "combinatoric"
showing 10 items of 1776 documents
Higher order statistics of the response of linear systems excited by polynomials of filtered Poisson pulses
1999
The higher order statistics of the response of linear systems excited by polynomials of filtered Poisson pulses are evaluated by means of knowledge of the first order statistics and without any further integration. This is made possible by a coordinate transformation which replaces the original system by a quasi-linear one with parametric Poisson delta-correlated input; and, for these systems, a simple relationship between first order and higher order statistics is found in which the transition matrix of the dynamical new system, incremented by the correction terms necessary to apply the Ito calculus, appears.
The Integrated Nested Laplace Approximation for fitting Dirichlet regression models
2022
This paper introduces a Laplace approximation to Bayesian inference in Dirichlet regression models, which can be used to analyze a set of variables on a simplex exhibiting skewness and heteroscedasticity, without having to transform the data.These data, which mainly consist of proportions or percentages of disjoint categories, are widely known as compositional data and are common in areas such as ecology, geology, and psychology. We provide both the theoretical foundations and a description of how Laplace approximation can be implemented in the case of Dirichlet regression.The paper also introduces the package dirinla in the R-language that extends the RINLA package, which can not deal dire…
Novel 3D bio-macromolecular bilinear descriptors for protein science: Predicting protein structural classes
2015
In the present study, we introduce novel 3D protein descriptors based on the bilinear algebraic form in the ℝn space on the coulombic matrix. For the calculation of these descriptors, macromolecular vectors belonging to ℝn space, whose components represent certain amino acid side-chain properties, were used as weighting schemes. Generalization approaches for the calculation of inter-amino acidic residue spatial distances based on Minkowski metrics are proposed. The simple- and double-stochastic schemes were defined as approaches to normalize the coulombic matrix. The local-fragment indices for both amino acid-types and amino acid-groups are presented in order to permit characterizing fragme…
Posets That Locally Resemble Distributive Lattices
2000
Abstract Let P be a graded poset with 0 and 1 and rank at least 3. Assume that every rank 3 interval is a distributive lattice and that, for every interval of rank at least 4, the interval minus its endpoints is connected. It is shown that P is a distributive lattice, thus resolving an issue raised by Stanley. Similar theorems are proven for semimodular, modular, and complemented modular lattices. As a corollary, a theorem of Stanley for Boolean lattices is obtained, as well as a theorem of Grabiner (conjectured by Stanley) for products of chains. Applications to incidence geometry and connections with the theory of buildings are discussed.
Saturation and coherence effects in the modified KGBJS equation
2013
We solve the modified non-linear extension of the CCFM equati on KGBJS equation numerically for certain initial conditions and compare the resulting gl uon Green functions with those obtained from solving the original CCFM equation and the BFKL and BK equations for the same initial conditions. We improve the low transversal momentum behaviour of the KGBJS equation by a small modification.
CODING PARTITIONS OF REGULAR SETS
2009
A coding partition of a set of words partitions this set into classes such that whenever a sequence, of minimal length, has two distinct factorizations, the words of these factorizations belong to the same class. The canonical coding partition is the finest coding partition that partitions the set of words in at most one unambiguous class and other classes that localize the ambiguities in the factorizations of finite sequences. We prove that the canonical coding partition of a regular set contains a finite number of regular classes and we give an algorithm for computing this partition. From this we derive a canonical decomposition of a regular monoid into a free product of finitely many re…
The Many Faces of a Translation
2000
First-order translations have recently been characterized as the maps computed by aperiodic single-valued nondeterministic finite transducers (NFTs). It is shown here that this characterization lifts to "V-translations" and "V-single-valued-NFTs", where V is an arbitrary monoid pseudovariety. More strikingly, 2-way V-machines are introduced, and the following three models are shown exactly equivalent to Eilenberg's classical notion of a bimachine when V is a group variety or when V is the variety of aperiodic monoids: V-translations, V-single-valued-NFTs and 2-way V-transducers.
On base loci of higher fundamental forms of toric varieties
2019
We study the base locus of the higher fundamental forms of a projective toric variety $X$ at a general point. More precisely we consider the closure $X$ of the image of a map $({\mathbb C}^*)^k\to {\mathbb P}^n$, sending $t$ to the vector of Laurent monomials with exponents $p_0,\dots,p_n\in {\mathbb Z}^k$. We prove that the $m$-th fundamental form of such an $X$ at a general point has non empty base locus if and only if the points $p_i$ lie on a suitable degree-$m$ affine hypersurface. We then restrict to the case in which the points $p_i$ are all the lattice points of a lattice polytope and we give some applications of the above result. In particular we provide a classification for the se…
Tower sets and other configurations with the Cohen-Macaulay property
2014
Abstract Some well-known arithmetically Cohen–Macaulay configurations of linear varieties in P r as k-configurations, partial intersections and star configurations are generalized by introducing tower schemes. Tower schemes are reduced schemes that are a finite union of linear varieties whose support set is a suitable finite subset of Z + c called tower set. We prove that the tower schemes are arithmetically Cohen–Macaulay and we compute their Hilbert function in terms of their support. Afterwards, since even in codimension 2 not every arithmetically Cohen–Macaulay squarefree monomial ideal is the ideal of a tower scheme, we slightly extend this notion by defining generalized tower schemes …
Avoiding patterns in irreducible permutations
2016
We explore the classical pattern avoidance question in the case of irreducible permutations, <i>i.e.</i>, those in which there is no index $i$ such that $\sigma (i+1) - \sigma (i)=1$. The problem is addressed completely in the case of avoiding one or two patterns of length three, and several well known sequences are encountered in the process, such as Catalan, Motzkin, Fibonacci, Tribonacci, Padovan and Binary numbers. Also, we present constructive bijections between the set of Motzkin paths of length $n-1$ and the sets of irreducible permutations of length $n$ (respectively fixed point free irreducible involutions of length $2n$) avoiding a pattern $\alpha$ for $\alpha \in \{13…