corpus_id stringlengths 7 12 | paper_id stringlengths 9 16 | title stringlengths 1 261 | abstract stringlengths 70 4.02k | source stringclasses 1
value | bibtex stringlengths 208 20.9k | citation_key stringlengths 6 100 |
|---|---|---|---|---|---|---|
arxiv-676601 | math/0209332 | Hypercomputation: computing more than the Turing machine | <|reference_start|>Hypercomputation: computing more than the Turing machine: Due to common misconceptions about the Church-Turing thesis, it has been widely assumed that the Turing machine provides an upper bound on what is computable. This is not so. The new field of hypercomputation studies models of computation that... | arxiv | @article{ord2002hypercomputation:,
title={Hypercomputation: computing more than the Turing machine},
author={Toby Ord},
journal={arXiv preprint arXiv:math/0209332},
year={2002},
archivePrefix={arXiv},
eprint={math/0209332},
primaryClass={math.LO cs.OH math-ph math.MP}
} | ord2002hypercomputation: |
arxiv-676602 | math/0209407 | Uniformly distributed sequences of p-adic integers, II | <|reference_start|>Uniformly distributed sequences of p-adic integers, II: The paper describes ergodic (with respect to the Haar measure) functions in the class of all functions, which are defined on (and take values in) the ring of p-adic integers, and which satisfy (at least, locally) Lipschitz condition with coeffic... | arxiv | @article{anashin2002uniformly,
title={Uniformly distributed sequences of p-adic integers, II},
author={Vladimir Anashin (Faculty for the Information Security, Russian State
University for the Humanities)},
journal={Diskret.Mat., vol. 14 (2002), no. 4. pp. 3--64 (Russian); Discrete
Math. Appl., vol. 12 (... | anashin2002uniformly |
arxiv-676603 | math/0210018 | Topological robotics: motion planning in projective spaces | <|reference_start|>Topological robotics: motion planning in projective spaces: We study an elementary problem of topological robotics: rotation of a line, which is fixed by a revolving joint at a base point: one wants to bring the line from its initial position to a final position by a continuous motion in the space. T... | arxiv | @article{farber2002topological,
title={Topological robotics: motion planning in projective spaces},
author={Michael Farber, Serge Tabachnikov and Sergey Yuzvinsky},
journal={arXiv preprint arXiv:math/0210018},
year={2002},
archivePrefix={arXiv},
eprint={math/0210018},
primaryClass={math.AT c... | farber2002topological |
arxiv-676604 | math/0210052 | Criteria for Balance in Abelian Gain Graphs, with Applications to Piecewise-Linear Geometry | <|reference_start|>Criteria for Balance in Abelian Gain Graphs, with Applications to Piecewise-Linear Geometry: A gain graph is a triple (G,h,H), where G is a connected graph with an arbitrary, but fixed, orientation of edges, H is a group, and h is a homomorphism from the free group on the edges of G to H. A gain grap... | arxiv | @article{rybnikov2002criteria,
title={Criteria for Balance in Abelian Gain Graphs, with Applications to
Piecewise-Linear Geometry},
author={Konstantin Rybnikov, Thomas Zaslavsky},
journal={Discrete and Computational Geometry, 34 (2005), no. 2, 251-268.},
year={2002},
archivePrefix={arXiv},
epr... | rybnikov2002criteria |
arxiv-676605 | math/0210115 | Topological Robotics: Subspace Arrangements and Collision Free Motion Planning | <|reference_start|>Topological Robotics: Subspace Arrangements and Collision Free Motion Planning: We study an elementary problem of the topological robotics: collective motion of a set of $n$ distinct particles which one has to move from an initial configuration to a final configuration, with the requirement that no c... | arxiv | @article{farber2002topological,
title={Topological Robotics: Subspace Arrangements and Collision Free Motion
Planning},
author={Michael Farber and Sergey Yuzvinsky},
journal={arXiv preprint arXiv:math/0210115},
year={2002},
archivePrefix={arXiv},
eprint={math/0210115},
primaryClass={math.A... | farber2002topological |
arxiv-676606 | math/0210408 | Representations of finite groups on Riemann-Roch spaces | <|reference_start|>Representations of finite groups on Riemann-Roch spaces: We study the action of a finite group on the Riemann-Roch space of certain divisors on a curve. If $G$ is a finite subgroup of the automorphism group of a projective curve $X$ over an algebraically closed field and $D$ is a divisor on $X$ left ... | arxiv | @article{joyner2002representations,
title={Representations of finite groups on Riemann-Roch spaces},
author={David Joyner and Will Traves},
journal={arXiv preprint arXiv:math/0210408},
year={2002},
archivePrefix={arXiv},
eprint={math/0210408},
primaryClass={math.AG cs.IT math.GR math.IT}
} | joyner2002representations |
arxiv-676607 | math/0211040 | On cyclic convolutional codes | <|reference_start|>On cyclic convolutional codes: We investigate the notion of cyclicity for convolutional codes as it has been introduced by Piret and Roos in the seventies. Codes of this type are described as submodules of the module of all vector polynomials in one variable with some additional generalized cyclic st... | arxiv | @article{gluesing-luerssen2002on,
title={On cyclic convolutional codes},
author={H. Gluesing-Luerssen and W. Schmale},
journal={arXiv preprint arXiv:math/0211040},
year={2002},
archivePrefix={arXiv},
eprint={math/0211040},
primaryClass={math.RA cs.IT math.CO math.IT}
} | gluesing-luerssen2002on |
arxiv-676608 | math/0211107 | On Near-MDS Elliptic Codes | <|reference_start|>On Near-MDS Elliptic Codes: The main conjecture on maximum distance separable (MDS) codes states that, execpt for some special cases, the maximum length of a q-ary linear MDS code is q+1. This conjecture does not hold true for near maximum distance separable codes because of the existence of q-ary ne... | arxiv | @article{giulietti2002on,
title={On Near-MDS Elliptic Codes},
author={Massimo Giulietti},
journal={arXiv preprint arXiv:math/0211107},
year={2002},
archivePrefix={arXiv},
eprint={math/0211107},
primaryClass={math.AG cs.IT math.CO math.IT}
} | giulietti2002on |
arxiv-676609 | math/0211156 | Ideal decompositions and computation of tensor normal forms | <|reference_start|>Ideal decompositions and computation of tensor normal forms: Symmetry properties of r-times covariant tensors T can be described by certain linear subspaces W of the group ring K[S_r] of a symmetric group S_r. If for a class of tensors T such a W is known, the elements of the orthogonal subspace W^{\... | arxiv | @article{fiedler2002ideal,
title={Ideal decompositions and computation of tensor normal forms},
author={B. Fiedler},
journal={Seminaire Lotharingien de Combinatoire, 45 (2001) Article B45g.
http://www.mat.univie.ac.at/~slc/wpapers/s45fiedler.html},
year={2002},
archivePrefix={arXiv},
eprint={m... | fiedler2002ideal |
arxiv-676610 | math/0211267 | On alternative approach for verifiable secret sharing | <|reference_start|>On alternative approach for verifiable secret sharing: Secret sharing allows split/distributed control over the secret (e.g. master key). Verifiable secret sharing (VSS) is the secret sharing extended by verification capacity. Usually verification comes at the price. We propose "free lunch", the ap... | arxiv | @article{kulesza2002on,
title={On alternative approach for verifiable secret sharing},
author={Kamil Kulesza, Zbigniew Kotulski, Joseph Pieprzyk},
journal={arXiv preprint arXiv:math/0211267},
year={2002},
archivePrefix={arXiv},
eprint={math/0211267},
primaryClass={math.CO cs.CR cs.DM}
} | kulesza2002on |
arxiv-676611 | math/0211269 | On ASGS framework: general requirements and an example of implementation | <|reference_start|>On ASGS framework: general requirements and an example of implementation: In the paper we propose general framework for Automatic Secret Generation and Sharing (ASGS) that should be independent of underlying secret sharing scheme. ASGS allows to prevent the dealer from knowing the secret or even to e... | arxiv | @article{kulesza2002on,
title={On ASGS framework: general requirements and an example of implementation},
author={Kamil Kulesza, Zbigniew Kotulski},
journal={arXiv preprint arXiv:math/0211269},
year={2002},
archivePrefix={arXiv},
eprint={math/0211269},
primaryClass={math.CO cs.CR cs.DM cs.IT... | kulesza2002on |
arxiv-676612 | math/0211307 | On the multiresolution structure of Internet traffic traces | <|reference_start|>On the multiresolution structure of Internet traffic traces: Internet traffic on a network link can be modeled as a stochastic process. After detecting and quantifying the properties of this process, using statistical tools, a series of mathematical models is developed, culminating in one that is abl... | arxiv | @article{drakakis2002on,
title={On the multiresolution structure of Internet traffic traces},
author={Konstantinos Drakakis, Dragan Radulovic},
journal={arXiv preprint arXiv:math/0211307},
year={2002},
doi={10.1117/12.475274},
archivePrefix={arXiv},
eprint={math/0211307},
primaryClass={m... | drakakis2002on |
arxiv-676613 | math/0211317 | On graph coloring check-digit method | <|reference_start|>On graph coloring check-digit method: We show a method how to convert any graph into the binary number and vice versa. We derive upper bound for maximum number of graphs, that, have fixed number of vertices and can be colored with n colors (n is any given number). Proof for the result is outlined. Ne... | arxiv | @article{kulesza2002on,
title={On graph coloring check-digit method},
author={Kamil Kulesza, Zbigniew Kotulski},
journal={arXiv preprint arXiv:math/0211317},
year={2002},
archivePrefix={arXiv},
eprint={math/0211317},
primaryClass={math.CO cs.CR cs.DM cs.DS}
} | kulesza2002on |
arxiv-676614 | math/0211344 | Algebraic methods for computing smallest enclosing and circumscribing cylinders of simplices | <|reference_start|>Algebraic methods for computing smallest enclosing and circumscribing cylinders of simplices: We provide an algebraic framework to compute smallest enclosing and smallest circumscribing cylinders of simplices in Euclidean space $\E^n$. Explicitly, the computation of a smallest enclosing cylinder in $... | arxiv | @article{brandenberg2002algebraic,
title={Algebraic methods for computing smallest enclosing and circumscribing
cylinders of simplices},
author={R. Brandenberg (Technische Universitaet Muenchen), T. Theobald
(Technische Universitaet Muenchen)},
journal={arXiv preprint arXiv:math/0211344},
year={2002... | brandenberg2002algebraic |
arxiv-676615 | math/0212038 | A Goppa-like bound on the trellis state complexity of algebraic geometric codes | <|reference_start|>A Goppa-like bound on the trellis state complexity of algebraic geometric codes: For a linear code $\cC$ of length $n$ and dimension $k$, Wolf noticed that the trellis state complexity $s(\cC)$ of $\cC$ is upper bounded by $w(\cC):=\min(k,n-k)$. In this paper we point out some new lower bounds for $s... | arxiv | @article{munuera2002a,
title={A Goppa-like bound on the trellis state complexity of algebraic
geometric codes},
author={Carlos Munuera and Fernando Torres},
journal={arXiv preprint arXiv:math/0212038},
year={2002},
archivePrefix={arXiv},
eprint={math/0212038},
primaryClass={math.AG cs.IT m... | munuera2002a |
arxiv-676616 | math/0212044 | Toric ideals, real toric varieties, and the algebraic moment map | <|reference_start|>Toric ideals, real toric varieties, and the algebraic moment map: This is a tutorial on some aspects of toric varieties related to their potential use in geometric modeling. We discuss projective toric varieties and their ideals, as well as real toric varieties and the algebraic moment map. In partic... | arxiv | @article{sottile2002toric,
title={Toric ideals, real toric varieties, and the algebraic moment map},
author={Frank Sottile},
journal={in Topics in Algebraic Geometry and Geometric Modeling, Contemp.
Math., 334, 2003., pp.225-240},
year={2002},
archivePrefix={arXiv},
eprint={math/0212044},
... | sottile2002toric |
arxiv-676617 | math/0212212 | Coverage control for mobile sensing networks | <|reference_start|>Coverage control for mobile sensing networks: This paper presents control and coordination algorithms for groups of vehicles. The focus is on autonomous vehicle networks performing distributed sensing tasks where each vehicle plays the role of a mobile tunable sensor. The paper proposes gradient desc... | arxiv | @article{cortes2002coverage,
title={Coverage control for mobile sensing networks},
author={J. Cortes, S. Martinez, T. Karatas, F. Bullo},
journal={IEEE Transactions on Robotics and Automation 20 (2) (2004),
243-255},
year={2002},
archivePrefix={arXiv},
eprint={math/0212212},
primaryClass={... | cortes2002coverage |
arxiv-676618 | math/0212278 | Determination of the structure of algebraic curvature tensors by means of Young symmetrizers | <|reference_start|>Determination of the structure of algebraic curvature tensors by means of Young symmetrizers: For a positive definite fundamental tensor all known examples of Osserman algebraic curvature tensors have a typical structure. They can be produced from a metric tensor and a finite set of skew-symmetric ma... | arxiv | @article{fiedler2002determination,
title={Determination of the structure of algebraic curvature tensors by means
of Young symmetrizers},
author={B. Fiedler},
journal={Seminaire Lotharingien de Combinatoire, 48 (2003) Article B48d},
year={2002},
archivePrefix={arXiv},
eprint={math/0212278},
... | fiedler2002determination |
arxiv-676619 | math/0301042 | On the symmetry classes of the first covariant derivatives of tensor fields | <|reference_start|>On the symmetry classes of the first covariant derivatives of tensor fields: We show that the symmetry classes of torsion-free covariant derivatives $\nabla T$ of r-times covariant tensor fields T can be characterized by Littlewood-Richardson products $\sigma [1]$ where $\sigma$ is a representation o... | arxiv | @article{fiedler2003on,
title={On the symmetry classes of the first covariant derivatives of tensor
fields},
author={B. Fiedler},
journal={Seminaire Lotharingien de Combinatoire, 49 (2003) Article B49f},
year={2003},
archivePrefix={arXiv},
eprint={math/0301042},
primaryClass={math.CO cs.SC... | fiedler2003on |
arxiv-676620 | math/0301135 | Grassmannian Frames with Applications to Coding and Communication | <|reference_start|>Grassmannian Frames with Applications to Coding and Communication: For a given class ${\cal F}$ of uniform frames of fixed redundancy we define a Grassmannian frame as one that minimizes the maximal correlation $|< f_k,f_l >|$ among all frames $\{f_k\}_{k \in {\cal I}} \in {\cal F}$. We first analyze... | arxiv | @article{strohmer2003grassmannian,
title={Grassmannian Frames with Applications to Coding and Communication},
author={Thomas Strohmer and Robert Heath},
journal={arXiv preprint arXiv:math/0301135},
year={2003},
archivePrefix={arXiv},
eprint={math/0301135},
primaryClass={math.FA cs.IT math.IT... | strohmer2003grassmannian |
arxiv-676621 | math/0301211 | Binary trees and fibred categories | <|reference_start|>Binary trees and fibred categories: We develop a purely set-theoretic formalism for binary trees and binary graphs. We define a category of binary automata, and display it as a fibred category over the category of binary graphs. We also relate the notion of binary graphs to transition systems, which ... | arxiv | @article{raghavendra2003binary,
title={Binary trees and fibred categories},
author={N. Raghavendra},
journal={arXiv preprint arXiv:math/0301211},
year={2003},
archivePrefix={arXiv},
eprint={math/0301211},
primaryClass={math.CO cs.DM math.CT}
} | raghavendra2003binary |
arxiv-676622 | math/0301268 | Improving Search Algorithms by Using Intelligent Coordinates | <|reference_start|>Improving Search Algorithms by Using Intelligent Coordinates: We consider the problem of designing a set of computational agents so that as they all pursue their self-interests a global function G of the collective system is optimized. Three factors govern the quality of such design. The first relate... | arxiv | @article{wolpert2003improving,
title={Improving Search Algorithms by Using Intelligent Coordinates},
author={David Wolpert, Kagan Tumer and Esfandiar Bandari},
journal={arXiv preprint arXiv:math/0301268},
year={2003},
doi={10.1103/PhysRevE.69.017701},
archivePrefix={arXiv},
eprint={math/0301... | wolpert2003improving |
arxiv-676623 | math/0301274 | On the existence of a new family of Diophantine equations for $\bf \Omega$ | <|reference_start|>On the existence of a new family of Diophantine equations for $\bf \Omega$: We show how to determine the $k$-th bit of Chaitin's algorithmically random real number $\Omega$ by solving $k$ instances of the halting problem. From this we then reduce the problem of determining the $k$-th bit of $\Omega$ ... | arxiv | @article{ord2003on,
title={On the existence of a new family of Diophantine equations for $\bf
\Omega$},
author={Toby Ord and Tien D. Kieu},
journal={Fundamenta Informaticae 56 (2003) 273--284},
year={2003},
archivePrefix={arXiv},
eprint={math/0301274},
primaryClass={math.NT cs.CC quant-ph}... | ord2003on |
arxiv-676624 | math/0302043 | Extended visual cryptography systems | <|reference_start|>Extended visual cryptography systems: Visual cryptography schemes have been introduced in 1994 by Naor and Shamir. Their idea was to encode a secret image into $n$ shadow images and to give exactly one such shadow image to each member of a group $P$ of $n$ persons. Whereas most work in recent years h... | arxiv | @article{klein2003extended,
title={Extended visual cryptography systems},
author={Andreas Klein and Markus Wessler},
journal={arXiv preprint arXiv:math/0302043},
year={2003},
archivePrefix={arXiv},
eprint={math/0302043},
primaryClass={math.CO cs.IT math.IT}
} | klein2003extended |
arxiv-676625 | math/0302132 | Computing Symmetrized Weight Enumerators for Lifted Quadratic Residue Codes | <|reference_start|>Computing Symmetrized Weight Enumerators for Lifted Quadratic Residue Codes: The paper describes a method to determine symmetrized weight enumerators of $p^m$-linear codes based on the notion of a disjoint weight enumerator. Symmetrized weight enumerators are given for the lifted quadratic residue co... | arxiv | @article{duursma2003computing,
title={Computing Symmetrized Weight Enumerators for Lifted Quadratic Residue
Codes},
author={I.M. Duursma, M. Greferath},
journal={arXiv preprint arXiv:math/0302132},
year={2003},
archivePrefix={arXiv},
eprint={math/0302132},
primaryClass={math.CO cs.IT math.... | duursma2003computing |
arxiv-676626 | math/0302154 | Twisted Klein curves modulo 2 | <|reference_start|>Twisted Klein curves modulo 2: We give an explicit description of all 168 quartic curves over the field of two elements that are isomorphic to the Klein curve over an algebraic extension. Some of the curves have been known for their small class number, others for attaining the maximal number of ratio... | arxiv | @article{duursma2003twisted,
title={Twisted Klein curves modulo 2},
author={I.M. Duursma},
journal={arXiv preprint arXiv:math/0302154},
year={2003},
archivePrefix={arXiv},
eprint={math/0302154},
primaryClass={math.NT cs.IT math.AG math.IT}
} | duursma2003twisted |
arxiv-676627 | math/0302172 | Results on zeta functions for codes | <|reference_start|>Results on zeta functions for codes: We give a new and short proof of the Mallows-Sloane upper bound for self-dual codes. We formulate a version of Greene's theorem for normalized weight enumerators. We relate normalized rank-generating polynomials to two-variable zeta functions. And we show that a s... | arxiv | @article{duursma2003results,
title={Results on zeta functions for codes},
author={I.M. Duursma},
journal={arXiv preprint arXiv:math/0302172},
year={2003},
archivePrefix={arXiv},
eprint={math/0302172},
primaryClass={math.CO cs.IT math.IT math.NT}
} | duursma2003results |
arxiv-676628 | math/0302303 | Cubefree binary words avoiding long squares | <|reference_start|>Cubefree binary words avoiding long squares: Entringer, Jackson, and Schatz conjectured in 1974 that every infinite cubefree binary word contains arbitrarily long squares. In this paper we show this conjecture is false: there exist infinite cubefree binary words avoiding all squares xx with |x| >= 4,... | arxiv | @article{rampersad2003cubefree,
title={Cubefree binary words avoiding long squares},
author={Narad Rampersad, Jeffrey Shallit, Ming-wei Wang},
journal={arXiv preprint arXiv:math/0302303},
year={2003},
archivePrefix={arXiv},
eprint={math/0302303},
primaryClass={math.CO cs.DM}
} | rampersad2003cubefree |
arxiv-676629 | math/0302315 | Memory Efficient Arithmetic | <|reference_start|>Memory Efficient Arithmetic: In this paper we give an algorithm for computing the mth base-b digit (m=1 is the least significant digit) of an integer n (actually, it finds sharp approximations to n/b^m mod 1), where n is defined as the last number in a sequence of integers s1,s2,...,sL=n, where s1=0,... | arxiv | @article{croot2003memory,
title={Memory Efficient Arithmetic},
author={Ernie Croot},
journal={arXiv preprint arXiv:math/0302315},
year={2003},
archivePrefix={arXiv},
eprint={math/0302315},
primaryClass={math.NT cs.DS}
} | croot2003memory |
arxiv-676630 | math/0303104 | Bounding the trellis state complexity of algebraic geometric codes | <|reference_start|>Bounding the trellis state complexity of algebraic geometric codes: Let C be an algebraic geometric code of dimension k and length n constructed on a curve X over $F_q$. Let s(C) be the state complexity of C and set w(C):=min{k,n-k}, the Wolf upper bound on s(C). We introduce a numerical function R t... | arxiv | @article{munuera2003bounding,
title={Bounding the trellis state complexity of algebraic geometric codes},
author={Carlos Munuera and Fernando Torres},
journal={arXiv preprint arXiv:math/0303104},
year={2003},
archivePrefix={arXiv},
eprint={math/0303104},
primaryClass={math.AG cs.IT math.IT}
... | munuera2003bounding |
arxiv-676631 | math/0303254 | Strongly MDS Convolutional Codes | <|reference_start|>Strongly MDS Convolutional Codes: MDS convolutional codes have the property that their free distance is maximal among all codes of the same rate and the same degree. In this paper we introduce a class of MDS convolutional codes whose column distances reach the generalized Singleton bound at the earli... | arxiv | @article{gluesing-luerssen2003strongly,
title={Strongly MDS Convolutional Codes},
author={Heide Gluesing-Luerssen, Joachim Rosenthal and Roxana Smarandache},
journal={arXiv preprint arXiv:math/0303254},
year={2003},
archivePrefix={arXiv},
eprint={math/0303254},
primaryClass={math.RA cs.IT ma... | gluesing-luerssen2003strongly |
arxiv-676632 | math/0303386 | Generic properties of Whitehead's Algorithm and isomorphism rigidity of random one-relator groups | <|reference_start|>Generic properties of Whitehead's Algorithm and isomorphism rigidity of random one-relator groups: We prove that Whitehead's algorithm for solving the automorphism problem in a fixed free group $F_k$ has strongly linear time generic-case complexity. This is done by showing that the ``hard'' part of t... | arxiv | @article{kapovich2003generic,
title={Generic properties of Whitehead's Algorithm and isomorphism rigidity of
random one-relator groups},
author={Ilya Kapovich, Paul Schupp and Vladimir Shpilrain},
journal={arXiv preprint arXiv:math/0303386},
year={2003},
archivePrefix={arXiv},
eprint={math/030... | kapovich2003generic |
arxiv-676633 | math/0304095 | Polynomial versus Exponential Growth in Repetition-Free Binary Words | <|reference_start|>Polynomial versus Exponential Growth in Repetition-Free Binary Words: It is known that the number of overlap-free binary words of length n grows polynomially, while the number of cubefree binary words grows exponentially. We show that the dividing line between polynomial and exponential growth is 7/3... | arxiv | @article{karhumaki2003polynomial,
title={Polynomial versus Exponential Growth in Repetition-Free Binary Words},
author={Juhani Karhumaki and Jeffrey Shallit},
journal={arXiv preprint arXiv:math/0304095},
year={2003},
archivePrefix={arXiv},
eprint={math/0304095},
primaryClass={math.CO cs.DM}
... | karhumaki2003polynomial |
arxiv-676634 | math/0304100 | A Direct Ultrametric Approach to Additive Complexity and the Shub-Smale Tau Conjecture | <|reference_start|>A Direct Ultrametric Approach to Additive Complexity and the Shub-Smale Tau Conjecture: The Shub-Smale Tau Conjecture is a hypothesis relating the number of integral roots of a polynomial f in one variable and the Straight-Line Program (SLP) complexity of f. A consequence of the truth of this conject... | arxiv | @article{rojas2003a,
title={A Direct Ultrametric Approach to Additive Complexity and the Shub-Smale
Tau Conjecture},
author={J. Maurice Rojas},
journal={arXiv preprint arXiv:math/0304100},
year={2003},
archivePrefix={arXiv},
eprint={math/0304100},
primaryClass={math.NT cs.CC}
} | rojas2003a |
arxiv-676635 | math/0304192 | On reconstructing n-point configurations from the distribution of distances or areas | <|reference_start|>On reconstructing n-point configurations from the distribution of distances or areas: One way to characterize configurations of points up to congruence is by considering the distribution of all mutual distances between points. This paper deals with the question if point configurations are uniquely de... | arxiv | @article{boutin2003on,
title={On reconstructing n-point configurations from the distribution of
distances or areas},
author={Mireille Boutin, Gregor Kemper},
journal={arXiv preprint arXiv:math/0304192},
year={2003},
archivePrefix={arXiv},
eprint={math/0304192},
primaryClass={math.AC cs.CV ... | boutin2003on |
arxiv-676636 | math/0304283 | Whitehead method and Genetic Algorithms | <|reference_start|>Whitehead method and Genetic Algorithms: In this paper we discuss a genetic version (GWA) of the Whitehead's algorithm, which is one of the basic algorithms in combinatorial group theory. It turns out that GWA is surprisingly fast and outperforms the standard Whitehead's algorithm in free groups of r... | arxiv | @article{miasnikov2003whitehead,
title={Whitehead method and Genetic Algorithms},
author={Alexei D. Miasnikov, Alexei G. Myasnikov},
journal={arXiv preprint arXiv:math/0304283},
year={2003},
archivePrefix={arXiv},
eprint={math/0304283},
primaryClass={math.GR cs.NE cs.SC}
} | miasnikov2003whitehead |
arxiv-676637 | math/0304292 | The Ubiquity of Order Domains for the Construction of Error Control Codes | <|reference_start|>The Ubiquity of Order Domains for the Construction of Error Control Codes: The order domains are a class of commutative rings introduced by H{\o}holdt, van Lint, and Pellikaan to simplify the theory of error control codes using ideas from algebraic geometry. The definition is largely motivated by the... | arxiv | @article{little2003the,
title={The Ubiquity of Order Domains for the Construction of Error Control
Codes},
author={John B. Little},
journal={Advances in Mathematics of Communications 1 (2007), 151-171},
year={2003},
archivePrefix={arXiv},
eprint={math/0304292},
primaryClass={math.AC cs.IT ... | little2003the |
arxiv-676638 | math/0304305 | Balanced presentations of the trivial group on two generators and the Andrews-Curtis conjecture | <|reference_start|>Balanced presentations of the trivial group on two generators and the Andrews-Curtis conjecture: The Andrews-Curtis conjecture states that every balanced presentation of the trivial group can be reduced to the standard one by a sequence of the elementary Nielsen transformations and conjugations. In t... | arxiv | @article{miasnikov2003balanced,
title={Balanced presentations of the trivial group on two generators and the
Andrews-Curtis conjecture},
author={Alexei D. Miasnikov, Alexei G. Myasnikov},
journal={In W.Kantor and A.Seress,editors, Groups and Computation III,
volume 23, (2001) 257-263, Berlin},
year=... | miasnikov2003balanced |
arxiv-676639 | math/0304306 | Genetic algorithms and the Andrews-Curtis conjecture | <|reference_start|>Genetic algorithms and the Andrews-Curtis conjecture: The Andrews-Curtis conjecture claims that every balanced presentation of the trivial group can be transformed into the trivial presentation by a finite sequence of "elementary transformations" which are Nielsen transformations together with an arb... | arxiv | @article{miasnikov2003genetic,
title={Genetic algorithms and the Andrews-Curtis conjecture},
author={Alexei D. Miasnikov},
journal={International Journal of Algebra and Computation, Vol. 9 No. 6,
(1999) 671-686},
year={2003},
archivePrefix={arXiv},
eprint={math/0304306},
primaryClass={math... | miasnikov2003genetic |
arxiv-676640 | math/0304346 | The envelope of lines meeting a fixed line that are tangent to two spheres | <|reference_start|>The envelope of lines meeting a fixed line that are tangent to two spheres: We study the set of lines that meet a fixed line and are tangent to two spheres and classify the configurations consisting of a single line and three spheres for which there are infinitely many lines tangent to the three sphe... | arxiv | @article{megyesi2003the,
title={The envelope of lines meeting a fixed line that are tangent to two
spheres},
author={G'abor Megyesi (UMIST) and Frank Sottile (Texas A&M University)},
journal={Discrete and Computational Geometry, 33, Number 4, (2005)
617--644.},
year={2003},
archivePrefix={arXiv}... | megyesi2003the |
arxiv-676641 | math/0304476 | Simultaneous avoidance of large squares and fractional powers in infinite binary words | <|reference_start|>Simultaneous avoidance of large squares and fractional powers in infinite binary words: In 1976, Dekking showed that there exists an infinite binary word that contains neither squares yy with y >= 4 nor cubes xxx. We show that `cube' can be replaced by any fractional power > 5/2. We also consider the... | arxiv | @article{shallit2003simultaneous,
title={Simultaneous avoidance of large squares and fractional powers in
infinite binary words},
author={Jeffrey Shallit},
journal={arXiv preprint arXiv:math/0304476},
year={2003},
archivePrefix={arXiv},
eprint={math/0304476},
primaryClass={math.CO cs.DM}
} | shallit2003simultaneous |
arxiv-676642 | math/0305121 | Robust Estimators under the Imprecise Dirichlet Model | <|reference_start|>Robust Estimators under the Imprecise Dirichlet Model: Walley's Imprecise Dirichlet Model (IDM) for categorical data overcomes several fundamental problems which other approaches to uncertainty suffer from. Yet, to be useful in practice, one needs efficient ways for computing the imprecise=robust set... | arxiv | @article{hutter2003robust,
title={Robust Estimators under the Imprecise Dirichlet Model},
author={Marcus Hutter},
journal={Proc. 3rd International Symposium on Imprecise Probabilities and
Their Application (ISIPTA-2003), pages 274-289},
year={2003},
number={IDSIA-03-03},
archivePrefix={arXiv},... | hutter2003robust |
arxiv-676643 | math/0305135 | Distance bounds for convolutional codes and some optimal codes | <|reference_start|>Distance bounds for convolutional codes and some optimal codes: After a discussion of the Griesmer and Heller bound for the distance of a convolutional code we present several codes with various parameters, over various fields, and meeting the given distance bounds. Moreover, the Griesmer bound is us... | arxiv | @article{gluesing-luerssen2003distance,
title={Distance bounds for convolutional codes and some optimal codes},
author={Heide Gluesing-Luerssen and Wiland Schmale},
journal={arXiv preprint arXiv:math/0305135},
year={2003},
archivePrefix={arXiv},
eprint={math/0305135},
primaryClass={math.RA c... | gluesing-luerssen2003distance |
arxiv-676644 | math/0305308 | Numerical Analogues of Aronson's Sequence | <|reference_start|>Numerical Analogues of Aronson's Sequence: Aronson's sequence 1, 4, 11, 16, ... is defined by the English sentence ``t is the first, fourth, eleventh, sixteenth, ... letter of this sentence.'' This paper introduces some numerical analogues, such as: a(n) is taken to be the smallest positive integer g... | arxiv | @article{cloitre2003numerical,
title={Numerical Analogues of Aronson's Sequence},
author={Benoit Cloitre, N. J. A. Sloane, Matthew J. Vandermast},
journal={J. Integer Sequences, 6 (2003), #03.2.2},
year={2003},
archivePrefix={arXiv},
eprint={math/0305308},
primaryClass={math.NT cs.IT math.IT... | cloitre2003numerical |
arxiv-676645 | math/0306081 | Avoiding large squares in infinite binary words | <|reference_start|>Avoiding large squares in infinite binary words: We consider three aspects of avoiding large squares in infinite binary words. First, we construct an infinite binary word avoiding both cubes xxx and squares yy with |y| >= 4; our construction is somewhat simpler than the original construction of Dekki... | arxiv | @article{rampersad2003avoiding,
title={Avoiding large squares in infinite binary words},
author={Narad Rampersad, Jeffrey Shallit, and Ming-wei Wang},
journal={arXiv preprint arXiv:math/0306081},
year={2003},
archivePrefix={arXiv},
eprint={math/0306081},
primaryClass={math.CO cs.DM}
} | rampersad2003avoiding |
arxiv-676646 | math/0306354 | Coding and tiling of Julia sets for subhyperbolic rational maps | <|reference_start|>Coding and tiling of Julia sets for subhyperbolic rational maps: Let $f:\hat{C}\to\hat{C}$ be a subhyperbolic rational map of degree $d$. We construct a set of coding maps $Cod(f)=\{\pi_r:\Sigma\to J\}_r$ of the Julia set $J$ by geometric coding trees, where the parameter $r$ ranges over mappings fro... | arxiv | @article{kameyama2003coding,
title={Coding and tiling of Julia sets for subhyperbolic rational maps},
author={Atsushi Kameyama},
journal={arXiv preprint arXiv:math/0306354},
year={2003},
archivePrefix={arXiv},
eprint={math/0306354},
primaryClass={math.DS cs.IT math.IT}
} | kameyama2003coding |
arxiv-676647 | math/0306395 | Sur la non-linearite des fonctions booleennes | <|reference_start|>Sur la non-linearite des fonctions booleennes: Boolean functions on the space $F_{2}^m$ are not only important in the theory of error-correcting codes, but also in cryptography, where they occur in private key systems. In these two cases, the nonlinearity of these function is a main concept. In this ... | arxiv | @article{rodier2003sur,
title={Sur la non-linearite des fonctions booleennes},
author={Francois Rodier},
journal={arXiv preprint arXiv:math/0306395},
year={2003},
doi={10.4064/aa115-1-1},
archivePrefix={arXiv},
eprint={math/0306395},
primaryClass={math.NT cs.IT math.IT}
} | rodier2003sur |
arxiv-676648 | math/0306401 | The number of transversals to line segments in R^3 | <|reference_start|>The number of transversals to line segments in R^3: We completely describe the structure of the connected components of transversals to a collection of n line segments in R^3. We show that n>2 arbitrary line segments in R^3 admit 0, 1, ..., n or infinitely many line transversals. In the latter case, ... | arxiv | @article{brönnimann2003the,
title={The number of transversals to line segments in R^3},
author={Herv'e Br"onnimann, Hazel Everett, Sylvain Lazard, Frank Sottile,
and Sue Whitesides},
journal={Discrete and Computational Geometry, Volume 34, Number 3, (2005),
381--390.},
year={2003},
archivePrefix... | brönnimann2003the |
arxiv-676649 | math/0307064 | The Number of Hierarchical Orderings | <|reference_start|>The Number of Hierarchical Orderings: An ordered set-partition (or preferential arrangement) of n labeled elements represents a single ``hierarchy''; these are enumerated by the ordered Bell numbers. In this note we determine the number of ``hierarchical orderings'' or ``societies'', where the n elem... | arxiv | @article{sloane2003the,
title={The Number of Hierarchical Orderings},
author={N. J. A. Sloane, Thomas Wieder},
journal={Order, 21 (2004), 83-89},
year={2003},
archivePrefix={arXiv},
eprint={math/0307064},
primaryClass={math.CO cs.IT math.IT}
} | sloane2003the |
arxiv-676650 | math/0307196 | Convolutional Codes with Maximum Distance Profile | <|reference_start|>Convolutional Codes with Maximum Distance Profile: Maximum distance profile codes are characterized by the property that two trajectories which start at the same state and proceed to a different state will have the maximum possible distance from each other relative to any other convolutional code of ... | arxiv | @article{hutchinson2003convolutional,
title={Convolutional Codes with Maximum Distance Profile},
author={R. Hutchinson, J. Rosenthal, R. Smarandache},
journal={arXiv preprint arXiv:math/0307196},
year={2003},
archivePrefix={arXiv},
eprint={math/0307196},
primaryClass={math.OC cs.IT math.IT m... | hutchinson2003convolutional |
arxiv-676651 | math/0308046 | Still better nonlinear codes from modular curves | <|reference_start|>Still better nonlinear codes from modular curves: We give a new construction of nonlinear error-correcting codes over suitable finite fields k from the geometry of modular curves with many rational points over k, combining two recent improvements on Goppa's construction. The resulting codes are asymp... | arxiv | @article{elkies2003still,
title={Still better nonlinear codes from modular curves},
author={Noam D. Elkies},
journal={arXiv preprint arXiv:math/0308046},
year={2003},
archivePrefix={arXiv},
eprint={math/0308046},
primaryClass={math.NT cs.IT math.AG math.IT}
} | elkies2003still |
arxiv-676652 | math/0308110 | Sphere packing bounds in the Grassmann and Stiefel manifolds | <|reference_start|>Sphere packing bounds in the Grassmann and Stiefel manifolds: Applying the Riemann geometric machinery of volume estimates in terms of curvature, bounds for the minimal distance of packings/codes in the Grassmann and Stiefel manifolds will be derived and analyzed. In the context of space-time block c... | arxiv | @article{henkel2003sphere,
title={Sphere packing bounds in the Grassmann and Stiefel manifolds},
author={Oliver Henkel},
journal={IEEE Transactions on Information Theory, vol 51, no 10, (2005),
3445-3456},
year={2003},
doi={10.1109/TIT.2005.855594},
archivePrefix={arXiv},
eprint={math/0308... | henkel2003sphere |
arxiv-676653 | math/0308153 | Mathematics and Logic as Information Compression by Multiple Alignment, Unification and Search | <|reference_start|>Mathematics and Logic as Information Compression by Multiple Alignment, Unification and Search: This article introduces the conjecture that "mathematics, logic and related disciplines may usefully be understood as information compression (IC) by 'multiple alignment', 'unification' and 'search' (ICMAU... | arxiv | @article{wolff2003mathematics,
title={Mathematics and Logic as Information Compression by Multiple Alignment,
Unification and Search},
author={J Gerard Wolff},
journal={arXiv preprint arXiv:math/0308153},
year={2003},
archivePrefix={arXiv},
eprint={math/0308153},
primaryClass={math.GM cs.A... | wolff2003mathematics |
arxiv-676654 | math/0309081 | Asymmetric binary covering codes | <|reference_start|>Asymmetric binary covering codes: An asymmetric binary covering code of length n and radius R is a subset C of the n-cube Q_n such that every vector x in Q_n can be obtained from some vector c in C by changing at most R 1's of c to 0's, where R is as small as possible. K^+(n,R) is defined as the smal... | arxiv | @article{cooper2003asymmetric,
title={Asymmetric binary covering codes},
author={Joshua N. Cooper, Robert B. Ellis, and Andrew B. Kahng},
journal={J. Combin. Theory Ser. A 100 (2002), no. 2, 232--249},
year={2003},
archivePrefix={arXiv},
eprint={math/0309081},
primaryClass={math.CO cs.IT mat... | cooper2003asymmetric |
arxiv-676655 | math/0309083 | Convex Combinatorial Optimization | <|reference_start|>Convex Combinatorial Optimization: We introduce the convex combinatorial optimization problem, a far reaching generalization of the standard linear combinatorial optimization problem. We show that it is strongly polynomial time solvable over any edge-guaranteed family, and discuss several application... | arxiv | @article{onn2003convex,
title={Convex Combinatorial Optimization},
author={Shmuel Onn and Uriel G. Rothblum},
journal={Discrete and Computational Geometry, 32:549--566, 2004},
year={2003},
archivePrefix={arXiv},
eprint={math/0309083},
primaryClass={math.CO cs.DM math.OC}
} | onn2003convex |
arxiv-676656 | math/0309120 | An invariant of finitary codes with finite expected square root coding length | <|reference_start|>An invariant of finitary codes with finite expected square root coding length: Let $p$ and $q$ be probability vectors with the same entropy $h$. Denote by $B(p)$ the Bernoulli shift indexed by $\Z$ with marginal distribution $p$. Suppose that $\phi$ is a measure preserving homomorphism from $B(p)$ to... | arxiv | @article{harvey2003an,
title={An invariant of finitary codes with finite expected square root coding
length},
author={Nate Harvey, Yuval Peres (UC Berkeley)},
journal={arXiv preprint arXiv:math/0309120},
year={2003},
archivePrefix={arXiv},
eprint={math/0309120},
primaryClass={math.PR cs.IT... | harvey2003an |
arxiv-676657 | math/0309123 | Error Correcting Codes on Algebraic Surfaces | <|reference_start|>Error Correcting Codes on Algebraic Surfaces: Error correcting codes are defined and important parameters for a code are explained. Parameters of new codes constructed on algebraic surfaces are studied. In particular, codes resulting from blowing up points in $\proj^2$ are briefly studied, then codes... | arxiv | @article{lomont2003error,
title={Error Correcting Codes on Algebraic Surfaces},
author={Chris Lomont},
journal={arXiv preprint arXiv:math/0309123},
year={2003},
archivePrefix={arXiv},
eprint={math/0309123},
primaryClass={math.NT cs.IT math.AG math.IT}
} | lomont2003error |
arxiv-676658 | math/0309285 | An Algorithm for Optimal Partitioning of Data on an Interval | <|reference_start|>An Algorithm for Optimal Partitioning of Data on an Interval: Many signal processing problems can be solved by maximizing the fitness of a segmented model over all possible partitions of the data interval. This letter describes a simple but powerful algorithm that searches the exponentially large spa... | arxiv | @article{jackson2003an,
title={An Algorithm for Optimal Partitioning of Data on an Interval},
author={Brad Jackson, Jeffrey D. Scargle, David Barnes, Sundararajan Arabhi,
Alina Alt, Peter Gioumousis, Elyus Gwin, Paungkaew Sangtrakulcharoen, Linda
Tan, and Tun Tao Tsai},
journal={arXiv preprint arXiv:mat... | jackson2003an |
arxiv-676659 | math/0309347 | Nowhere-Zero Flow Polynomials | <|reference_start|>Nowhere-Zero Flow Polynomials: In this article we introduce the flow polynomial of a digraph and use it to study nowhere-zero flows from a commutative algebraic perspective. Using Hilbert's Nullstellensatz, we establish a relation between nowhere-zero flows and dual flows. For planar graphs this give... | arxiv | @article{onn2003nowhere-zero,
title={Nowhere-Zero Flow Polynomials},
author={Shmuel Onn},
journal={Journal of Combinatorial Theory Series A, 108:205--215, 2004},
year={2003},
archivePrefix={arXiv},
eprint={math/0309347},
primaryClass={math.CO cs.DM math.AC}
} | onn2003nowhere-zero |
arxiv-676660 | math/0309389 | Approximate Squaring | <|reference_start|>Approximate Squaring: We study the ``approximate squaring'' map f(x) := x ceiling(x) and its behavior when iterated. We conjecture that if f is repeatedly applied to a rational number r = l/d > 1 then eventually an integer will be reached. We prove this when d=2, and provide evidence that it is true ... | arxiv | @article{lagarias2003approximate,
title={Approximate Squaring},
author={J. C. Lagarias, N. J. A. Sloane},
journal={Experimental Math. 13 (2004), 113--128.},
year={2003},
archivePrefix={arXiv},
eprint={math/0309389},
primaryClass={math.NT cs.IT math.IT}
} | lagarias2003approximate |
arxiv-676661 | math/0309425 | Algebraic Aspects of Multiple Zeta Values | <|reference_start|>Algebraic Aspects of Multiple Zeta Values: Multiple zeta values have been studied by a wide variety of methods. In this article we summarize some of the results about them that can be obtained by an algebraic approach. This involves "coding" the multiple zeta values by monomials in two noncommuting v... | arxiv | @article{hoffman2003algebraic,
title={Algebraic Aspects of Multiple Zeta Values},
author={Michael E. Hoffman},
journal={in Zeta Functions, Topology and Quantum Physics (T. Aoki et. al.,
eds.), Springer, 2005, pp. 51-74},
year={2003},
archivePrefix={arXiv},
eprint={math/0309425},
primaryCla... | hoffman2003algebraic |
arxiv-676662 | math/0310020 | Generators of algebraic covariant derivative curvature tensors and Young symmetrizers | <|reference_start|>Generators of algebraic covariant derivative curvature tensors and Young symmetrizers: We show that the space of algebraic covariant derivative curvature tensors R' is generated by Young symmetrized tensor products W*U or U*W, where W and U are covariant tensors of order 2 and 3 whose symmetry classe... | arxiv | @article{fiedler2003generators,
title={Generators of algebraic covariant derivative curvature tensors and Young
symmetrizers},
author={B. Fiedler},
journal={In: Leading-Edge Computer Science, S. Shannon (ed.), Nova Science
Publishers, Inc. New York, 2006. pp. 219-239. ISBN: 1-59454-526-X},
year={200... | fiedler2003generators |
arxiv-676663 | math/0310109 | Shortest paths in the Tower of Hanoi graph and finite automata | <|reference_start|>Shortest paths in the Tower of Hanoi graph and finite automata: We present efficient algorithms for constructing a shortest path between two states in the Tower of Hanoi graph, and for computing the length of the shortest path. The key element is a finite-state machine which decides, after examining ... | arxiv | @article{romik2003shortest,
title={Shortest paths in the Tower of Hanoi graph and finite automata},
author={Dan Romik},
journal={arXiv preprint arXiv:math/0310109},
year={2003},
archivePrefix={arXiv},
eprint={math/0310109},
primaryClass={math.CO cs.DM math.PR}
} | romik2003shortest |
arxiv-676664 | math/0310144 | A Generalization of Repetition Threshold | <|reference_start|>A Generalization of Repetition Threshold: Brandenburg and (implicitly) Dejean introduced the concept of repetition threshold: the smallest real number alpha such that there exists an infinite word over a k-letter alphabet that avoids beta-powers for all beta>alpha. We generalize this concept to inclu... | arxiv | @article{ilie2003a,
title={A Generalization of Repetition Threshold},
author={Lucian Ilie, Jeffrey Shallit},
journal={arXiv preprint arXiv:math/0310144},
year={2003},
archivePrefix={arXiv},
eprint={math/0310144},
primaryClass={math.CO cs.DM}
} | ilie2003a |
arxiv-676665 | math/0310148 | Convolutional Codes of Goppa Type | <|reference_start|>Convolutional Codes of Goppa Type: A new kind of Convolutional Codes generalizing Goppa Codes is proposed. This provides a systematic method for constructing convolutional codes with prefixed properties. In particular, examples of Maximum-Distance Separable (MDS) convolutional codes are obtained.<|re... | arxiv | @article{perez2003convolutional,
title={Convolutional Codes of Goppa Type},
author={J.A. Dominguez Perez, J.M. Mu~noz Porras, G. Serrano Sotelo},
journal={AAECC, 15 (2004), 51-61},
year={2003},
archivePrefix={arXiv},
eprint={math/0310148},
primaryClass={math.OC cs.IT math.AG math.IT}
} | perez2003convolutional |
arxiv-676666 | math/0310149 | Convolutional Goppa Codes | <|reference_start|>Convolutional Goppa Codes: We define Convolutional Goppa Codes over algebraic curves and construct their corresponding dual codes. Examples over the projective line and over elliptic curves are described, obtaining in particular some Maximum-Distance Separable (MDS) convolutional codes.<|reference_en... | arxiv | @article{porras2003convolutional,
title={Convolutional Goppa Codes},
author={J.M. Mu~noz Porras, J.A. Dominguez Perez, J.I. Iglesias Curto, G.
Serrano Sotelo},
journal={arXiv preprint arXiv:math/0310149},
year={2003},
doi={10.1109/TIT.2005.860447},
archivePrefix={arXiv},
eprint={math/03101... | porras2003convolutional |
arxiv-676667 | math/0310175 | Defining Homomorphisms and Other Generalized Morphisms of Fuzzy Relations in Monoidal Fuzzy Logics by Means of BK-Products | <|reference_start|>Defining Homomorphisms and Other Generalized Morphisms of Fuzzy Relations in Monoidal Fuzzy Logics by Means of BK-Products: The present paper extends generalized morphisms of relations into the realm of Monoidal Fuzzy Logics by first proving and then using relational inequalities over pseudo-associat... | arxiv | @article{kohout2003defining,
title={Defining Homomorphisms and Other Generalized Morphisms of Fuzzy
Relations in Monoidal Fuzzy Logics by Means of BK-Products},
author={Ladislav J. Kohout},
journal={arXiv preprint arXiv:math/0310175},
year={2003},
archivePrefix={arXiv},
eprint={math/0310175},
... | kohout2003defining |
arxiv-676668 | math/0310193 | The Satisfiability Threshold of Random 3-SAT Is at Least 352 | <|reference_start|>The Satisfiability Threshold of Random 3-SAT Is at Least 352: We prove that a random 3-SAT instance with clause-to-variable density less than 3.52 is satisfiable with high probability. The proof comes through an algorithm which selects (and sets) a variable depending on its degree and that of its com... | arxiv | @article{hajiaghayi2003the,
title={The Satisfiability Threshold of Random 3-SAT Is at Least 3.52},
author={MohammadTaghi Hajiaghayi and Gregory B. Sorkin},
journal={arXiv preprint arXiv:math/0310193},
year={2003},
archivePrefix={arXiv},
eprint={math/0310193},
primaryClass={math.CO cs.DM math... | hajiaghayi2003the |
arxiv-676669 | math/0310232 | Monotone properties of random geometric graphs have sharp thresholds | <|reference_start|>Monotone properties of random geometric graphs have sharp thresholds: Random geometric graphs result from taking $n$ uniformly distributed points in the unit cube, $[0,1]^d$, and connecting two points if their Euclidean distance is at most $r$, for some prescribed $r$. We show that monotone propertie... | arxiv | @article{goel2003monotone,
title={Monotone properties of random geometric graphs have sharp thresholds},
author={Ashish Goel, Sanatan Rai, Bhaskar Krishnamachari},
journal={Annals of Applied Probability 2005, Vol. 15, No. 4, 2535-2552},
year={2003},
doi={10.1214/105051605000000575},
number={IMS-... | goel2003monotone |
arxiv-676670 | math/0310385 | De Bruijn Cycles for Covering Codes | <|reference_start|>De Bruijn Cycles for Covering Codes: A de Bruijn covering code is a q-ary string S so that every q-ary string is at most R symbol changes from some n-word appearing consecutively in S. We introduce these codes and prove that they can have length close to the smallest possible covering code. The proof... | arxiv | @article{chung2003de,
title={De Bruijn Cycles for Covering Codes},
author={Fan Chung and Joshua N. Cooper},
journal={arXiv preprint arXiv:math/0310385},
year={2003},
archivePrefix={arXiv},
eprint={math/0310385},
primaryClass={math.CO cs.IT math.IT}
} | chung2003de |
arxiv-676671 | math/0311004 | Which Point Configurations are Determined by the Distribution of their Pairwise Distances? | <|reference_start|>Which Point Configurations are Determined by the Distribution of their Pairwise Distances?: In a previous paper we showed that, for any $n \ge m+2$, most sets of $n$ points in $\RR^m$ are determined (up to rotations, reflections, translations and relabeling of the points) by the distribution of their... | arxiv | @article{boutin2003which,
title={Which Point Configurations are Determined by the Distribution of their
Pairwise Distances?},
author={Mireille Boutin, Gregor Kemper},
journal={arXiv preprint arXiv:math/0311004},
year={2003},
archivePrefix={arXiv},
eprint={math/0311004},
primaryClass={math.... | boutin2003which |
arxiv-676672 | math/0311046 | Codes and Invariant Theory | <|reference_start|>Codes and Invariant Theory: The main theorem in this paper is a far-reaching generalization of Gleason's theorem on the weight enumerators of codes which applies to arbitrary-genus weight enumerators of self-dual codes defined over a large class of finite rings and modules. The proof of the theorem u... | arxiv | @article{nebe2003codes,
title={Codes and Invariant Theory},
author={Gabriele Nebe, E.M. Rains, N.J.A. Sloane},
journal={arXiv preprint arXiv:math/0311046},
year={2003},
archivePrefix={arXiv},
eprint={math/0311046},
primaryClass={math.NT cs.IT math.IT}
} | nebe2003codes |
arxiv-676673 | math/0311047 | Assessing security of some group based cryptosystems | <|reference_start|>Assessing security of some group based cryptosystems: One of the possible generalizations of the discrete logarithm problem to arbitrary groups is the so-called conjugacy search problem (sometimes erroneously called just the conjugacy problem): given two elements a, b of a group G and the information... | arxiv | @article{shpilrain2003assessing,
title={Assessing security of some group based cryptosystems},
author={Vladimir Shpilrain},
journal={arXiv preprint arXiv:math/0311047},
year={2003},
archivePrefix={arXiv},
eprint={math/0311047},
primaryClass={math.GR cs.CC cs.CR}
} | shpilrain2003assessing |
arxiv-676674 | math/0311129 | Cayley-Bacharach and evaluation codes on complete intersections | <|reference_start|>Cayley-Bacharach and evaluation codes on complete intersections: In recent work, J. Hansen uses cohomological methods to find a lower bound for the minimum distance of an evaluation code determined by a reduced complete intersection in the projective plane. In this paper, we generalize Hansen's resul... | arxiv | @article{gold2003cayley-bacharach,
title={Cayley-Bacharach and evaluation codes on complete intersections},
author={Leah Gold, John Little, Hal Schenck},
journal={J. Pure Applied Algebra 196 (2005) 91-99},
year={2003},
archivePrefix={arXiv},
eprint={math/0311129},
primaryClass={math.AG cs.IT... | gold2003cayley-bacharach |
arxiv-676675 | math/0311228 | Transforming triangulations on non planar-surfaces | <|reference_start|>Transforming triangulations on non planar-surfaces: We consider whether any two triangulations of a polygon or a point set on a non-planar surface with a given metric can be transformed into each other by a sequence of edge flips. The answer is negative in general with some remarkable exceptions, suc... | arxiv | @article{cortes2003transforming,
title={Transforming triangulations on non planar-surfaces},
author={C. Cortes, C. I. Grima, F. Hurtado, A. Marquez, F. Santos, and J.
Valenzuela},
journal={SIAM J. Discrete Math. 24:3 (2010), 821-840},
year={2003},
doi={10.1137/070697987},
archivePrefix={arXiv}... | cortes2003transforming |
arxiv-676676 | math/0311289 | Complete Weight Enumerators of Generalized Doubly-Even Self-Dual Codes | <|reference_start|>Complete Weight Enumerators of Generalized Doubly-Even Self-Dual Codes: For any q which is a power of 2 we describe a finite subgroup of the group of invertible complex q by q matrices under which the complete weight enumerators of generalized doubly-even self-dual codes over the field with q element... | arxiv | @article{nebe2003complete,
title={Complete Weight Enumerators of Generalized Doubly-Even Self-Dual Codes},
author={Gabriele Nebe, H.-G. Quebbemann, E. M. Rains, N. J. A. Sloane},
journal={Finite Fields Applic. 10 (2004), 540-550},
year={2003},
archivePrefix={arXiv},
eprint={math/0311289},
pr... | nebe2003complete |
arxiv-676677 | math/0311319 | Modular and p-adic cyclic codes | <|reference_start|>Modular and p-adic cyclic codes: This paper presents some basic theorems giving the structure of cyclic codes of length n over the ring of integers modulo p^a and over the p-adic numbers, where p is a prime not dividing n. An especially interesting example is the 2-adic cyclic code of length 7 with g... | arxiv | @article{calderbank2003modular,
title={Modular and p-adic cyclic codes},
author={A. R. Calderbank, N. J. A. Sloane},
journal={Designs, Codes and Cryptography, Vol. 6 (1995), 21-35},
year={2003},
archivePrefix={arXiv},
eprint={math/0311319},
primaryClass={math.CO cs.IT math.IT}
} | calderbank2003modular |
arxiv-676678 | math/0312092 | On the Parameters of Convolutional Codes with Cyclic Structure | <|reference_start|>On the Parameters of Convolutional Codes with Cyclic Structure: In this paper convolutional codes with cyclic structure will be investigated. These codes can be understood as left principal ideals in a suitable skew-polynomial ring. It has been shown in [3] that only certain combinations of the param... | arxiv | @article{gluesing-luerssen2003on,
title={On the Parameters of Convolutional Codes with Cyclic Structure},
author={Heide Gluesing-Luerssen and Barbara Langfeld},
journal={arXiv preprint arXiv:math/0312092},
year={2003},
archivePrefix={arXiv},
eprint={math/0312092},
primaryClass={math.RA cs.IT... | gluesing-luerssen2003on |
arxiv-676679 | math/0312171 | Short formulas for algebraic covariant derivative curvature tensors via Algebraic Combinatorics | <|reference_start|>Short formulas for algebraic covariant derivative curvature tensors via Algebraic Combinatorics: We consider generators of algebraic covariant derivative curvature tensors R' which can be constructed by a Young symmetrization of product tensors W*U or U*W, where W and U are covariant tensors of order... | arxiv | @article{fiedler2003short,
title={Short formulas for algebraic covariant derivative curvature tensors via
Algebraic Combinatorics},
author={Bernd Fiedler},
journal={arXiv preprint arXiv:math/0312171},
year={2003},
archivePrefix={arXiv},
eprint={math/0312171},
primaryClass={math.CO cs.SC ma... | fiedler2003short |
arxiv-676680 | math/0312397 | On Simple Characterisations of Sheffer psi- polynomials and Related Propositions of the Calculus of Sequences | <|reference_start|>On Simple Characterisations of Sheffer psi- polynomials and Related Propositions of the Calculus of Sequences: A calculus of sequences started in 1936 opened the way for future extensions of umbral calculus in its finite operator form. Because of historically established notation we call it the psi-c... | arxiv | @article{kwasniewski2003on,
title={On Simple Characterisations of Sheffer psi- polynomials and Related
Propositions of the Calculus of Sequences},
author={A. K. Kwasniewski},
journal={Bull. Soc. Sci. Lett. Lodz Ser. Rech. Deform. 52, Ser. Rech.
Deform. 36 (2002) pp.45-65},
year={2003},
archivePr... | kwasniewski2003on |
arxiv-676681 | math/0312422 | \Sigma\Pi-polycategories, additive linear logic, and process semantics | <|reference_start|>\Sigma\Pi-polycategories, additive linear logic, and process semantics: We present a process semantics for the purely additive fragment of linear logic in which formulas denote protocols and (equivalence classes of) proofs denote multi-channel concurrent processes. The polycategorical model induced b... | arxiv | @article{pastro2003\sigma\pi-polycategories,,
title={\Sigma\Pi-polycategories, additive linear logic, and process semantics},
author={C. A. Pastro},
journal={arXiv preprint arXiv:math/0312422},
year={2003},
number={Master's thesis, University of Calgary, 2004},
archivePrefix={arXiv},
eprint=... | pastro2003\sigma\pi-polycategories, |
arxiv-676682 | math/0401045 | Unitary Space Time Constellation Analysis: An Upper Bound for the Diversity | <|reference_start|>Unitary Space Time Constellation Analysis: An Upper Bound for the Diversity: The diversity product and the diversity sum are two very important parameters for a good-performing unitary space time constellation. A basic question is what the maximal diversity product (or sum) is. In this paper we are g... | arxiv | @article{han2004unitary,
title={Unitary Space Time Constellation Analysis: An Upper Bound for the
Diversity},
author={Guangyue Han, Joachim Rosenthal},
journal={arXiv preprint arXiv:math/0401045},
year={2004},
archivePrefix={arXiv},
eprint={math/0401045},
primaryClass={math.CO cs.IT math.I... | han2004unitary |
arxiv-676683 | math/0401083 | On extended umbral calculus, oscillator-like algebras and Generalized Clifford Algebra | <|reference_start|>On extended umbral calculus, oscillator-like algebras and Generalized Clifford Algebra: Some quantum algebras build from deformed oscillator algebras may be described in terms of a particular case of extended umbral calculus. We give here an example of a specific relation between such certain quantum... | arxiv | @article{kwasniewski2004on,
title={On extended umbral calculus, oscillator-like algebras and Generalized
Clifford Algebra},
author={A.K.Kwasniewski},
journal={Advances in Applied Clifford Algebras 11 No2 267-279 (2001)},
year={2004},
archivePrefix={arXiv},
eprint={math/0401083},
primaryCla... | kwasniewski2004on |
arxiv-676684 | math/0401157 | Generalized PSK in Space Time Coding | <|reference_start|>Generalized PSK in Space Time Coding: A wireless communication system using multiple antennas promises reliable transmission under Rayleigh flat fading assumptions. Design criteria and practical schemes have been presented for both coherent and non-coherent communication channels. In this paper we ge... | arxiv | @article{han2004generalized,
title={Generalized PSK in Space Time Coding},
author={Guangyue Han},
journal={arXiv preprint arXiv:math/0401157},
year={2004},
doi={10.1109/TCOMM.2005.847166},
archivePrefix={arXiv},
eprint={math/0401157},
primaryClass={math.CO cs.IT math.IT math.OC}
} | han2004generalized |
arxiv-676685 | math/0401279 | Backward Optimized Orthogonal Matching Pursuit | <|reference_start|>Backward Optimized Orthogonal Matching Pursuit: A recursive approach for shrinking coefficients of an atomic decomposition is proposed. The corresponding algorithm evolves so as to provide at each iteration a) the orthogonal projection of a signal onto a reduced subspace and b) the index of the coeff... | arxiv | @article{andrle2004backward,
title={Backward Optimized Orthogonal Matching Pursuit},
author={M. Andrle, L. Rebollo-Neira, E. Sagianos},
journal={arXiv preprint arXiv:math/0401279},
year={2004},
doi={10.1109/LSP.2004.833503},
archivePrefix={arXiv},
eprint={math/0401279},
primaryClass={mat... | andrle2004backward |
arxiv-676686 | math/0402078 | Towards psi-extension of Rota`s Finite Operator Calculus | <|reference_start|>Towards psi-extension of Rota`s Finite Operator Calculus: A class of extended umbral calculi in operator form is presented. Extensions of all basic theorems of classical Finite Operator Calculus are shown to hold. The impossibility of straightforward extending of quantum q-plane formulation of the q-... | arxiv | @article{kwasniewski2004towards,
title={Towards psi-extension of Rota`s Finite Operator Calculus},
author={A. K. Kwasniewski},
journal={Reports on Mathematical Physics Vol. 48 No 3 (2001) : 305-342},
year={2004},
doi={10.1016/S0034-4877(01)80092-6},
archivePrefix={arXiv},
eprint={math/040207... | kwasniewski2004towards |
arxiv-676687 | math/0402125 | Poisson, Dobinski, Rota and coherent states | <|reference_start|>Poisson, Dobinski, Rota and coherent states: New q- Dobinski formula might also be interpreted as the average of specific q-powers of random variable X with the usual Poisson distribution.<|reference_end|> | arxiv | @article{kwasniewski2004poisson,,
title={Poisson, Dobinski, Rota and coherent states},
author={A. K. Kwasniewski},
journal={Bulletin de la Societe des Sciences et des Lettres de
{\pounds}\'od\^e (54) Serie: Recherches sur les Deformations Vol. 45 (2004)
17-19},
year={2004},
archivePrefix={arXiv}... | kwasniewski2004poisson, |
arxiv-676688 | math/0402254 | q-Poisson, q-Dobinski, q-Rota and q-coherent states | <|reference_start|>q-Poisson, q-Dobinski, q-Rota and q-coherent states: q- Dobinski formula may be interpreted as the average of powers of a random variable X_q with the q- Poisson distribution.<|reference_end|> | arxiv | @article{kwasniewski2004q-poisson,,
title={q-Poisson, q-Dobinski, q-Rota and q-coherent states},
author={A. K.Kwasniewski},
journal={Proc. Jangjeon Math. Soc. Vol. 7 (2), 2004 pp. 95-98},
year={2004},
archivePrefix={arXiv},
eprint={math/0402254},
primaryClass={math.CO cs.DM}
} | kwasniewski2004q-poisson, |
arxiv-676689 | math/0402291 | Information on Combinatorial Interpretation of Fibonomial Coefficients | <|reference_start|>Information on Combinatorial Interpretation of Fibonomial Coefficients: Fibonomial coefficients count the number of specific finite birth self-similar subposets of an infinite non-tree poset naturally related to the Fibonacci tree of rabbits growth process.<|reference_end|> | arxiv | @article{kwasniewski2004information,
title={Information on Combinatorial Interpretation of Fibonomial Coefficients},
author={A. K. Kwasniewski},
journal={Bull. Soc. Sci. Lett. Lodz Ser. Rech. Deform. 53, Ser.
Rech.Deform. 42 (2002) pp.39-41},
year={2004},
archivePrefix={arXiv},
eprint={math/04... | kwasniewski2004information |
arxiv-676690 | math/0402344 | More on combinatorial interpretation of the fibonomial coefficients | <|reference_start|>More on combinatorial interpretation of the fibonomial coefficients: Combinatorial interpretation of the fibonomial coefficients as a number of choices of specific finite subsets of an infinite partially ordered set of not binomial type is proposed. This partially ordered set is here defined via char... | arxiv | @article{kwasniewski2004more,
title={More on combinatorial interpretation of the fibonomial coefficients},
author={A. K. Kwasniewski},
journal={Bulletin de la Societe des Sciences et des Lettres de
{\pounds}\'od\^e (54) Serie: Recherches sur les Deformations Vol. 44 (2004)
23-38},
year={2004},
a... | kwasniewski2004more |
arxiv-676691 | math/0402346 | Applications of Lefschetz numbers in control theory | <|reference_start|>Applications of Lefschetz numbers in control theory: We develop some applications of techniques of the Lefschetz coincidence theory in control theory. The topics are existence of equilibria and their robustness, controllability and its robustness.<|reference_end|> | arxiv | @article{saveliev2004applications,
title={Applications of Lefschetz numbers in control theory},
author={Peter Saveliev},
journal={arXiv preprint arXiv:math/0402346},
year={2004},
archivePrefix={arXiv},
eprint={math/0402346},
primaryClass={math.OC cs.SY math.AT}
} | saveliev2004applications |
arxiv-676692 | math/0403017 | Combinatorial interpretation of the recurrence relation for fibonomial coefficients | <|reference_start|>Combinatorial interpretation of the recurrence relation for fibonomial coefficients: Combinatorial interpretation of the fibonomial coefficients recently proposed by the present author results here in combinatorial interpretation of the recurrence relation for fibonomial coefficients . The presentati... | arxiv | @article{kwasniewski2004combinatorial,
title={Combinatorial interpretation of the recurrence relation for fibonomial
coefficients},
author={A.K.Kwasniewski},
journal={Bulletin de la Societe des Sciences et des Lettres de
{\pounds}\'od\^e (54) Serie: Recherches sur les Deformations Vol. 44 (2004)
pp. 2... | kwasniewski2004combinatorial |
arxiv-676693 | math/0403054 | $\psi$-Poisson, $q$-Cigler, $\psi$-Dobinski, $\psi$-Rota and $\psi$-coherent states | <|reference_start|>$\psi$-Poisson, $q$-Cigler, $\psi$-Dobinski, $\psi$-Rota and $\psi$-coherent states: Cigler simple derivation of usual and extended Dobinski formula is recalled and it is noted that both may be interpreted as averages of powers of random variables with the corresponding usual or extended Poisson dist... | arxiv | @article{kwasniewski2004$\psi$-poisson,,
title={$\psi$-Poisson, $q$-Cigler, $\psi$-Dobinski, $\psi$-Rota and
$\psi$-coherent states},
author={A. K. Kwasniewski},
journal={Proc. Jangjeon Math. Soc. Vol. 7 (2), 2004 pp. 95-98},
year={2004},
archivePrefix={arXiv},
eprint={math/0403054},
prima... | kwasniewski2004$\psi$-poisson, |
arxiv-676694 | math/0403107 | Cauchy type identities and corresponding fermatian matrices via non-comuting variables of extended finite operator calculus | <|reference_start|>Cauchy type identities and corresponding fermatian matrices via non-comuting variables of extended finite operator calculus: New family of extended Cauchy type identities is found and related Fermat type matrices are provided ready for applications in extended scope. This is achieved due to the use s... | arxiv | @article{kwasniewski2004cauchy,
title={Cauchy type identities and corresponding fermatian matrices via
non-comuting variables of extended finite operator calculus},
author={A. KL. Kwasniewski},
journal={Proc. Jangjeon Math. Soc. Vol 8 (2005) no. 2. pp.191-196},
year={2004},
archivePrefix={arXiv},
... | kwasniewski2004cauchy |
arxiv-676695 | math/0403123 | Pascal like matrices - an accessible factory of one source identities and resulting applications | <|reference_start|>Pascal like matrices - an accessible factory of one source identities and resulting applications: The extension of pascalian like matrices depending on a variable from any field of zero characteristics are shown at work for the first time. Their properties appear to be one source factory of identitie... | arxiv | @article{kwasniewski2004pascal,
title={Pascal like matrices - an accessible factory of one source identities
and resulting applications},
author={A. K. Kwasniewski},
journal={Adv. Stud. Contemp. Math. 10 (2005) No. 2, pp. 111-120},
year={2004},
archivePrefix={arXiv},
eprint={math/0403123},
... | kwasniewski2004pascal |
arxiv-676696 | math/0403139 | First contact remarks on umbra difference calculus references streams | <|reference_start|>First contact remarks on umbra difference calculus references streams: The reference links to the modern classical umbral calculus before that known as blissardian symbolic method are numerous. Rota founded and then extended finite operator calculus has links to references which are plenty numerous. ... | arxiv | @article{kwasniewski2004first,
title={First contact remarks on umbra difference calculus references streams},
author={A.K.Kwasniewski},
journal={Bull. Soc. Sci. Lett. Lodz, 60, (2005) pp. 17-25 ArXiv:
math.CO/0403139},
year={2004},
archivePrefix={arXiv},
eprint={math/0403139},
primaryClass... | kwasniewski2004first |
arxiv-676697 | math/0403548 | Remarks on codes from modular curves: MAGMA applications | <|reference_start|>Remarks on codes from modular curves: MAGMA applications: Expository paper discussing AG or Goppa codes arising from curves, first from an abstract general perspective then turning to concrete examples associated to modular curves. We will try to explain these extremely technical ideas using a specia... | arxiv | @article{joyner2004remarks,
title={Remarks on codes from modular curves: MAGMA applications},
author={David Joyner and Salahoddin Shokranian},
journal={Algebr. Geom. Topol. 12 (2012) 2259-2286},
year={2004},
doi={10.2140/agt.2012.12.2259},
archivePrefix={arXiv},
eprint={math/0403548},
pr... | joyner2004remarks |
arxiv-676698 | math/0404076 | Probabilistic Solutions of Equations in the Braid Group | <|reference_start|>Probabilistic Solutions of Equations in the Braid Group: Given a system of equations in a "random" finitely generated subgroup of the braid group, we show how to find a small ordered list of elements in the subgroup, which contains a solution to the equations with a significant probability. Moreover,... | arxiv | @article{garber2004probabilistic,
title={Probabilistic Solutions of Equations in the Braid Group},
author={D. Garber, S. Kaplan, M. Teicher, B. Tsaban and U. Vishne},
journal={Advances in Applied Mathematics 35 (2005), 323--334},
year={2004},
doi={10.1016/j.aam.2005.03.002},
archivePrefix={arXiv... | garber2004probabilistic |
arxiv-676699 | math/0404158 | A note on mobiusien function and mobiusien inversion formula of fibonacci cobweb poset | <|reference_start|>A note on mobiusien function and mobiusien inversion formula of fibonacci cobweb poset: The explicit formula for mobiusien function of fibonacci cobweb poset P is given for the first time by the use of definition of P in plane grid coordinate system.<|reference_end|> | arxiv | @article{krot2004a,
title={A note on mobiusien function and mobiusien inversion formula of
fibonacci cobweb poset},
author={Ewa Krot},
journal={Bulletin de la Societe des Sciences et des Lettres de Lodz (54),
Serie: Recherches sur les Deformations Vol. 44 (2004), 39-44},
year={2004},
archivePref... | krot2004a |
arxiv-676700 | math/0404325 | Asymptotic Improvement of the Gilbert-Varshamov Bound on the Size of Binary Codes | <|reference_start|>Asymptotic Improvement of the Gilbert-Varshamov Bound on the Size of Binary Codes: Given positive integers $n$ and $d$, let $A_2(n,d)$ denote the maximum size of a binary code of length $n$ and minimum distance $d$. The well-known Gilbert-Varshamov bound asserts that $A_2(n,d) \geq 2^n/V(n,d-1)$, whe... | arxiv | @article{jiang2004asymptotic,
title={Asymptotic Improvement of the Gilbert-Varshamov Bound on the Size of
Binary Codes},
author={Tao Jiang and Alexander Vardy},
journal={IEEE TRANSACTIONS ON INFORMATION THEORY, vol. 50, No. 8, pp.
1655-1664, August 2004
(http://www.ieeexplore.ieee.org/iel5/18/29198/01... | jiang2004asymptotic |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.