Search results for "Combinatorics"
showing 10 items of 1770 documents
Mirror symmetry and toric degenerations of partial flag manifolds
1998
In this paper we propose and discuss a mirror construction for complete intersections in partial flag manifolds $F(n_1, ..., n_l, n)$. This construction includes our previous mirror construction for complete intersection in Grassmannians and the mirror construction of Givental for complete flag manifolds. The key idea of our construction is a degeneration of $F(n_1, ..., n_l, n)$ to a certain Gorenstein toric Fano variety $P(n_1, ..., n_l, n)$ which has been investigated by Gonciulea and Lakshmibai. We describe a natural small crepant desingularization of $P(n_1, ..., n_l, n)$ and prove a generalized version of a conjecture of Gonciulea and Lakshmibai on the singular locus of $P(n_1, ..., n…
On Severi Type Inequalities for Irregular Surfaces
2017
Let X be a minimal surface of general type and maximal Albanese dimension with irregularity q ≥ 2. We show that K2 X ≥ 4χ(OX) + 4(q − 2) if K2 X < 9 2 χ(OX), and also obtain the characterization of the equality. As a consequence, we prove a conjecture of Manetti on the geography of irregular surfaces if K2 X ≥ 36(q−2) or χ(OX) ≥ 8(q−2), and we also prove a conjecture that the surfaces of general type and maximal Albanese dimension with K2 X = 4χ(OX) are exactly the resolution of double covers of abelian surfaces branched over ample divisors with at worst simple singularities.
From Wigner-Yanase-Dyson conjecture to Carlen-Frank-Lieb conjecture
2020
Abstract In this paper we study the joint convexity/concavity of the trace functions Ψ p , q , s ( A , B ) = Tr ( B q 2 K ⁎ A p K B q 2 ) s , p , q , s ∈ R , where A and B are positive definite matrices and K is any fixed invertible matrix. We will give full range of ( p , q , s ) ∈ R 3 for Ψ p , q , s to be jointly convex/concave for all K. As a consequence, we confirm a conjecture of Carlen, Frank and Lieb. In particular, we confirm a weaker conjecture of Audenaert and Datta and obtain the full range of ( α , z ) for α-z Renyi relative entropies to be monotone under completely positive trace preserving maps. We also give simpler proofs of many known results, including the concavity of Ψ p…
Conjugacy problem for braid groups and Garside groups
2003
We present a new algorithm to solve the conjugacy problem in Artin braid groups, which is faster than the one presented by Birman, Ko and Lee. This algorithm can be applied not only to braid groups, but to all Garside groups (which include finite type Artin groups and torus knot groups among others).
Topology guaranteeing manifold reconstruction using distance function to noisy data
2006
Given a smooth compact codimension one submanifold S of Rk and a compact approximation K of S, we prove that it is possible to reconstruct S and to approximate the medial axis of S with topological guarantees using unions of balls centered on K. We consider two notions of noisy-approximation that generalize sampling conditions introduced by Amenta & al. and Dey & al. Our results are based upon critical point theory for distance functions. For the two approximation conditions, we prove that the connected components of the boundary of unions of balls centered on K are isotopic to S. Our results allow to consider balls of different radii. For the first approximation condition, we also prove th…
Two-view “cylindrical decomposition” of binary images
2001
This paper describes the discrete cylindrical algebraic decomposition (DCAD) construction along two orthogonal views of binary images. The combination of two information is used to avoid ambiguities for image recognition purposes. This algorithm associates an object connectivity graph to each connected component, allowing a complete description of the structuring information. Moreover, an easy and compact representation of the scene is achieved by using strings in a five letter alphabet. Examples on complex digital images are also provided. © 2001 Elsevier Science Inc.
Stationary states in quantum walk search
2016
When classically searching a database, having additional correct answers makes the search easier. For a discrete-time quantum walk searching a graph for a marked vertex, however, additional marked vertices can make the search harder by causing the system to approximately begin in a stationary state, so the system fails to evolve. In this paper, we completely characterize the stationary states, or 1-eigenvectors, of the quantum walk search operator for general graphs and configurations of marked vertices by decomposing their amplitudes into uniform and flip states. This infinitely expands the number of known stationary states and gives an optimization procedure to find the stationary state c…
Separation properties of continuous maps in codimension 1 and geometrical applications
1992
Abstract Nuno Ballesteros, J.J. and M.C. Romero Fuster, Separation properties of continuous maps in codimension 1 and geometrical applications, Topology and its Applications 46 (1992) 107-111. We show that the image of a proper closed continuous map, f , from an n -manifold X to an ( n + 1)-manifold Y , such that H 1 (Y; Z 2 ) =0 , separates Y into at least two connected components provided the self-intersections set of f is not dense in any connected component of Y . We also obtain some geometrical applications.
A non-g-contractible uniformly path connected continuum
1999
Abstract An example of a uniformly path connected, plane continuum P is constructed and proved to admit no continuous surjection onto P homotopic to the constant map. This answers a question of D.P. Bellamy in the negative.
Unitary Space–Time Constellation Design Based on the Chernoff Bound of the Pairwise Error Probability
2008
Unitary space-time constellation design is considered for noncoherent multiple-antenna communications, where neither the transmitter nor the receiver knows the fading coefficients of the channel. By employing the Clarke's subdifferential theorem of the sum of the kappa largest singular values of a unitary matrix, we present a numerical optimization procedure for finding unitary space-time signal constellations of any dimension. The Chernoff bound of the pairwise error probability is used directly as a design criterion. The constellations are found by performing gradient descent search on a family ldquosurrogaterdquo functions that converge to the maximum pairwise error probability. The comp…