Search results for " Geometry"

showing 10 items of 2294 documents

Combinatorial aspects of L-convex polyominoes

2007

We consider the class of L-convex polyominoes, i.e. those polyominoes in which any two cells can be connected with an ''L'' shaped path in one of its four cyclic orientations. The paper proves bijectively that the number f"n of L-convex polyominoes with perimeter 2(n+2) satisfies the linear recurrence relation f"n"+"2=4f"n"+"1-2f"n, by first establishing a recurrence of the same form for the cardinality of the ''2-compositions'' of a natural number n, a simple generalization of the ordinary compositions of n. Then, such 2-compositions are studied and bijectively related to certain words of a regular language over four letters which is in turn bijectively related to L-convex polyominoes. In …

Discrete mathematicsClass (set theory)Mathematics::CombinatoricsPolyominoEnumerationOpen problemGenerating functionRegular polygonPolyominoesNatural numberComputer Science::Computational GeometryFormal SeriesCombinatoricsCardinalityRegular languageDiscrete Mathematics and CombinatoricsTomographyAlgorithmsbinary tomographyMathematicsEnumeration; Formal Series; PolyominoesEuropean Journal of Combinatorics
researchProduct

On the Hierarchy Classes of Finite Ultrametric Automata

2015

This paper explores the language classes that arise with respect to the head count of a finite ultrametric automaton. First we prove that in the one-way setting there is a language that can be recognized by a one-head ultrametric finite automaton and cannot be recognized by any k-head non-deterministic finite automaton. Then we prove that in the two-way setting the class of languages recognized by ultrametric finite k-head automata is a proper subclass of the class of languages recognized by (k + 1)-head automata. Ultrametric finite automata are similar to probabilistic and quantum automata and have only just recently been introduced by Freivalds. We introduce ultrametric Turing machines an…

Discrete mathematicsClass (set theory)TheoryofComputation_COMPUTATIONBYABSTRACTDEVICESFinite-state machineHierarchy (mathematics)Nonlinear Sciences::Cellular Automata and Lattice GasesCondensed Matter::Disordered Systems and Neural NetworksAutomatonAlgebraTuring machinesymbols.namesakeTheoryofComputation_MATHEMATICALLOGICANDFORMALLANGUAGESsymbolsMathematics::Metric GeometryQuantum finite automataAutomata theoryUltrametric spaceComputer Science::Formal Languages and Automata TheoryMathematicsofComputing_DISCRETEMATHEMATICSMathematics
researchProduct

On t-covers in finite projective spaces

1979

A t-cover of the finite projective space PG(d,q) is a setS of t-dimensional subspaces such that any point of PG(d,q) is contained in at least one element ofS. In Theorem 1 a lower bound for the cardinality of a t-coverS in PG(d,q) is obtained and in Theorem 2 it is shown that this bound is best possible for all positive integers t,d and for any prime-power q.

Discrete mathematicsCollineationComplex projective spaceDuality (projective geometry)Projective spaceGeometry and TopologyProjective planeFano planeQuaternionic projective spaceUpper and lower boundsMathematicsJournal of Geometry
researchProduct

Classification of n-dimensional subvarieties of G(1, 2n) that can be projected to G(1, n + 1)

2005

A structure theorem is given for n-dimensional smooth subvarieties of the Grassmannian G(1, N); with N >= n + 3, that can be isomorphically projected to G(1, n + 1). A complete classification in the cases N = 2n + 1 and N = 2n follows, as a corollary.

Discrete mathematicsCombinatoricsMathematics::Algebraic GeometryCorollaryN dimensionalGeneral MathematicsGrassmannianSettore MAT/03 - GeometriaStructured program theoremMathematicsGrassmannians projections
researchProduct

The branch set of a quasiregular mapping between metric manifolds

2016

Abstract In this note, we announce some new results on quantitative countable porosity of the branch set of a quasiregular mapping in very general metric spaces. As applications, we solve a recent conjecture of Fassler et al., an open problem of Heinonen–Rickman, and an open question of Heinonen–Semmes.

Discrete mathematicsConjectureMathematics::Complex VariablesOpen problem010102 general mathematicsMathematical analysisGeneral Medicine01 natural sciences010101 applied mathematicsSet (abstract data type)Metric spaceMetric (mathematics)Mathematics::Metric GeometryCountable set0101 mathematicsMathematicsComptes Rendus Mathematique
researchProduct

Complete, Exact and Efficient Implementation for Computing the Adjacency Graph of an Arrangement of Quadrics

2007

The original publication is available at www.springerlink.com ; ISBN 978-3-540-75519-7 ; ISSN 0302-9743 (Print) 1611-3349 (Online); International audience; We present a complete, exact and efficient implementation to compute the adjacency graph of an arrangement of quadrics, \ie surfaces of algebraic degree~2. This is a major step towards the computation of the full 3D arrangement. We enhanced an implementation for an exact parameterization of the intersection curves of two quadrics, such that we can compute the exact parameter value for intersection points and from that the adjacency graph of the arrangement. Our implementation is {\em complete} in the sense that it can handle all kinds of…

Discrete mathematicsDegree (graph theory)ComputationDegenerate energy levelsACM: I.: Computing Methodologies/I.1: SYMBOLIC AND ALGEBRAIC MANIPULATION/I.1.2: Algorithms/I.1.2.0: Algebraic algorithms020207 software engineering010103 numerical & computational mathematics02 engineering and technology[INFO.INFO-CG]Computer Science [cs]/Computational Geometry [cs.CG]01 natural sciencesACM: G.: Mathematics of Computing/G.4: MATHEMATICAL SOFTWARE/G.4.3: EfficiencyCombinatoricsIntersection0202 electrical engineering electronic engineering information engineeringGraph (abstract data type)Adjacency listGravitational singularity0101 mathematicsAlgebraic numberACM: G.: Mathematics of Computing/G.4: MATHEMATICAL SOFTWARE/G.4.0: Algorithm design and analysisMathematics
researchProduct

Derived categories of irreducible projective curves of arithmetic genus one

2006

We investigate the bounded derived category of coherent sheaves on irreducible singular projective curves of arithmetic genus one. A description of the group of exact auto-equivalences and the set of all $t$ -structures of this category is given. We describe the moduli space of stability conditions, obtain a complete classification of all spherical objects in this category and show that the group of exact auto-equivalences acts transitively on them. Harder–Narasimhan filtrations in the sense of Bridgeland are used as our main technical tool.

Discrete mathematicsDerived categoryPure mathematicsAlgebra and Number TheoryFourier–Mukai transformGroup (mathematics)Moduli spaceCoherent sheafMathematics::Algebraic GeometryMathematics::Category TheoryBounded functionArithmetic genusAlgebraic curveMathematicsCompositio Mathematica
researchProduct

A natural and rigid model of quantum groups

1992

We introduce a natural (Frechet-Hopf) algebra A containing all generic Jimbo algebras U t (sl(2)) (as dense subalgebras). The Hopf structures on A extend (in a continuous way) the Hopf structures of generic U t (sl(2)). The Universal R-matrices converge in A\(\hat \otimes \)A. Using the (topological) dual of A, we recover the formalism of functions of noncommutative arguments. In addition, we show that all these Hopf structures on A are isomorphic (as bialgebras), and rigid in the category of bialgebras.

Discrete mathematicsFormalism (philosophy of mathematics)Pure mathematicsRigid modelQuantum groupMathematics::Quantum AlgebraMathematics::Rings and AlgebrasStatistical and Nonlinear PhysicsHopf algebraNoncommutative geometryQuantumMathematical PhysicsMathematicsLetters in Mathematical Physics
researchProduct

Further generalization of fixed point theorems in Menger PM-spaces

2015

In this work, we establish some fixed point theorems by revisiting the notion of ψ-contractive mapping in Menger PM-spaces. One of our results (namely, Theorem 2.3) may be viewed as a possible answer to the problem of existence of a fixed point for generalized type contractive mappings in M-complete Menger PM-spaces under arbitrary t-norm. Some examples are furnished to demonstrate the validity of the obtained results.

Discrete mathematicsGeneralizationApplied MathematicsFixed-point theoremType (model theory)Fixed pointMenger PM-spaceFixed-point propertyMenger's theoremfixed pointψ-contractive mappingDifferential geometrySettore MAT/05 - Analisi MatematicaGeometry and TopologyCoincidence pointMathematicsFixed Point Theory and Applications
researchProduct

INCIDENCE CONSTRAINTS: A COMBINATORIAL APPROACH

2006

The simplest geometric constraints are incidences between points and lines in the projective plane. This problem is universal, in the sense that all algebraic systems reduce to such geometric constraints. Detecting incidence dependences between these geometric constraints is NP-complete. New methods to prove incidence theorems are proposed, which use strictly no computer algebra but only combinatorial arguments.

Discrete mathematicsIncidence geometryApplied MathematicsCombinatorial proofSymbolic computationTheoretical Computer ScienceAlgebraComputational MathematicsComputational Theory and MathematicsGeometry and TopologyProjective planeAlgebraic numberIncidence (geometry)MathematicsProjective geometryInternational Journal of Computational Geometry & Applications
researchProduct