Search results for "combinatoric"
showing 10 items of 1776 documents
Local nearrings with dihedral multiplicative group
2004
AbstractA not necessarily zero-symmetric nearring R with a unit element is called local if the set of all non-invertible elements of R forms a subgroup of the additive group of R. It is proved that every local nearring whose multiplicative group is dihedral is finite and its additive group is either a 3-group of order at most 9 or a 2-group of order at most 32.
The Bruce–Roberts Number of A Function on A Hypersurface with Isolated Singularity
2020
AbstractLet $(X,0)$ be an isolated hypersurface singularity defined by $\phi \colon ({\mathbb{C}}^n,0)\to ({\mathbb{C}},0)$ and $f\colon ({\mathbb{C}}^n,0)\to{\mathbb{C}}$ such that the Bruce–Roberts number $\mu _{BR}(f,X)$ is finite. We first prove that $\mu _{BR}(f,X)=\mu (f)+\mu (\phi ,f)+\mu (X,0)-\tau (X,0)$, where $\mu $ and $\tau $ are the Milnor and Tjurina numbers respectively of a function or an isolated complete intersection singularity. Second, we show that the logarithmic characteristic variety $LC(X,0)$ is Cohen–Macaulay. Both theorems generalize the results of a previous paper by some of the authors, in which the hypersurface $(X,0)$ was assumed to be weighted homogeneous.
Ideal-valued topological structures
2010
With L a complete lattice and M a continuous lattice, this paper demonstrates an adjunction between M -valued L-topological spaces (i.e. (L,M )-topological spaces) and Idl(M )-valued L-topological spaces where Idl(M ) is the complete lattice of all ideals of M . It is shown that the right adjoint functor provides a procedure of generating (L,M )-topologies from antitone families of (L,M )-topologies. This procedure is then applied to give an internal characterization of joins in the complete lattice of all (L,M )-topologies on a given set.
Sparse Dynamic Programming for Longest Common Subsequence from Fragments
2002
Sparse Dynamic Programming has emerged as an essential tool for the design of efficient algorithms for optimization problems coming from such diverse areas as computer science, computational biology, and speech recognition. We provide a new sparse dynamic programming technique that extends the Hunt?Szymanski paradigm for the computation of the longest common subsequence (LCS) and apply it to solve the LCS from Fragments problem: given a pair of strings X and Y (of length n and m, respectively) and a set M of matching substrings of X and Y, find the longest common subsequence based only on the symbol correspondences induced by the substrings. This problem arises in an application to analysis…
Learning a class of regular expressions via restricted subset queries
1992
A wide class of regular expressions non-representable as unions of “smaller” expressions is shown to be polynomial-time learnable via restricted subset queries from arbitrary representative examples “reflecting” the loop structure and a way the input example is obtained from the unknown expression. The corresponding subclass of regular expressions of loop depth at most 1 is shown to be learnable from representative examples via membership queries. A wide class of expressions with loops A+ of arbitrary loop depth is shown to be learnable via restricted subset queries from arbitrary examples.
From First Principles to the Burrows and Wheeler Transform and Beyond, via Combinatorial Optimization
2007
AbstractWe introduce a combinatorial optimization framework that naturally induces a class of optimal word permutations with respect to a suitably defined cost function taking into account various measures of relatedness between words. The Burrows and Wheeler transform (bwt) (cf. [M. Burrows, D. Wheeler, A block sorting lossless data compression algorithm, Technical Report 124, Digital Equipment Corporation, 1994]), and its analog for labelled trees (cf. [P. Ferragina, F. Luccio, G. Manzini, S. Muthukrishnan, Structuring labeled trees for optimal succinctness, and beyond, in: Proc. of the 45th Annual IEEE Symposium on Foundations of Computer Science, 2005, pp. 198–207]), are special cases i…
A construction of a fuzzy topology from a strong fuzzy metric
2016
<p>After the inception of the concept of a fuzzy metric by I. Kramosil and J. Michalek, and especially after its revision by A. George and G. Veeramani, the attention of many researches was attracted to the topology induced by a fuzzy metric. In most of the works devoted to this subject the resulting topology is an ordinary, that is a crisp one. Recently some researchers showed interest in the fuzzy-type topologies induced by fuzzy metrics. In particular, in the paper (J.J. Mi\~{n}ana, A. \v{S}ostak, {\it Fuzzifying topology induced by a strong fuzzy metric}, Fuzzy Sets and Systems, 6938 DOI information: 10.1016/j.fss.2015.11.005.) a fuzzifying topology ${\mathcal T}:2^X \to [0,1]$ …
On the variations of the Betti numbers of regular levels of Morse flows
2011
Abstract We generalize results in Cruz and de Rezende (1999) [7] by completely describing how the Betti numbers of the boundary of an orientable manifold vary after attaching a handle, when the homology coefficients are in Z, Q, R or Z p Z with p prime. First we apply this result to the Conley index theory of Lyapunov graphs. Next we consider the Ogasa invariant associated with handle decompositions of manifolds. We make use of the above results in order to obtain upper bounds for the Ogasa invariant of product manifolds.
Genomic and Metabolomic Profile Associated to Clustering of Cardio-Metabolic Risk Factors
2016
Background To identify metabolomic and genomic markers associated with the presence of clustering of cardiometabolic risk factors (CMRFs) from a general population. Methods and Findings One thousand five hundred and two subjects, Caucasian, > 18 years, representative of the general population, were included. Blood pressure measurement, anthropometric parameters and metabolic markers were measured. Subjects were grouped according the number of CMRFs (Group 1: <2; Group 2: 2; Group 3: 3 or more CMRFs). Using SNPlex, 1251 SNPs potentially associated to clustering of three or more CMRFs were analyzed. Serum metabolomic profile was assessed by 1H NMR spectra using a Brucker Advance DRX 600 spect…
Titchener's T in context 2 - Symmetric patterns of two Ts.
2019
Abstract Patterns of two Ts, materializing different symmetry groups, were used to explore conditions that would lead to a modulation of the typically observed overestimation of the length of a T's undivided line relative to its divided line. Observers either had to compare the lengths of the lines of one or the other of the Ts in a pattern, or noncorresponding lines between the two Ts. For both tasks alike, the T-illusion was found to be markedly greater with twofold mirror-symmetric 2-T patterns than it usually is with individual Ts. A control experiment suggested that the effect was probably due to the collinearity of the two Ts' undivided lines in these patterns rather than the addition…