2,304 results for finite · 0.120s

arxiv.org/abs/2202.13370v3

Submodule codes as spherical codes in buildings

We give a generalization of subspace codes by means of codes of modules over finite commutative chain rings. We define a new class of Sperner codes and use results from extremal combinatorics to prove the optimality of such codes in different cases....

arxiv.org/abs/1510.01509v3

$Z_4$-codes and their Gray map images as orthogonal arrays

A classic result of Delsarte connects the strength (as orthogonal array) of a linear code with the minimum weight of its dual: the former is one less than the latter. We show that Delsarte's observation extends to codes over arbitrary finite rings....

Sponsored Partners
arxiv.org/abs/1202.0085v3

Affine cartesian codes

We compute the basic parameters (dimension, length, minimum distance) of affine evaluation codes defined on a cartesian product of finite sets. Given a sequence of positive integers, we construct an evaluation code, over a degenerate torus, with pres...

arxiv.org/abs/1102.3932v3

Fife's Theorem Revisited

We give another proof of a theorem of Fife - understood broadly as providing a finite automaton that gives a complete description of all infinite binary overlap-free words. Our proof is significantly simpler than those in the literature. As an applic...

arxiv.org/abs/2202.01377v2

Constructing knots with specified geometric limits

It is known that any tame hyperbolic 3-manifold with infinite volume and a single end is the geometric limit of a sequence of finite volume hyperbolic knot complements. Purcell and Souto showed that if the original manifold embeds in the 3-sphere, th...

arxiv.org/abs/1801.04968v2

On Goodman realizability

Goodman's theorem (1976) states that intuitionistic finite-type arithmetic plus the axiom of choice plus the axiom of relativized dependent choice is conservative over Heyting arithmetic. The same result applies to the extensional variant. This is du...

arxiv.org/abs/2312.08705v1

Combinatorial Results on Barcode Lattices

A barcode is a finite multiset of intervals on the real line. Jaramillo-Rodriguez (2023) previously defined a map from the space of barcodes with a fixed number of bars to a set of multipermutations, which presented new combinatorial invariants on th...

arxiv.org/abs/math/0502349v1

Absolute Whitehead torsion

We refine the Whitehead torsion of a chain equivalence of finite chain complexes in an additive category $\bA$ from an element of $\widetilde{K}^{iso}_1(\bA)$ to an element of the absolute group $K_1^{iso}(\bA)$. We apply this invariant to symmetri...

arxiv.org/abs/1006.5752v1

Solomon's induction in quasi-elementary groups

Given a finite group G, we address the following question: which multiples of the trivial representation are linear combinations of inductions of trivial representations from proper subgroups of G? By Solomon's induction theorem, all multiples are if...

www.bing.com/ck/a?!&&p=ffaa464cebdbdd23a480c8a7cdfc4531a8f6c958f6af09326c6593c7dd5f7f61JmltdHM9MTc3MjE1MDQwMA&ptn=3&ver=2&hsh=4&fclid=182dae09-0d95-6c57-0a6a-b9040c686d8a&u=a1aHR0cHM6Ly93d3cuZWUuaWl0bS5hYy5pbi92bHNpL19tZWRpYS9jb3Vyc2VzL2VlMzAwMl8yMDE4L3R1dG9yaWFsNS5wZGY&ntb=1

Analog Circuits (EE3002/EE5310) : Problem Set 5 shanthi@ee ...

All transistors have finite output impedance, such that for any transistor, gmro = 100. Draw the small signal equivalent circuit of the amplifier. Determine the small signal gain from vi to vout and the input …

arxiv.org/abs/2311.11679v2

Perfect Simulation of Las Vegas Algorithms via Local Computation

The notion of Las Vegas algorithms was introduced by Babai (1979) and can be defined in two ways: * In Babai's original definition, a randomized algorithm is called Las Vegas if it has a finitely bounded running time and certifiable random failure....

arxiv.org/abs/1811.07175v2

Sensitivity and accuracy of Casimir force measurements in air

Quantum electrodynamic fluctuations cause an attractive force between metallic surfaces. At separations where the finite speed of light affects the interaction, it is called the Casimir force. Thermal motion determines the fundamental sensitivity lim...

arxiv.org/abs/2005.00744v1

Charged impurity scattering in bilayer-graphene double layers

We consider a double-layer system made of two parallel bilayer graphene sheets separated by a dielectric medium. We calculate the finite-temperature electrical conductivity of the first layer due to charged impurities located in two layers. We study...

arxiv.org/abs/2509.08904v1

Hurwitz space components; and the Coleman-Oort Conjecture

Hurwitz spaces are moduli of isotopy classes of covers. A specific space is formed from a finite group G and C, r of its conjugacy classes and an equivalence relation \dagger. Components, interpret as a braid orbits on Nielsen classes. Fried-Völkl...

arxiv.org/abs/1712.03620v1

A Generalization of Schur's Theorem

This paper is an excerpt from the author's 1968 PhD dissertation [Yale University, 1968] in which the (now) well-known result, commonly known as the Folkman-Rado-Sanders theorem, is proved. The proof uses (finite) alternating sums of integers and an...

arxiv.org/abs/1308.4605v2

Efficient Variable-Coefficient Finite-Volume Stokes Solvers

We investigate several robust preconditioners for solving the saddle-point linear systems that arise from spatial discretization of unsteady and steady variable-coefficient Stokes equations on a uniform staggered grid. Building on the success of usin...

arxiv.org/abs/2211.09465v1

Incidences of Cubic Curves in Finite Fields

In this paper we prove an incidence bound for points and cubic curves over prime fields. The methods generalise those used by Mohammadi, Pham, and Warren (2021)....

arxiv.org/abs/math/0602125v1

On the conjugacy problem for Carter subgroups

It is proven in the paper, that Carter subgroups of a finite group are conjugate if Carter subgroups in the group of induced automorphisms for every non-Abelian composition factor are conjugate....

arxiv.org/abs/1703.09855v2

Derived $\ell$-adic zeta functions

We lift the classical Hasse--Weil zeta function of varieties over a finite field to a map of spectra with domain the Grothendieck spectrum of varieties constructed by Campbell and Zakharevich. We use this map to prove that the Grothendieck spectrum o...

arxiv.org/abs/0807.2391v2

Quark Gluon Bags as Reggeons

The influence of the medium dependent finite width of QGP bags on their equation of state is analyzed within an exactly solvable model. It is argued that the large width of the QGP bags not only explains the observed deficit in the number of hadron...

arxiv.org/abs/math/0701214v2

Graphs, free groups and the Hanna Neumann conjecture

A new bound for the rank of the intersection of finitely generated subgroups of a free group is given, formulated in topological terms, and very much in the spirit of Stallings. The bound is a contribution to (although unfortunately not a solution...

arxiv.org/abs/1308.5122v2

Quotients and subgroups of Baumslag-Solitar groups

We determine all generalized Baumslag-Solitar groups (finitely generated groups acting on a tree with all stabilizers infinite cyclic) which are quotients of a given Baumslag-Solitar group BS(m,n), and (when BS(m,n) is not Hopfian) which of them also...

arxiv.org/abs/1710.06309v3

A group version of stable regularity

We prove that, given $ε>0$ and $k\geq 1$, there is an integer $n$ such that the following holds. Suppose $G$ is a finite group and $A\subseteq G$ is $k$-stable. Then there is a normal subgroup $H\leq G$ of index at most $n$, and a set $Y\subseteq G$...

arxiv.org/abs/0907.1388v2

A classification of Curtis-Tits amalgams

A celebrated theorem of Curtis and Tits on groups with finite BN-pair shows that roughly speaking these groups are determined by their local structure. This result was later extended to Kac-Moody groups by P.~Abramenko and B.~Mühlherr. Their theorem...

arxiv.org/abs/2509.00611v2

Comparing Left and Right Quotient Sets in Groups

For a finite subset $A$ of a group $G$, we define the right quotient set and the left quotient set of $A$, respectively, as $AA^{-1} := \{a_1a_2^{-1}:a_1,a_2\in A\}$, $A^{-1}A := \{a_1^{-1}a_2:a_1,a_2\in A\}$. While the right and left quotient sets a...

arxiv.org/abs/2111.05052v1

Between Turing and Kleene

Turing's famous `machine' model constitutes the first intuitively convincing framework for computing with real numbers. Kleene's computation schemes S1-S9 extend Turing's approach to computing with objects of any finite type. Both frameworks have the...