Minimal Codewords in Linear Codes

2000 Mathematics Subject Classification: 94B05, 94B15.

Minimal Subspaces with Maximal Dimensioanal Diameters

Владимир Тодоров - Нека X е компактно метрично пространство с dim X = n. Тогава за n − 1 - мерния диаметър dn−1(X) на X е изпълнено неравенството dn−1(X) > 0, докато dn(X) = 0 (да отбележим, че това е една от характеристиките на размерността на Лебег). От тук се получава, че X съдържа минимално по включване затворено подмножество Y , за което dn−1(Y ) = dn−1(X). Известен резултат е, че от това следва, че Y е Канторово Многообразие. В тази бележка доказваме, че всяко такова (минимално) подпространство Y е даже континуум V^n. Получени са също така някои следствия.

On Optimal Quadratic Lagrange Interpolation: Extremal Node Systems with Minimal Lebesgue Constant via Symbolic Computation

ACM Computing Classification System (1998): G.1.1, G.1.2.

Block, L. (2011). ‘From politics to policing: the rationality gap in EU Council policy- making’

Book review: L Block. (2011). From Politics to Policing: The Rationality Gap in EU Council Policy-Making The Hague: Eleven International Publishing. ISBN: 978-94-9094-737-8, 361 pages.

Tax morale and tax evasion: Social preferences and bounded rationality

We study a family of models of tax evasion, where a flat-rate tax finances only the provision of public goods, neglecting audits and wage differences. We focus on the comparison of two modeling approaches. The first is based on optimizing agents, who are endowed with social preferences, their utility being the sum of private consumption and moral utility. The second approach involves agents acting according to simple heuristics. We find that while we encounter the traditionally shaped Laffer-curve in the optimizing model, the heuristics models exhibit (linearly) increasing Laffercurves. This difference is related to a peculiar type of behavior emerging within the heuristics based approach: a number of agents lurk in a moral state of limbo, alternating between altruism and selfishness.

Adómorál és adócsalás - társadalmi preferenciák és korlátozott racionalitás = Tax morale and tax system: social preferences and bounded rationality

Az adócsalásnak egy olyan modellcsaládját vizsgáljuk, ahol az egykulcsos adó kizárólag a közjavakat finanszírozza. Két megközelítés összehasonlítására összpontosítunk. Az elsőben minden dolgozó jövedelme azonos, és ebből minden évben annyit vall be, amennyi maximalizálja a nála maradó jövedelemből fedezhető fogyasztás nyújtotta hasznosság és a jövedelembevallásból fakadó hasznosság összegét. A második hasznosság három tényező szorzata: a dolgozó exogén adómorálja, a környezetében előző évben megfigyelt átlagos jövedelembevallás és saját bevallásából fakadó endogén hasznossága. A második megközelítésben az ágensek egyszerű heurisztikus szabályok szerint cselekszenek. Míg az optimalizáló modellben hagyományos Laffer-görbékkel találkozunk, addig a heurisztikán alapuló modellekben (lineárisan) növekvő Laffer-görbék jönnek létre. E különbség oka, hogy a heurisztikán alapuló modellben egy sajátos viselkedésfajta jelentkezik: számos ágens ingatag helyzetbe kerül, amelyben altruizmus és önzés között ingadozik. ________ The authors study a family of models of tax evasion, where a flat-rate tax only finances the provision of public goods and audits and wage differences are ne-glected. The paper focuses on comparing two modelling approaches. The first is based on optimizing agents, endowed with social preferences, their utility being the sum of private consumption and moral utility. The second approach involves agents acting according to simple heuristics. While the traditionally shaped Laffer curves are encountered in the optimizing model, the heuristics models exhibit (linearly) increasing Laffer curves. This difference is related to a peculiar type of behaviour: within the agent-based approach lurk a number of agents in a moral state of limbo, alternating between altruism and selfishness.

Algebraic theory of minimal nondeterministic finite automata with applications

Since the 1950s, the theory of deterministic and nondeterministic finite automata (DFAs and NFAs, respectively) has been a cornerstone of theoretical computer science. In this dissertation, our main object of study is minimal NFAs. In contrast with minimal DFAs, minimal NFAs are computationally challenging: first, there can be more than one minimal NFA recognizing a given language; second, the problem of converting an NFA to a minimal equivalent NFA is NP-hard, even for NFAs over a unary alphabet. Our study is based on the development of two main theories, inductive bases and partials, which in combination form the foundation for an incremental algorithm, ibas, to find minimal NFAs. An inductive basis is a collection of languages with the property that it can generate (through union) each of the left quotients of its elements. We prove a fundamental characterization theorem which says that a language can be recognized by an n-state NFA if and only if it can be generated by an n-element inductive basis. A partial is an incompletely-specified language. We say that an NFA recognizes a partial if its language extends the partial, meaning that the NFA’s behavior is unconstrained on unspecified strings; it follows that a minimal NFA for a partial is also minimal for its language. We therefore direct our attention to minimal NFAs recognizing a given partial. Combining inductive bases and partials, we generalize our characterization theorem, showing that a partial can be recognized by an n-state NFA if and only if it can be generated by an n-element partial inductive basis. We apply our theory to develop and implement ibas, an incremental algorithm that finds minimal partial inductive bases generating a given partial. In the case of unary languages, ibas can often find minimal NFAs of up to 10 states in about an hour of computing time; with brute-force search this would require many trillions of years.

A Minimal History of the Cuban Revolution (Historia mínima de Ia Revolución Cubana), Book Presentation by Author Rafael Rojas

This flyer promotes the event "A Minimal History of the Cuban Revolution (Historia mínima de Ia Revolución Cubana), Book Presentation by Author Rafael Rojas", part at the SIPA at Books & Books series. This event held at Books & Books in Coral Gables.

Algebraic Theory of Minimal Nondeterministic Finite Automata with Applications

Since the 1950s, the theory of deterministic and nondeterministic finite automata (DFAs and NFAs, respectively) has been a cornerstone of theoretical computer science. In this dissertation, our main object of study is minimal NFAs. In contrast with minimal DFAs, minimal NFAs are computationally challenging: first, there can be more than one minimal NFA recognizing a given language; second, the problem of converting an NFA to a minimal equivalent NFA is NP-hard, even for NFAs over a unary alphabet. Our study is based on the development of two main theories, inductive bases and partials, which in combination form the foundation for an incremental algorithm, ibas, to find minimal NFAs. An inductive basis is a collection of languages with the property that it can generate (through union) each of the left quotients of its elements. We prove a fundamental characterization theorem which says that a language can be recognized by an n-state NFA if and only if it can be generated by an n-element inductive basis. A partial is an incompletely-specified language. We say that an NFA recognizes a partial if its language extends the partial, meaning that the NFA's behavior is unconstrained on unspecified strings; it follows that a minimal NFA for a partial is also minimal for its language. We therefore direct our attention to minimal NFAs recognizing a given partial. Combining inductive bases and partials, we generalize our characterization theorem, showing that a partial can be recognized by an n-state NFA if and only if it can be generated by an n-element partial inductive basis. We apply our theory to develop and implement ibas, an incremental algorithm that finds minimal partial inductive bases generating a given partial. In the case of unary languages, ibas can often find minimal NFAs of up to 10 states in about an hour of computing time; with brute-force search this would require many trillions of years.

A minimal model of partial synchrony

Acknowledgement We wish to acknowledge A. Pikovsky and M. Zaks for useful discussions. This work has been financially supported by the EU project COSMOS (642563).

A minimal model of partial synchrony

We wish to acknowledge A Pikovsky and M Zaks for useful discussions. This work has been financially supported by the EU project COSMOS (642563).

Levi-flat Minimal Hypersurfaces in Two-dimensional Complex Space Forms

The purpose of this article is to classify the real hypersurfaces in complex space forms of dimension 2 that are both Levi-flat and minimal. The main results are as follows: When the curvature of the complex space form is nonzero, there is a 1-parameter family of such hypersurfaces. Specifically, for each one-parameter subgroup of the isometry group of the complex space form, there is an essentially unique example that is invariant under this one-parameter subgroup. On the other hand, when the curvature of the space form is zero, i.e., when the space form is complex 2-space with its standard flat metric, there is an additional `exceptional' example that has no continuous symmetries but is invariant under a lattice of translations. Up to isometry and homothety, this is the unique example with no continuous symmetries.

Language, Logos, and Social Ontology: Naturalist and Post-Naturalist Narratives of Human Rationality and Social Reality

I distinguish two ways that philosophers have approached and explained the reality and status of human social institutions. I call these approaches “naturalist” and “post-naturalist”. Common to both approaches is an understanding that the status of mind and its relation to the world or “nature” has implications on a conception of the status of institutional reality. Naturalists hold that mind is explicable within a scientific frame that conceives of mind as a fundamentally material process. By proxy, social reality is also materially explicable. Post-naturalists critique this view, holding instead that naturalism is parasitic on contemporary science—it therefore is non-compulsory and distorts how we ought to understand mind and social reality. A comparison of naturalism and post-naturalism will comprise the content of the first chapter. The second chapter turns to tracing out the dimensions of a post-naturalist narrative of mind and social reality. Post-naturalists conceive of mind and its activity of thought as sui generis, and it transpires from this that social institutions are better understood as a rational mind’s mode of the expression in the world. Post-naturalism conceives of social reality as a necessary dimension of thought. Thought requires a second person and thereby a tradition or context of norms that come to both structure its expression and become the products of expression. This is in contrast to the idea that social reality is a production of minds, and thereby derivative. Social reality, self-conscious thought, and thought of the second person are therefore three dimensions of a greater unity.

Application of self-quenched JH consensus primers for real-time quantitative PCR of IGH gene to minimal residual disease evaluation in multiple myeloma.

Monitoring multiple myeloma patients for relapse requires sensitive methods to measure minimal residual disease and to establish a more precise prognosis. The present study aimed to standardize a real-time quantitative polymerase chain reaction (PCR) test for the IgH gene with a JH consensus self-quenched fluorescence reverse primer and a VDJH or DJH allele-specific sense primer (self-quenched PCR). This method was compared with allele-specific real-time quantitative PCR test for the IgH gene using a TaqMan probe and a JH consensus primer (TaqMan PCR). We studied nine multiple myeloma patients from the Spanish group treated with the MM2000 therapeutic protocol. Self-quenched PCR demonstrated sensitivity of >or=10(-4) or 16 genomes in most cases, efficiency was 1.71 to 2.14, and intra-assay and interassay reproducibilities were 1.18 and 0.75%, respectively. Sensitivity, efficiency, and residual disease detection were similar with both PCR methods. TaqMan PCR failed in one case because of a mutation in the JH primer binding site, and self-quenched PCR worked well in this case. In conclusion, self-quenched PCR is a sensitive and reproducible method for quantifying residual disease in multiple myeloma patients; it yields similar results to TaqMan PCR and may be more effective than the latter when somatic mutations are present in the JH intronic primer binding site.