All a b c d e f g h i j k l m n o p q r s t u v w x y z Other

Page 1

Displaying 1 – 12 of 12

Showing per page

2 -modular lattices from ternary codes

Robin Chapman, Steven T. Dougherty, Philippe Gaborit, Patrick Solé (2002)

Journal de théorie des nombres de Bordeaux

The alphabet 𝐅 3 + v 𝐅 3 where v 2 = 1 is viewed here as a quotient of the ring of integers of 𝐐 ( - 2 ) by the ideal (3). Self-dual 𝐅 3 + v 𝐅 3 codes for the hermitian scalar product give 2 -modular lattices by construction A K . There is a Gray map which maps self-dual codes for the Euclidean scalar product into Type III codes with a fixed point free involution in their automorphism group. Gleason type theorems for the symmetrized weight enumerators of Euclidean self-dual codes and the length weight enumerator of hermitian self-dual...

A new lower bound for the football pool problem for 7 matches

Laurent Habsieger (1996)

Journal de théorie des nombres de Bordeaux

Let K 3 ( 7 , 1 ) denote the minimum cardinality of a ternary code of length 7 and covering radius one. In a previous paper, we improved on the lower bound K 3 ( 7 , 1 ) ≥ 147 by showing that K 3 ( 7 , 1 ) ≥ 150 . In this note, we prove that K 3 ( 7 , 1 ) ≥ 153 .

Applications of the ‘Ham Sandwich Theorem’ to Eigenvalues of the Laplacian

Kei Funano (2016)

Analysis and Geometry in Metric Spaces

We apply Gromov’s ham sandwich method to get: (1) domain monotonicity (up to a multiplicative constant factor); (2) reverse domain monotonicity (up to a multiplicative constant factor); and (3) universal inequalities for Neumann eigenvalues of the Laplacian on bounded convex domains in Euclidean space.

Chevet type inequality and norms of submatrices

Radosław Adamczak, Rafał Latała, Alexander E. Litvak, Alain Pajor, Nicole Tomczak-Jaegermann (2012)

Studia Mathematica

We prove a Chevet type inequality which gives an upper bound for the norm of an isotropic log-concave unconditional random matrix in terms of the expectation of the supremum of “symmetric exponential” processes, compared to the Gaussian ones in the Chevet inequality. This is used to give a sharp upper estimate for a quantity Γ k , m that controls uniformly the Euclidean operator norm of the submatrices with k rows and m columns of an isotropic log-concave unconditional random matrix. We apply these estimates...

Currently displaying 1 – 12 of 12

Page 1