نتایج جستجو برای: m pure exact

تعداد نتایج: 736445  

2018
Daniele Bartoli Ariane M. Masuda Maria Montanucci Luciane Quoos

We consider the algebraic curve defined by $y^m = f(x)$ where $m \geq 2$ and $f(x)$ is a rational function over $\mathbb{F}_q$. We extend the concept of pure gap to {\bf c}-gap and obtain a criterion to decide when an $s$-tuple is a {\bf c}-gap at $s$ rational places on the curve. As an application, we obtain many families of pure gaps at two rational places on curves with many rational places.

2012
ALEJANDRO MURAMATSU Marcos Rigol

Submitted for the MAR05 Meeting of The American Physical Society Non-equilibrium dynamics of hard-core bosons on 1D lattices: short vs large time results MARCOS RIGOL, Physics Department, University of California, Davis, ALEJANDRO MURAMATSU, Institut fuer Theoretische Physik III, Universitaet Stuttgart — Based on an exact treatment we study the non-equilibrium dynamics of hard-core bosons on on...

2015
Emanuele Papini Aaron C. Birch Laurent Gizon Shravan M. Hanasoge

Acoustic modes of oscillation are affected by stellar activity, however it is unclear how starspots contribute to these changes. Here we investigate the nonmagnetic effects of starspots on global modes with angular degree ` ≤ 2 in highly active stars, and characterize the spot seismic signature on synthetic light curves. We perform 3D time-domain simulations of linear acoustic waves to study th...

2011
Constantinos Daskalakis

Two-Player (Normal-Form) Games. A two-player normal-form game is specified via a pair (R,C) of m × n payoff matrices. The two players of the game, called the row player and the column player, have respectively m and n pure strategies. As the players’ names imply, the pure strategies of the row player are in one-to-one correspondence with the rows of the payoff matrices, while the strategies of ...

2000
Andris Ambainis Leonard J. Schulman Umesh V. Vazirani

We consider quantum computing in the one-qubit model where the starting state of a quantum computer consists of k qubits in a pure state and n − k qubits in a maximally mixed state. We ask the following question: is there a general method for simulating an arbitrary m-qubit pure state quantum computation by a quantum computation in the kqubit model? We show that, under certain constraints, this...

2008
Somendra M. Bhattacharjee

I Directed polymers A Why bother? II Hamiltonian and Randomness A Pure case B Let’s put randomness 1 Hamiltonian 2 Partition function 3 Averages C What to look for? D Size: disorder and thermal correlation 1 Free energy fluctuation 2 Our Aim 3 Digression: Self-averaging III Q.: Is disorder relevant? A Annealed average: low temperature problem B Moments of Z 1 Hamiltonian for moments 2 Bound sta...

2015
A. Hayes S. Sharifi

The role of salivary media is essential during mastication and ingestion processes; yet it can hinder the performance of foreign materials in the oral cavity. The aim of this study was to examine the effects of applied load and applied electrical potential on the tribo-corrosion mechanisms of 316L stainless steel in an environment similar to oral cavity conditions. 316L stainless steel is a mat...

2002
Stefano Arnone Antonio Gatti Tim R. Morris

A manifestly gauge invariant exact renormalization group for pure SU(N) Yang-Mills theory is proposed, allowing gauge invariant calculations, without any gauge fixing or ghosts. The necessary gauge invariant regularisation which implements the effective cutoff, is naturally incorporated by embedding the theory into a spontaneously broken SU(N |N) super-gauge theory. This guarantees finiteness t...

2014
Thomas Bläsius Guido Brückner Ignaz Rutter

We show that finding orthogonal grid-embeddings of plane graphs (planar with fixed combinatorial embedding) with the minimum number of bends in the so-called Kandinsky model (which allows vertices of degree > 4) is NP-complete, thus solving a long-standing open problem. On the positive side, we give an efficient algorithm for several restricted variants, such as graphs of bounded branch width a...

2009
Chris Gray Maarten Löffler Rodrigo I. Silveira

A 1.5D terrain is an x-monotone polyline with n vertices. An imprecise 1.5D terrain is a 1.5D terrain with a y-interval at each vertex, rather than a fixed y-coordinate. A realization of an imprecise terrain is a sequence of n y-coordinates—one for each interval— such that each y-coordinate is within its corresponding interval. For certain applications in terrain analysis, it is important to be...

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید